Data Structures (89-120)
(2013)
Announcements
(01/08) all groups:
Final grades were uploaded!
Please review your grade; If you see any missing grade and it affects your FINAL grade, please send me an email ASAP. I am intending to submit the grades on Sunday.
I wish you all good luck with all other courses and the entire degree. It was a joy to meet you and teach you all!
(30/06) all groups:
Many students have asked for details regarding Boyer and Moore algorithm. We recomend reading the following paper espicially sections 2-4.
(16/06) all groups:
You can find additional exercies in the courses' sites of last years. Please look here (2010), here (2011) and here (2012).
You can also find previous exams there.
I wish you a lot of good luck in all the exams and the rest of the degree!!
(09/05) Groups 04, 05:
The upcoming recitations on Sunday (12.05) are canceled. Happy Shavuot!
(09/04) Group 05:
Our class is canceled on Sunday due to Yom Hazikaron. Instead, we will meet at this Wednesday (10/04), 14-16, class 507, room 5.
Students that cannot attend can go to any other recitation this week (groups 04, 06, 07). Exercises can be submitted until Sunday as planned.
General Information
Semester B
Lecturer: Prof. Shmuel Tomi Klein
Group 01: Monday, 12:00-14:00, Building:
505, 102
Group 02: Monday, 16:00-18:00, Building:
505, 002
Group 03: Thursday, 12:00-14:00, Building:
507, 001
Teaching Assistant: Gilad Asharov
Group 04: Sunday, 10:00-12:00, Building:
604, 011
Group 05: Sunday, 12:00-14:00, Building:
604, 011
Group 07: Wednesday, 16:00-18:00, Building:
505, 001
Teaching Assitant: Nethanel Gelernter
Group 06: Thursday, 16:00-18:00 Building:
505, 104
General infotmation (please read!!)
Lecture Notes
Recitation 1 (asymptotic notation)
Recitation 2 (recurrence equations)
Recitation 3 (short introduction to probability)
Recitation 4 (linear data structures)
Recitation 5 (skip-list)
Recitation 6+7 (BFS, DFS, topological sort - exercises)
Recitation 6+7 (BFS, DFS, topological sort - slides. Thanks to Nethanel!)
Recitation 8 (trees)
Recitation 9 (trees)
Recitation 10 (sorting)
Recitation 11 (amortized analysis)
Recitation 12 (hashing and perfect hash)
Recitation 13 (I) (II) (Select algorithm + heap)
Exercises
Exercise 1 (sol)
Exercise 2 (sol)
Exercise 3 (sol)
Exercise 4
Exercise 5 (sol)
Exercise 6 (sol)
Exercise 7 (sol)
Exercise 8 (sol)
Exercise 9
Exercises 10 (since we meet in Sunday, 30/06 - you can submit the exercise then, in the class (that is, you get an extension of 4 days). Moreover - in question 6, you should only retrieve the k elements, not to remove them.)
Grades
Final Grades (01/08: updated! final grades!!)
Exams
You can find previous exams here.
