FINAL EXAM INFO

FINAL DATE

The exam is on Wednesday December 10. The morning exam is 9:50 AM - 12:30 PM; the evening exam is 3:30 PM - 6:10 PM. Both are in PC-441. The exam will not be returned. Grades will be emailed late Wednesday night or Thursday moring.

Past Exams (No answers; don't ask)

  • Summer 1996, only 75 minutes.
  • Fall 1994
  • Fall 1993

    TOPICS

    1. Chapter 5 -- Running Time
    2. Chapter 8 -- Sorting (insertions sort, shellsort, mergesort, quicksort)
    3. Chapter 14 -- Unweighted and weighted shortest paths (Section 14.2 and 14.3)
    4. Chapter 15 -- Stacks and Queues
    5. Chapter 16 -- Lists and Iterators
    6. Chapter 17 -- Recursive Tree Algorithms
    7. Chapter 18 -- Binary Search Trees, AVL Trees, B-Trees.
    8. Chapter 19 -- Hash Tables
    9. Chapter 20 -- Binary Heaps
    10. Chapter 23 -- Union/Find Data Structures (but not the analysis)

    Applet demos of AVL Trees, hash tables, and heaps from Summer 1996

    SOME MULTIPLE CHOICE QUESTIONS

    Click here. This file is in postscript, but can be read and printed in the AUL or at home if you download a postscript previewer, such as ghostview. Please do not ask me how to do this; you are on your own.

    These questions are in Ada, but are mostly language independent. There are answers. The questions are organized to correspond to a different book, but Chapters 2, 3, 4, 5, 6, 7, 8, and a little of 9 are what you want.