Design and Analysis of Computer Algorithms

CS 344 – Spring 2006

Sections 01 and 03

 

Class Links:

 

 

Announcements:

 

Final is on Wednesday May 10th, 8-11am- SEC118

Final is comprehensive and covers chapters: 1,2,3,4,6,7,8,9,22,23,24, 15.2, 25.1, 25.2, 34 (pages 966-971) 

 

 

Answers to Midterm II is available at http://paul.rutgers.edu/~lewang/344.html

 

Answers to Midterm I is available at http://paul.rutgers.edu/~lewang/344.html

 

  

 

Class webpage: http://www.cs.rutgers.edu/~elgammal/cs344.html

 

 

Instructor: Dr. Ahmed Elgammal

Email: elgammal (at) cs.rutgers.edu

Email policy: you have to include “CS344” in your subject to get a response.

 

Class TAs: Peter Richter and Lei Wang

 

Peter Richter

richterp (at) paul.rutgers.edu

 

Lei Wang 

lewang (at) paul.rutgers.edu,

http://paul.rutgers.edu/~lewang/344.html

 

 

Lecture times:
Tuesday and Friday 12:00 pm – 1:20 pm at SEC 118
Recitation classes:
Section 01: W  3:35-4:30 PM  SEC-217   by Peter Richter
Section 03: F  3:35-4:30 PM  SEC-211     by Lei Wang

 

Office hours: 

Ahmed Elgammal:       Tuesday           2-4pm              CoRE 316

Peter Ritcher:              Thursdays        1:15-3:15pm   Hill 404

Lei Wang:                    Monday           9-11am            Hill 415

 

    

 

Prerequisite: 01:198:112; and 01:198:206. All prerequisite courses require a grade of C or better.

 

Text Book:   Introduction to Algorithms, Second Edition. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
ISBN 0-262-03293-7

 

0262032937-medium.jpg (7306 bytes)

 

 

 

 

Topics:

 

Methods for expressing and comparing complexity of algorithms: worst and average cases, lower bounds on algorithm classes, verification of correctness. Application of such analysis to variety of specific algorithms: searching, merging, sorting (including quick and heap internal and Fibonacci external sorts); graph problems (including connected components, shortest path, minimum spanning tree. and biconnected components); language problems (including string matching and parsing).
Consideration of a number of hard problems: knapsack, satisfiability, traveling salesman problems.

Development of NP-complete classification and its consequence.

 

 

Homework: about 8-10 homework assignments (one weekly or biweekly) . HWs are due typically on Tuesdays.

Quizzes: about 8-10 short quiz (one weekly or biweekly) to be given in class after submission of each homework. Quizzes will be typically on the Fridays.

Midterms: Two midterms. Will be given on class at lecture time. The first midterm will be on week 6 (on or around 2/21/2006). The second midterm will be about week 11 (on or around 3/30/2006). Each midterm will cover a part of the course topics

Final exam: Comprehensive final exam.

 

Final exam schedule: http://scheduling.rutgers.edu/springfinals.htm

  

 

Grading Policy:

 

Academic Integrity

All students are expected to adhere to the university policy on academic integrity. Copying and Cheating will not be tolerated.

Resources:

 

Announcements:

 

Instruction to access stuff on reserve online:

 

TBA