The Data Structures HomePage
New : Project grades
Welcome to the humble page of Data
Structures course. Here you may find :
excercise grades, excercise sheets, important messages,
general info, Data structures
related links have been added. Check them
out.
In order to view your grades or
the exercise sheets, click one of these magic links :
For viewing the sheets on a Windows
system, you may download this PostScript
Viewer.
Important
messages
- Checking of project appeals is now complete. The
grades
are now final. For any further requests and questions regarding the
project, you may speak to the checkers on the phone. The checkers' names
are Eli Leher and Idan Perry, and their phone numbers are listed in the
"ozrey hora'a" list which is posted on Schreiber's first floor.
- The last date for submitting appeals, requests for recheck,
and anything else you want to affect your project grade, is 13/5/97
at 12:00 (not 24:00). Submission should be by email, to dscheck.
Before you mail dscheck it is important that you click here
to read important explanations about project rechecking and appeals.
If you already emailed dsheck, and you want to change what you wrote after
you've read the explanations, mail again and ask that your previous email
be disregarded.
- Project grades can be viewed
here.
Grades appear as :
representative login - "grade" - automatic runtime check grade
+ documentaion and code grade.
For each group only a representative login is shown. Mail
dscheck with any problem you might have concerning the checking of
the project, including requests for a recheck (due to file mode changes
and so forth) and appeals. Specify the representative login for your project,
which is shown in the grade
file near your score.
- Students of Guy, who have problems with their
exercise grades, should turn to Eli
Leher, the exercise checker. This can be done either by email,
or by calling 03-6766420, and asking for Eli.
- Before sending questions about the project to dscheck@math.tau.ac.il
, check the new faq
file to see if it already has the answers. This file will also
contain procedural information about the project, such as changes in the
submission deadline, etc. Note that when contradiction occurs between the
faq and the project's papers, you should follow the projec's papers
- Any questions regarding the project should be mailed
to dscheck@math.tau.ac.il.
This includes requests for postponent of submission date, questions about
the project sepcifications and grading, and any other stuff you think of.
Don't forget to specify the tirgul group you belong to.

General information
- All course students are assumed
to be informed of the important messages that appear
in this page, so if you are taking this course, visit here regularly.
- Appeals, exercises, and any other material that should
be submitted, can be handed over directly during classes, or be put in
the mailboxes of the metargelim. Remember to specify name, id, and the
class to which you are registered.
- Exercise papers should be stapled and clearly written.
Solutions must be proved - a solution wihtout a proof will not be considered.
- When required to give an algorithm, give a concice description
of what should be done. A pseudo code is not required unless specifically
requested in the exercise.
- Appeals about exercise grades may
be submitted no later than 10 days after the grades have been published
here.
- If you have a question, remark,
or anything else to say about this page, the course, or the exercises,
please mail Guy Kindler or Eran
Perry.
&n
bsp; 
DS related
links
SortingAlgorithm
Animation
RedBlack,B-Trees
Sorting
Algorithms
More
Sorting Algorithms
And
even more sorting algorithms (recommended)
Heap
animation (nice)
The
Red-Black Tree Song
Red-Black
Tree Animation (Most recommended)
Splay
tree animation (recommended though not studied
in current course)
Red
Black Tree Animation
And
yet another Red Black Tree animation
If you do not find any of that interesting,
you may go back home, or you may observe
this :

&n
bsp; 