Data Structures (0368.2158)

1st Semester, 1999/00 -
School of Mathematical Sciences
Tel-Aviv University


Prof. Hanoch Levy (
Dr. Yossi Matias (

Teaching Assistants:

Oded Schwartz (

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

For a list of actual material covered so far click here


The final grade will be composed of the following:
Final Exam: 80%, Homework assignments: 10% (N-1 best assignments), Final project: 10%. Final project is MANDATORY (that is, if you do not hand it in, you FAIL!)

Tirgul, homeworks and project

Details will be given in the Tirgul Home Page.
Last updated October 10 , 1999