Midterm Exam

Wednesday, March 8 10:00am - 10:50am.

It will be given in-person on-paper live in two locations, assigned by precept section:

• Precepts P01, P02, P03, P05, P06, P07: Friend 101
• Precepts P04, P04A: Computer Science 105

Rules

You will have fifty minutes to complete the exam. This will be a closed-book, closed-note exam, with the exception that a single one-sided study sheet will be allowed. No electronic devices will be permitted to be used during the exam. No communication with any person will be permitted, with the exception of the instructors who will be available for clarifying questions outside the exam rooms. Some students may be taking this exam at a different time, so use discretion in discussing the contents of the exam with anyone until the sample solution has been posted.

The Princeton University Honor Code covers this exam. You will be required to write out in full and sign an honor code pledge that you have abided by these exam rules and restrictions. Any suspected violations must be reported to honor@princeton.edu

Topics

You will be responsible for material from the course through week 5 (but not including Monday/Tuesday of week 6), including the content of required readings, lectures, precepts, and assignments 0, 1, and 2. All questions will assume the ArmLab/Linux/C/gcc217 environment unless otherwise stated.

Major topics include:

1. Number Systems
   • Binary, octal, hexadecimal number systems
   • Unsigned integers: finite representation and operations
   • Signed integers: finite two's complement representation and operations
   • Overflow
2. C Programming
   • The program preparation process: preprocess, compile, assemble, link
   • Program structure: multi-file programs using header files
   • Statements
   • Operators
   • Input/output: getchar(), fgetc(), putchar(), fputc(), gets(), fgets(), puts(), fputs(), scanf(), fscanf(), printf(), fprintf()
   • Data types
   • Basic variable declarations and definitions
   • Process memory layout: text, stack, heap, rodata sections
   • Constants: #define, const variables, enumerations
   • Basic function declarations and definitions
   • Arrays and pointers, call by reference, arrays as parameters, strings
   • Command-line arguments
   • Structures
   • Dynamic memory management: malloc(), calloc(), realloc(), and free()
   • Common memory/pointer errors: dereference of NULL, dereference of dangling pointer, memory leak, double free
3. Programming techniques and tools
   • git and source code management
   • make and build management
   • Testing
   • gdb and debugging
   • Deterministic finite-state automata (DFA)
   • Data structures: linked lists and hash tables

Questions from Previous Semesters

A good way to practice for the exam is to go over questions from previous COS 217 midterm exams. Be aware that both the content of the course and the format of the midterm do change over the years, so not all questions are guaranteed to be 100% relevant, or good practice for this year. If you have any questions about whether the content of a question would be fair game for this year, please ask on Ed.

• Sample questions and answers
• Exclusions - questions on topics we haven't covered
• Topics index for the sample questions

Q&A

There will be a Q&A session Monday evening, 3/6, at 8:00 pm, in Computer Science 104. This session will cover midterm review questions students ask, including going over requested previous midterm problems.

After the exam

There will be no lectures, precepts, or office hours between Thursday 3/9 and Sunday 3/19, inclusive. Enjoy your break!

We will keep up with Ed for questions about Assignment 3, but we will not check it as often as we do during normal weeks.