**Course:** Data structures

**Given by:**
Guy Kortsarz.

**Office: **319 Business and Science Bldg.

**Office hours:**
By appointment.

** SOME RULES**

** 1) The students must respect each other and also
me. I must respect the students.
2) I need to stick to Data Structures.
Many times I am asked on different subjects.
But I cant answer.
3) If a student has a question, the class stops and I answer.
4) I will observe people participating. Asking questions and answering
The course must be a discussion. People who participate a lot
will get a bonus in their grade. Please participate.
If not enough people will arrive I will take names.
5) There will be strict time to submit theoretical
exercises in class. A person that submits late without an iron
solid reason will get a 0. If you do not submit in time even twice
I dont see how you can get better than D.
5) Work alone. If you will cooperate, I will know and your grade
will be cut by 1/2. This is called the Rollo Thomasi legacy.
6) Do not look on the web for answers
7) **

1) Five theoretical exercises. 40 percent in total.

See the exercises below 2) A programming assignments 10 percent.

See it below 3) A forty eight hours take home exam. 50 percent.

The exam is not posted yet. The exam below is just an example and will NOT be the home exam.

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

It will help you to take a look since it elaborates

on the same subjects and other subjects.

This is

This will be taken from the old lecture notes.

Lower bound proof for finding the min plus the max. Lower bound for max and min.

Lecture 5 PDF Application of Lists: Union Find

Lecture 11 Binary trees and traversal. Self made

for serial algorithms.

or Delete-Min

these operations will take if we used a linked list or an array?

general trees by binary trees

Computing properties of trees (like height) by recursion

Corman Rivest and Leiserson, and Stein

Credit: 5 Theoretical exercises 40

percent

A programing exercise 10 percect.

A home exam for 48 hours

50 percent.

An example of a previous exam.