Computer Science 477/677
Design and Analysis of Algorithms

CSC 477/677 Study Guide for the Second Midterm Examination Spring 2008

  1. A few questions will be from material covered before the first exam.
  2. Review the homework assignments.
  3. There will be some true/false and fill-in-the-blank questions.
  4. I have posted exams from prior semesters. If a question that you see on one of those exams is not related to anything we've covered in class so far this semester up to the last class day before the exam, then don't worry: it will not be on our April 1 exam.
  5. Understand what the array ADT is.
  6. Be able to find the base address of an array object in the machine's memory.
  7. You should know about various data structures used to implement graphs, ordered graphs, weighted graphs, or weighted ordered graphs, such as matrix, neighborlist (also called adjacency list), or other.
  8. You should know the meanings of various words and phrases, including, but not limited to:
  9. Specific algorithms you should know: