Course 05: Algorithm Design and Analysis (ArsDigita University)
In this course design and analysis of algorithms is studied. Methodologies
include: divide and conquer, dynamic programming, and greedy
strategies. Their applications involve: sorting, ordering and
searching, graph algorithms, geometric algorithms, mathematical
(number theory, algebra and linear algebra) algorithms, and string
matching algorithms.
We study algorithm analysis - worst case, average case, and amortized,
with an emphasis on the close connection between the time complexity
of an algorithm and the underlying data structures. We study
NP-Completeness and methods of coping with intractability. Techniques
such as approximation and probabilistic algorithms are studied for
handling the NP-Complete problems.
Text: Introduction to Algorithms, Cormen, Rivest, Leiserson.
Reference: Computers and Intractability, Garey and Johnson
Requirements: Two exams, six problem sets.
This item is part of the collection: ArsDigita Computer Science University
About this Item
| Creator: | ArsDigita University |
| Date: | 2001 |
| Audio/Visual: | sound, color |
Write a review Reviews
Downloaded
45,447
times
Average Rating:
Reviewer: Dave Malhotra -
-
April 10, 2008
Subject: !
Love the material. The professor does a helluva job explaining a complex topic in a way that can be readily understood.
BTW, the 02-20-01 and 02-27-01 lecture are corrupted. Do good versions of the file exist anywhere?
Reviewer: I'm a shinigami lol -
-
November 5, 2007
Subject: Great Lectures
I'm moroccan, our acadimic language is normaly French, but i swear i found this pretty good explained and well done, even better than any Prof of ours could do.
Thanx a lot for this videos :)
Reviewer: Amir Meysami -
-
August 22, 2007
Subject: Very Good Lecture
Thank You !
Very Good Lecture ...
Reviewer: wackyStudent -
-
August 19, 2007
Subject: This is free
Can't believe this is free! I didn't even have to go to my classes. These lectures covered more than my class. I breeze through my class with a great grade.
Reviewer: silwile -
-
July 12, 2007
Subject: excellent stuff
Really Excellent Stuff!!!
Reviewer: gajeradilip1 -
-
January 31, 2007
Subject: Excellent
Prof. Shai is excellent........really excellent..
THank you very much.
Reviewer: phoenix713 -
-
January 2, 2007
Subject: Excellent Algorithm lectures
Prof. Shai Simonson is the best lecturer I've ever heard in my life. And he makes AAD very easy. Read the text book after listening to this lecture, and you'll understand almost everything.
Good quality lectures, excellent teaching.