Sharaf+HussainFall

=Design and Analysis of Algorithms=

Program:
BS(CS)

Semester:
Fall 2012

Instructor:
Sharaf Hussain

**Course Lead:**
Sharaf Hussain

**Credit Hours:**
3 credit hours for theory

Prerequisite(s):
Data Structure and Algorithms

Course Description:
This course is to provide an introduction to the design and analysis of computer algorithms. The students will learn how to analyze the performance of computer algorithms, and programming techniques and data structures used in the writing of effective algorithms.

We will discuss classic algorithm design strategies (e.g., divide-and-conquer, dynamic programming, greedy approaches), data structures (e.g., hash tables, binary search trees), classic problems (e.g., sorting, knapsack problem, scheduling, graph-related problems) and the classic algorithms to solve them. We will also analyze algorithm complexity throughout.

Course Objectives:
To learn and apply techniques for the design and analysis of algorithms.

URLs (Optional):
If you have any additional course website/facebook/twitter/etc.

Books:

 * Textbooks: **
 * 1) Required Textbook: //Introduction to the Design and Analysis of Algorithms//; Anany Levitin. Addison-Wesley.
 * Reference books: **
 * 1) Foundation of Algorithms using C++ Pseudo code, Richard Neapolitan, Kumars Naimpous
 * 2) Optional Textbook: //Introduction to Algorithms, 2nd Edition//; Cormen, Leiserson, Rivest, and Stein; MIT Press, Boston, 2001.

Web Resources:
Any web resources that may be used during the course.

Grading Policy:
The recommended grading policy, with weights attached to Quizzes, Homework assignements, Midterm exams, projects and Final Exams.

Class Time Spent On (In Credit Hours):
Theory: 2.5 Problem Analysis: 0.5 Solution Design: 0.5 Social and Ethical Issues: 0.5


 * ==**Topics Covered in the Course **== ||
 * S.No || Date of the lecture || Topic of Lecture || Additional Reference Material ||
 * 1 || 04/09/2012 || Introduction to course || [[file:CSE202_sharraf_Chap1.pdf]] ||
 * 2 ||  ||   ||   ||
 * 3 ||  ||   ||   ||
 * 4 ||  ||   ||   ||
 * 5 ||  ||   ||   ||
 * 6 ||  ||   ||   ||
 * 7 ||  ||   ||   ||
 * 8 ||  ||   ||   ||
 * 9 ||  ||   ||   ||
 * 10 ||  ||   ||   ||
 * 11 ||  ||   ||   ||
 * 12 ||  ||   ||   ||
 * 13 ||  ||   ||   ||
 * 14 ||  ||   ||   ||
 * 15 ||  ||   ||   ||
 * 16 ||  ||   ||   ||
 * 17 ||  ||   ||   ||
 * 18 ||  ||   ||   ||
 * 19 ||  ||   ||   ||
 * 20 ||  ||   ||   ||
 * 21 ||  ||   ||   ||
 * 22 ||  ||   ||   ||
 * 23 ||  ||   ||   ||
 * 24 ||  ||   ||   ||
 * 25 ||  ||   ||   ||
 * 26 ||  ||   ||   ||
 * 27 ||  ||   ||   ||
 * 28 ||  ||   ||   ||


 * ==**Laboratory Projects/Experiments Covered in the Course (optional) **== ||
 * S.No || Date of the Lab || Topic of the Lab || Additional Reference Material ||
 * 1 ||  ||   ||   ||
 * 2 ||  ||   ||   ||
 * 3 ||  ||   ||   ||
 * 4 ||  ||   ||   ||
 * 5 ||  ||   ||   ||
 * 6 ||  ||   ||   ||
 * 7 ||  ||   ||   ||
 * 8 ||  ||   ||   ||
 * 9 ||  ||   ||   ||
 * 10 ||  ||   ||   ||
 * 11 ||  ||   ||   ||
 * 12 ||  ||   ||   ||
 * 13 ||  ||   ||   ||
 * 14 ||  ||   ||   ||