CMSC216 Spring 2016 (Midterm I Information)

General Information

• Date: Thursday, Mar 3
• Time/Location: Your exam will take place in lecture.
• Duration: 75 minutes
• Closed-book, Closed-notebooks, No Computers/Calculators.
• Use a pencil/mechanical pencil (no pen) to answer 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.
• Please bring a stapler if you tend to separate the pages of the exam.

Exam Structure

• 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.

Topics

The exam will include all the material covered in discussion section (lab), lecture, quizzes, exercises and project #1 including the following topics:

• Unix - You must be familiar with the following commands
  • cp
  • ls
  • cd
  • pwd
  • gcc (you do not need to know any flags)
  • rm
  • mv
• C Language
  • Preprocessor directives (e.g., #include, #define)
  • Expressions
  • sizeof operator
  • Conditional statements
  • Loops
  • Linkage
  • Scope
  • Storage types
  • Arrays (one and two dimensional arrays)
  • Strings - You are responsible for the following string functions:
    • strlen
    • strcpy
    • strcmp
  • Pointers
  • enum
  • Functions
  • Command line arguments
  • atoi function
• Memory maps - Please use the style provided in the following example MemoryMapExample.pdf
• Recursion

The exam will NOT cover the following topics:

• Emacs, debugger, splint, valgrind, -fmudflapth -lmudflap, structures, unions, make utility (makefiles), dynamic memory allocation, reading/writing from files, function pointers, bitwise operations, perror, exit

Practice Material

Practice material can be found in the grace system under 216public/exams/exam1. 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