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


Office hours: By appointment.
Url:
http://crab.rutgers.edu/~guyk/courses.html

Some Rules
We all need to respect one another

ANY QUESTION WILL BE ANSWERED IN FULL
EVEN IF THE TEACHING HAS TO BE STOPPED.
NOBODY (INCLUDING ME) IS ALLOWED TO SAY A QUESTION IS STUPID.
THE NOTES DO NOT CONTAIN ALL THE
MATERIAL YOU NEED TO KNOW.
IN CLASS HINTS WILL BE GIVEN
FOR SOLVING THE EXERCISES.
WITHOUT THE HINTS THE EXERCISES WILL BE
HARDER.
I SUGGEST YOU ATTEND ALL CLASSES.

DO NOT * EVER * WRITE A PROGRAM AS AN ANSWER!

OLD Lecture Notes
Slightly oudated
The course will be taught by the best power points
I found
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) Exahustive search. Self made. Sorry for any mistakes.
8) Greedy algorithms. Self Made. Sorry for any mistakes
9)Dynamic programming self made. Sory for any mistakes
10) Graphs and Euler paths. When do they exist?
11) Shortest paths for unnweighted graphs
11) Shortest paths for unnweighted graphs, example
12) Shortest path for integer non negative weights and DAGS
13) Free trees. The minimum spanning tree problem
14) The algorithms of Prim
14) The algorithm of Kruskal.
15) The DFS Algorithm
16) The algorithm to find separating vertoes
17) The algorithm to find the BCC
Book of the course: Introduction to algorithms by Cormen Rivest Leiserson and Stein

Credit:
1) Exercises: there will be 5 exercises
that are 50 percent of the grade.
The exercises are not updated yet.
Do not start solving exrecises
untill I tell you. Thye may not be updated.
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