Fall 2005, Section 010-012, Exam 02 Study Guide
What is covered
- Lecture Notes, 8/31 through 11/07, emphasis on 10/10 through 11/07
- Labs 0-5, Project 1
- Savitch, Chapters 1-5 and Sections 6.1 (structs; special emphasis on this) 13.1, 13.2 (recursion), 13.3 (binary search)
- Andersen, Chapters 6, 7, 8
- Linked List Handout (special emphasis on this)
- Reading Notes for Sections 13.1, 13.2 (available from link on Calendar page)
Partial List of topics to emphasize (not necessarily complete)
All topics on list from E01_studyGuide.html (especially those not covered on E01 itself!)
strtok(), strncpy()
structs
Linked lists:
- given the code, draw the picture
- given the picture, write the code
Type expressions
- given the code, identify the type
- also be able to identify errors (e.g. dereferencing something that isn't a pointer, using "dot" (.) on something that isn't a struct)
Array initializers
"const" used with pointers
stack vs. heap
dynamic allocation of arrays