04/30 Lecture Material

Rafal Angryk (CS Faculty Candidate)

• 1 p.m. - Student Meeting in CS Conference Room
• 2:30 p.m. - Teaching Seminar in EPS 108
• 4 p.m. - Research Seminar in EPS 103

Final Review

The final will take place on Thursday, May 6th from 4:00 p.m. - 5:50 p.m. in EPS 103. You may bring three sheets of 8.5 by 11 notes and a calculator with you to the exam. I will hold office hours next week on Wednesday, May 5th from 3:00 p.m. - 5:00 p.m.

Final Coverage

The final will be comprehensive. You can use the following as a rough guideline as to how the various parts of the course will be weighted:

• Material until first midterm: 15%.
• Material from first to second midterm: 25%.
• Material from second midterm to end: 60%.

Key Topics

• Event Handling
• GUI Construction
• Statement Counts and Time Complexity
• Iterators
• Linked Implementations
• Sorting: Insertion, Selection, Quick, Merge, Radix
• Searching: Sequential, Binary, Interpolation
• ADTs: Stack, Queue, Deque, Priority Queue, List
• Underlying implementations for ADTs
• Recursion

Possible Types of Questions

• Given some code, explain what it does.
• Given some code, calculate a statement count or a time complexity.
• Be able to prove a time complexity.
• Given some code, add functionality to it.
• Given some erroneous code, fix it.
• Given some code, be able to suggest improvements to it.
• Be able to write code from scratch.
• Be able to answer questions about stacks, queues, dequeues and priority queues.
• Be able to make and justify recommendations (e.g. choose a searching technique) for a specified problem.
• etc.