CS503: Data Structures and Algorithms

Staff

• Instructor: K. R. Kaplan (kaplan@cs)
  Office: Hill 490
  Office hours: T,TH,F 11:30-12:30

• TA: TBA

Course Information

Newsgroup

• Newsgroup for reading/posting (try it!)

Lectures

• Highlights #1: gcd, Fibonacci numbers, x**n (*.ps)
• Highlights #2: Stacks
• Highlights #3: Queues
• Highlights #4: binary search, binary search trees
• Highlights #5: nonrecursive traversals
• Highlights #6: threaded binary search trees
• Highlights #7: binary trees and forests of general trees
• Highlights #8: height-balanced binary trees
• Highlights #9: binary heaps; priority queues
• Highlights #10: binomial queues and heaps
• Highlights #11: graphs; representations
• Highlights #12: graph algorithms
• Highlights #13: sorting
• Highlights #14: mergesort; radixsort
• Highlights #15: hashing

  Exams

  • Fall '96 Final Exam (*.ps)
  • Spring '97 Midterm Exam (*.ps)
  • Spring '97 Midterm Solutions (*.ps)
  • Spring '97 Final Exam (*.ps)
  • Fall '97 Midterm Exam
  • Fall '97 Midterm Solutions
  • Protocol for Reviewing Exam Scores
  • Solutions to Fall '97 final

  Written Homework

  Sometimes problem solutions will be posted here (with links).

  Programming Projects

  • Binary Search Trees, Queues, Doubly Linked Lists
    
  • Building Header and Object Files
    
  • Test Data for P1
    
  • Electronic Handin Instructions
    
    
  • Second Assignment Shortest Path Trees and Heaps
    
  • heap.h and heap.o located in /grad/u1/kaplan/503/ on paul. Let me know if there are any problems with access.
  • More details about the SPT assignment. Due date November 30, midnight.
  • Repaired bug in heap.o ; Extended deadlineWednesday, Dec 3 at midnight. Handin to cs503-kaplan.proj2a.
  • SEE NEWSGROUP FOR LATE NEWS; DEADLINE EXTENSION