22C:30, 22C:115 Review for Exam 2

Exam 2 is scheduled for Friday, October 31st, from 10:30 to 11:20 in Room 321, CB

Given below is a detailed list of topics that you should study for Exam 2. The problems on the exam will involve (i) answering questions about small code fragments that are given and (ii) writing small code fragments to perform a specific task. You will not be asked to write large functions or entire classes.

To prepare for the exam read (i) lecture notes and notes from discussion sections, (ii) code posted on the course webpages (including the node class and linked list toolkit, graph class, solution to Project 1 and Homework 2, etc.) and (iii) the following material from the textbook: Sections 2.5 and 4.1 (on recursion), Section 4.3 (on Queues), Section 4.4 (on Linked Lists), Sections 10.1 and 10.3 (Merge Sort and Quick Sort), Sections 12.2 and 12.3 (graph representation and DFS, BFS). In general, focus on material that relates to what was discussed in class and in the discussion sections.