CS 2213 Advanced Programming Final Exam Review: Spring 2001
This will be a closed book exam.
The exam will cover the material from the text through Chapter 7.
It will also cover the material discussed in class, some of which is not
in the text, as well as the programming assignments.
Review the programming assignments:
- 0: Multiple Precision Arithmetic
- 1: Heapsort of integers
- 2: Word Search
- 3: Hash Table Using Linear Probing
- 4: Hash Table Using Linked Lists
Make sure you also understand the following data structures and their
representations:
- arrays for representing large integers (programming assignment 0)
- heaps (programming assignment 1)
- two-dimensional arrays (programming assignment 2)
- hash tables (programming assignments 3 and 4)
- graphs (Dijkstra's algorithm)
Notes for the class material are available on the web.
The best place to start reviewing for this exam is to go over what you
got wrong on the other exams.
The key to this test is to understand pointers and structures.
Some of the types of problems that may appear on the test are:
- Short answer
- Write a program segment
- Write a function
- Write a main program (possibly with command line parameters)
- Write a filter (You must know what a filter is.)
- Explain what the following code does
- State what output is produced by the following
- Trace a program
- Essay questions (usually 1 or 2 sentences)
Back to CS 2213 Homepage