Information for Exam 2

Computer Science 751: Analysis of Algorithms
Lehman College, City University of New York
Fall 2002

General Information

• The midterm exam is Thursday, 21 November, from 6 to 7:40 in G305.
• It will cover the material in:
  • Chapters:
    I: Foundations: Analyzing algorithms, Designing Algorithms, Summations, Growth of Functions, Recurrences,
    II: Sorting: Heapsort, Quicksort, Sorting in Linear Time, Lower bounds for sorting
    III: Hash Tables, Binary Search Trees
    IV: Dynamic Programming, Greedy Algorithms
    VI: Elementary Graph Algorithms, Minimum Spanning Trees, Single-Source Shortest Paths 
  • Lecture notes,
  • Quizzes 1-8, and
  • Handouts from the webpage

Exam Rules

• The exam is closed book and closed notes.
• When taking the exam, you may have with you:
  • an 8 1/2" x 11" (or A4) piece of paper filled with notes, programs, etc.
  • pens, pencils and erasers.
• You may not use a computer or calculator.
• When you enter the classroom, you will be given an exam. You may write your name on the exam, but do not open it until instructed to do so. This is so everyone has the same amount of time to complete the exam.

How to Prepare

• Do the assigned reading.
• Make sure you do all the problems that have been assigned. The problems (or parts of them) make excellent exam questions.
• Here are some exams I've written for algorithms courses in the past:
  
  • Masters Algorithms course from Winter 1998.  They were several different versions of the exam due to limit cheating.  Each version had 10 questions altogether.  Here are all of the questions in one file for their first exam and their second exam. 
  • Doctoral Algorithms course from Fall 2001.  We covered about three times as much material in that course and in much more depth.  So, that exam has much harder questions over more material than our exam will.