Course: Algorithms
Given by: Guy Kortsarz.
Office: 319 Business and Science Bldg.

Office hours: By appointment.

Some information The 24 of this month is a must attend class
Exercise $4$ is due in the 19 of April.
Exercise, exercise 5, is due at 24 of April.
Since there is not much time, you can choose
not to do exercise 5. Thus this exercise will
not be counted in the average of the grades of the homework.
I have put lecture notes about the last subject
in the homepage of the course. Many did not attend class.
But I think you can understand it all from the lecture notes.

In the 24 we meet at 14:00. You fill the feedbacks
Those who want submit exercise 5.
Then we read the Take home exam.
The time to return is Friday 27 between 09:00 to 17:00.
In my office.
You can also bring it earlier and put in in my mail box
at the room of Kelly. Good luck!

OLD Lecture Notes
Slightly outdated lecture notes
The lecture notes contain things that I dont teach
Reading them is not a bad idea. And they are much better than
the best power points I found.

The course will be taught by power points
A few classes are self made.

Subjects covered:
1) Running times, the O(), Omega and Theta notation
2) Bubblesort, Insertion-sort, Selection-sort
3) The running time of recursive algorithms
4) Quicksort
5) Mergesort
6) Finding the median in linear time
7) Exhaustive search. Self made. Sorry for any mistakes.
8) Greedy algorithms. Self Made. Sorry for any mistakes
9) The Knapsack problem. Self Made. Sorry for any mistakes
10)Dynamic programming self made. sorry for any mistakes
11) Graphs and Euler paths. When do they exist?
12) Shortest paths for unweighted graphs
13) Shortest paths for unweighted graphs, example
14) Shortest path for integer non negative weights and DAGS
15) Proof of correctness, for the shortest path algorithm
and analysis of running time

16) Free trees. Properties of trees. The minimum spanning tree problem
17) The algorithms of Prim
18) The algorithm of Kruskal.
19) The theory of DFS separating vertices
and 2 vertex connected components

20) The DFS Algorithm. You should read this first
and then go to lecture 19.

21) The algorithm to find separating vertices
22) The algorithm to find the BCC
Book of the course: Introduction to algorithms by Corman Rivest Leiserson and Stein

1) Exercises: there will be 5 exercises
that are 50 percent of the grade.
2) There will be a
48 hours take home Exam: with 50 percent of the grade.

Previously given exam, an example:
For a pdf file

Theoretical Exercises for Spring 2018.

Exercise I
For a pdf file

Exercise II:
For a pdf file

Exercise III:
For a pdf file

Exercise IV:
For a pdf file

Exercise V
For a pdf file