Contents (hide)
 1 Introduction
 2 Grade
 3 Assignments
 4 Quiz
 5 If you have a question or request…

Introduction

This course is all about algorithms and this site is all about helping you to succeed in this course. It will be our main information channel so be sure to come back often (you can see the last updated pages by using the recent changes link on the left side tab.

The course syllabus and rules are all combined on the main page. Pay special attention to the academic integrity section.

The class schedule and staff information is found on the course info page. The practical sessions are based on the lecture. You should be in at least one lecture before the practical session (every week).

Keep in mind that some of the lectures and TA's are teaching only half of the course. Amos Beimel, Sivan Albagli, Alex Kantor and Yelena Yuditsky will be teaching in the first half. They will be replaced by Avraham Melkman and Shahar Golan in the second part of the course.

Finally, make yourself a habit to check the announcements page for important messages.

Grade

As you probably noticed the grade is combined of three factors (see the grade section for the percentage). You will have a midterm and 6 homework assignments. See the important dates page for the deadlines.

Assignments

You will have 6 homework assignments throughout this semester. You must submit in pairs for three reasons:

  1. It is easier.
  2. Nothing compares to midnight debates about a spanning tree.
  3. We don't have many graders.

Each assignment will be partially graded. That is, we will arbitrarily choose some questions for checking.

  • Questions we do not check will receive full grade if there was some effort to solve it.
    Providing a nice recipe for a cheese cake does not count for an effort.
  • Questions we do check, will be graded with full strictness - be afraid!

Naturally, you will not know which questions are checked, otherwise it wouldn't be fun… The assignments page will provide you with submission details and everything else relevant on the matter.

The final assignment grade will be made off 5 out of 6 best assignments. The drawback is that we are going to be much stricter with delay requests. We published the deadline for all assignment and you should plan your schedule carefully.

Any requests such as " Hi, I have a midterm / exam / big assignment in different course / need more time for the assignment" will automatically rejects.

You are welcome to discuss the assignments, but you are not allow to publish your solution in the net. Cheating will not be tolerate.

Quiz

Some short quizzes will be published in this site, each covering some of the topics learned in class.

These are not obligatory, but very recommended! :)

Read more on the page itself!

If you have a question or request…

Usually students have questions. We will try to provide you with as much information as possible through this site, but sometimes if will not be enough. Before asking us try to search for an answer on the site and read the FAQ page. You can also use the search box at the upper right.

We will make an effort to provide each assignment with a forum for your questions. In addition you can contact the relevant staff member by e-mail (see course info for details).

Administrative questions/requests (sickness, delays, anything else…) MUST be sent to algo092@cs.bgu.ac.il.