Contents (hide)
  1 The Goal
  2 Staff
  3 Textbooks
  4 Course Requirements
   4.1 Midterm Exams
   4.2 Homework Assignments
   4.3 Final Exam

Welcome to Data Structure for IAF homepage

The Goal

The goals of this course are to learn a variety of useful data structures and to use them properly when designing efficient algorithms. During this process we will define (asymptotic) time and space efficiency. We will learn how to create new data structures that fit special characteristics of the machine (computer architecture) and the problem to be solved.

Staff

See Course info

Textbooks

We encourage you to try several textbooks and see which fits you best. Here are few suggestions:
  • Introduction to Algorithms, Cormen, Leiserson and Rivest. This is the main textbook. There is also a Hebrew edition.
  • Algorithm design : foundations, analysis, and Internet examples, Michael T. Goodrich, Roberto Tamassia.
  • Data structures and algorithms in Java, Michael T. Goodrich, Roberto Tamassia.
  • Data structures and algorithms, Alfred V. Aho, John E. Hopcroft. Jeffrey D. Ullman.
  • Data structures & their algorithms, Harry R. Lewis, Larry Denenberg.
  • Algorithms in C++, Robert Sedgewick.

Course Requirements

Midterm Exams

There will be 1 obligatory midterm exam on the 21/12/08. The weight of the midterm exam is 30%.

Homework Assignments

  • There will be two programming assignments and four theoretical assignments.
  • Each student is required to submit at least three theoretical assignments and all of the programming assignments.
  • For the theoretical assignments, we will grade the best 3 out of 4.
  • The weight of each theoretical assignment is 2% and each practical assignment is 4%.
  • Homework can be submitted only by pairs.

Final Exam

In order to pass the course, you must pass the final exam (with grade of at least 56). The weight of the final exam is 56%. The dates for final exam will be published later.