Data Structures (0368.2158)

1st Semester, 2000/01 -
School of Mathematical Sciences
Tel-Aviv University

Messages to Students: The format of the exam is given in here


Prof. Hanoch Levy (
Dr. Tova Milo (

Teaching Assistants:

Oded Schwartz ( Eran Halperin (

This page will be modified during the course, and will outline the classes

Text books:

Intoduction to Algorithms, by Cormen, Leiserson and Rivest.
Data Structures and Algorithms, by Aho, Hopcroft and Ullman.
The course follows both books. Recommended purchase - first book (to be used by other courses).

Course syllabus:

The course will deal with data strucutres and their use in the design of efficient algorithms.

Subjects: Growth of functions and asymptotic notation; amortized analysis; recurrences: the substitution, master, and iteration methods; elementary strucutres: lists, stacks, queues; trees: ordered trees, binary trees, labeled trees and expression trees; set representation and manipulation; dictionary and hash tables.

Tentative course outline. The actual order of the classes differs from this outline. The actual material may vary as well. For a list of actual material covered so far click here
Copies of slides to be shown at during the semester:
RedBlack Tree
Perfect Hash
Splay Hash

Tirgul, homeworks and project

Details will be given in the Tirgul Home Page.

Last updated February 6, 2000

w3c valid accessibility valid
redesigned by barak soreq