Computer Sciences Dept.

CS 367: Introduction to Data Structures

Spring 2005
Instructor: Prof. Mary Vernon

Tues. & Thurs. 1:00-2:15pm, 1221 CS


Exams

  • Midterm #1: Thurs., Feb. 24 (exam, handout, answers)
  • Midterm #2: Tues., April 5, 7-9pm (exam, answers)
  • Final Exam: Mon., May 9 10:05a - 12:05p in Noland room 168

Practice for exam 1:
    '03 Exam 1 (pdf) and answers
    '99 Exam 1 (pdf) and answers

Practice for exam 2:
    '03 Exam 2 (pdf) and answers
    '99 Exam 2 (pdf) and answers
    Practice with recurrence relations

Practice for final exam:
    '03 Final Exam (pdf) and answers
    '99 Final Exam (pdf) and answers

Topics for exam 1:

  • List ADT
      (ArrayList, LinkedList, linked data structures, downcasting, iterators)
  • Runtime Efficiency
      (Big-O notation, time complexity of ArrayList & LinkedList methods or for given code)
  • Exceptions
      (how to throw & catch exceptions, define new exceptions, checked exceptions)
  • Stacks & Queues
      (array & linked list implementations, runtime efficiency of operations)

Topics for exam 2:

  • Recursion
      (simulating, writing, runtime analysis)
  • Searching
      (sequential search, binary search, Comparable interface)
  • Trees
      (general trees, binary trees, BSTs, tree traversals)

 
Computer Sciences | UW Home