Syllabus

CSc 4520/6520 $\mbox{Sushil K. Prasad}$
Fall, 2014

Course Syllabus

Course Title:

Design and Analysis of Algorithms

Text:

Cormen, Leiserson, and Rivest, Introduction to Algorithms, MIT Press.

Prerequisite:

 CSc 3410 - Data Structures and Higer Level Discrete Math

Class Time and Place:

2:50-4:35 TT; Classroom South 408

Instructor:

Sushil K. Prasad; Room 717, 25 Park Place Email sprasad@gsu.edu (do not leave phone messages).

Office Hours:

TT 9:00-9:50 a.m. Meetings at other hours by appointment only. Office hours may be cancelled occasionally due to meetings.

Content:

The purpose is to learn to be able to design various classes of algorithms, and analyze them.

Design Techniques: Divide-and-Conquer, Greedy, Dynamic Programming, Parallel.

Topics: Analyzing algorithms and problems; Growth rates; Searching; Sorting; Selection; Lower Bounds; Graph Algorithms: minimum spanning tree and shortest path; Introduction to NP-complete Problems; Coloring, Clique, Satisfiability; Cook's Theorem, Approximation Algorithms. Some material will be covered by reading assignments.

Attendance:

You may be dropped if you have more than two unauthorized absence. Students are responsible for all the material covered or assigned (whether or not in the text). No classes Sept 1 (Labor day) and Nov 24 – 29 (Thanksgiving break). Last class is on Dec 4.

Withdrawals:

The last date to withdraw is Oct 14.

Grading:

$\mbox{}$

	CSC 4520	CSC 6520	Dates
Attendance and Class Participation	5%	5%
Home Assignments and Quizzes	40%	30%
Test 1	15%	15%	Sep 23
Test 2	20%	20%	Oct 23 (or Take Home)
Test 3	20%	20%	Dec 4
Term Project	5% (optional)	10%	Due Dec 2

Final grades will be relative to the class performance (to be calculated separately for CSc 4520 and CSc 6520). To ensure a grade, however, 90 and above will result in an `A,' 80-89 a `B,' 70-79 a `C' and 65-69 a `D.' Relative grading may yield a better grade even with a lower score. There will be no makeup test given except for documented medical emergencies. All assignments and projects must be completed to pass the course. Assignments are due before the class; late submissions do not earn any points.

Academic Honesty:

Work submitted for grading must be student's own. Collaboration for work assigned to be carried out individually is not allowed; D2L employs sophisticated checks against Web resources. In case of any plagiarism in my professional opinion, all involved will receive `F' for the course, and will risk further action. Refer to the university catalogs for policy on plagiarism.

Disclaimer:

The course syllabus provides a general plan for the course; deviations may be necessary.

A teacher can never truly teach unless he is still learning himself. A lamp can never light another lamp unless it continues to burn its own flame. The teacher who has come to the end of his subject, who has no living traffic with his knowledge but merely repeats his lesson to his students, can only load their minds, he cannot quicken them.

Rabindranath Tagore, Indian Poet

Nobel Laureate in Literature, 1913