Contents (hide)
   1 This is a united course page for CS,
ISE and Ahva students
  1 The Goal
  2 Contact
  3 Prerequisites
  4 Textbooks
  5 Course Requirements
   5.1 Midterm Exams
   5.2 Homework Assignments
   5.3 Final Exam
  6 How to Login into a Course Page if You
Are Information System Student

Welcome to Data Structures homepage

This is a united course page for CS, ISE and Ahva students

The Goal

The goals of this course is 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. To learn to create new data structures that fit special characteristics of the machine (computer architecture) and the problem to be solved.

Contact

Please, send your emails with problems/requests to a course email (ds072@cs.bgu.ac.il) or to a relevant lecturer or a teaching assistant. The email sent to the course email will be forwarded to a person who is able to take care of your problem. In your emails please state your full name, ID number and the department you belong to (CS, ISE or Ahva).

Office hours
  • Shlomi Dolev (lecturer in charge of the course, lecturer - CS)
  • Dekel Tsur (lecturer- CS)
  • Matya Katz (lecturer- CS)
  • Eitan Bachmat (lecturer- ISE)
  • Shay Solomon (TA-CS)
  • Shira Zucker (TA-ISE)
  • Hadassa Daltrophe (TA-CS)
  • Olga Brukman (TA-CS)
  • Amit Benbassat (TA-CS)

Prerequisites

  • Introduction to Computer Science (201-1-1011)
  • Introduction to Logic and Set Theory (201-1-0201)
  • Discrete Mathematics (201-1-2201) - in parallel

Textbooks

We encourage you to try several textbooks and see which fits you best. Here are a few suggestions:
  • Introduction to Algorithms, Cormen, Leiserson and Rivest. This is the main textbook. There is also a Hebrew edition, which can be found in Dyonon.
  • 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, which will be held on Wednesday, 18/4/2007. 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 either by singles or 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: moed A - 15/7/07, moed B - 5/8/07.

How to Login into a Course Page if You Are Information System Student

IS login