Course: Data structures
Given by: Guy Kortsarz.
Office: 319 Business and Science Bldg.


Office hours: Tuesday 17:00 18:00

Url:
http://crab.rutgers.edu/~guyk/courses.html

Subjects covered:

Basic algorithms
O() and Omega() notations
Running times of algorithms
Stacks queues and lists
trees and binary search trees
Operation on trees. Quicksort
AVL trees. Operations on balanced trees
Introduction to basic probability
Hash functions
Perfect and universal hash functions
Finding the median (time permitting)

Book of the course: Introduction to algorithms by Cormen Rivest and Leiserson

Credit:

1) Three theoretical exercises. 5% each. Total 15%
2) Two programming assignments 10% each. Total 20%
3) Midterm 20%
4) Exam 45%

Algorithms, exercises and handouts:

Some algorithms: For a postscript file and For a pdf file

Supplementary Exercise: For a postscript file and For a pdf file
Theoretical exercises:
Exercise I: For a postscript file and For a pdf file
Exercise II: For a postscript file and For a pdf file
Exercise III: For a postscript file and For a pdf file
Programming assignments :
Exercise I: For a postscript file and For a pdf file

Exercise II: For a postscript file and For a pdf file


The exam For a postscript file and For a pdf file