Midterm #2 (CMSC216 (Spring 2018))

• Date: Thursday, Apr 19, 2018
• Time/Location: Your exam will take place in lecture.
• Duration: 75 minutes
• Closed-book, Closed-notebooks, No Computers/Calculators.
• You will lose points if you don't know your class section (e.g., 0101, 0102, etc.)
• You will lose points if you don't PRINT your name in uppercase letters (no cursive).
• Use a pencil/mechanical pencil (no pen) to answer the exam.
• Please bring a stapler if you tend to separate the pages of the exam.
• Please take a look at the general exam rules available at exam rules.
• The best way to prepare for the exam is to practice old exams. Complete several of them in the allocated time specified in the exam.
• We curve in this course. After you taken the exam, do not discuss anything associated with the exam with other students that have not taken the exam yet.
• Posting any information in Piazza about the exam after taking it is considered an academic integrity violation.

• Short answer questions: This includes for example, multiple choice, true/false, and fill-in-the-blank type questions.
• Code analysis questions: We will give a short segment of code and you may be asked to identify syntax and logical errors, generate code output, etc.
• Code Writing: Write a program/code snippets to solve a given problem. You should be prepared to give a complete program, but we may also ask you to provide just a single function or a code fragment.

The exam will include all the material covered in discussion session (lab), lecture, quizzes, exercises, and projects (#1 and #2, #3, #4, #5) including the following topics:

• Unix - You must be familiar with the following commands
  • cp
  • ls
  • cd
  • pwd
  • gcc
  • rm
  • mv
  • diff
  • rmdir
  • rm -r
  • How to create a compressed gzip archive file
  • How to uncompress a tar.gz file
  • How to use grep to find patterns in a file
  • How to change file permissions (e.g., chmod 700 file)
• C Language
  • Preprocessor directives (e.g., #include, #define, #ifdef)
  • Expressions
  • Bitwise Operators
  • Conditional statements
  • Loops
  • Arrays (one and two dimensional arrays)
  • Strings - You are responsible for the following string functions:
    • strlen
    • strcpy
    • strcmp
    • strcat
    • memcpy
    • memmove
  • Pointers (including function pointers)
  • enum
  • Structures
  • Unions
  • Functions
  • stdin, stderr, stdout
  • Linkage
  • Command line arguments
  • exit
  • err
  • perror
  • Dynamic Memory Allocation (malloc, realloc, free, etc.)
• Reading and writing from files. The following cheat sheet will be provided in the exam Standard IO Cheat Sheet.
• Memory maps - Please use the style provided in the following example MemoryMapExample.pdf. Previous exam solutions consider as correct using a pointer to the first array element in order to describe an array; that is not correct. See the diagram we have provided.
• Linked Lists (both singly and doubly linked lists)
• Recursion
• Makefiles - You need to know how to define makefiles without using implicit rules.
• Big Endian vs. Little Endian
• AVR Assembly
  • Be familiar with instructions used in your exercise(s) and project.
  • How to define recursive solutions.
  • The following cheat sheet will be provided in the exam Assembly Cheat Sheet.
  • You are not responsible for setting a frame (as described by the class example frame.S)
  • We don't have old exams that rely on AVR assembly, however you can use assembly problems for Y86 (what you will see in old exams) to practice. Usually a C function is presented and we ask for an assembly implementation. Instead of providing a Y86 solution, provide an AVR one.

The exam will NOT cover the following topics:

• fork, exec*, emacs, arduino, debugger, splint, valgrind, -fmudflapth -lmudflap

Contact your instructor for actual exam coverage.

Practice material can be found in the grace system under 216public/exams/exam2. To transfer this material to your computer use https://dav.terpconnect.umd.edu . Use your directory id/passwd (same one used for grace) to log on.

Web Accessibility