Institute / School Name Program Name Course Code Course Name Lecture / Tutorial (per week) Course Coordinator

Name

Chitkara University /CSOET MCA II CS2027 Design and Analysis of Algorithm 4/1 Course Credits Amit kumar arora

1. Scope and Objectives of the Course This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following: 1. Analyze the asymptotic performance of algorithms. 2. Demonstrate a familiarity with major algorithms and data structures. 3. Apply important algorithmic design paradigms and methods of analysis. 4. Synthesize efficient algorithms in common engineering design situations 2. Textbook TB1: Introduction to Algorithms by Thomas H.Cormen,Charles E.Leiserson,Ronald L.Rivest,Clifford Stein third edition MIT Press and McGraw-Hill. ISBN0-262-03141-8. 3. Reference Book RB1: Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V.Vazirani Online Edition Available at (http://www.cs.berkeley.edu/~vazirani/algorithms.html) RB2: Algorithms. By Sedgewick, Robert 2nd ed. Reading, MA: Addison-Wesley, 1988. ISBN: 0201066734 RB3: Fundamentals of Computer Algorithms Ellis Horowitz, Sataj Sahni, 1st Edition, Galgotia Publications

4. Other readings and relevant websites S.No. 1. 2. 3. 4. 5. 6. 7. Link of Journals, Magazines, websites and Research Papers http://www.algorito.com/ http://www.cs.sunysb.edu/~skiena/214/lectures/ Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974. ISBN: 0201000296. Baase, Sara. Computer Algorithms: Introduction to Design and Analysis. 2nd ed. Reading, MA: Addison-Wesley, 1988. ISBN: 0201060353. Knuth, Donald E. The Art of Computer Programming. 3rd ed. 3 vols. Reading, MA: AddisonWesley, 1997. ISBN: 0201896834. ISBN: 0201896842. ISBN: 0201896850. Manber, Udi. Introduction to Algorithms: A Creative Approach. Reading, MA: Addison-Wesley, 1989. ISBN: 0201120372. http://comjnl.oxfordjournals.org/content

Page 1 of 3

5.

Course Plan Text Book / Reference Book / Other reading material TB1 Page numbers of Text Book(s) NA

Lecture Topics Number

2-3 4-5

Course Discussion: y Course Code, Course Structure, Course Team, Credits, and Overview of Course to be shared with students. y Why learn algorithms? The role of Algorithm in computing y Insertion sort y Merge sort Growth of Function y Asymptotic notation Divide and conquer y The maximum sub array problem y Strassens algorithm for matrix multiplication y Substitution method for solving recurrences y Master method for solving recurrences

TB1 TB1

5-11 16-23 23-29 43-53

6-8

TB1

9-13

TB1

65-68 68-75 75-83 83-97

14-18 19-22 23-25

Heap sort Quick sort Sorting in linear time y Counting sort y Radix sort Binary search tree Dynamic Programming y Matrix chain multiplication y Longest common subsequence y Optimal binary search tree

TB1 TB1 TB1

151-162 170-180 191-200

26-29 30-34

TB1 TB1

286-299 359-397

35-39

Greedy algorithm: y Activity selection Problem y Huffman codes

TB1

414-443

40-45

Balanced Trees: y AVl tree y B tree Shortest path and spanning tree algorithms: y Warshalls algorithm y Dijkstras algorithm

TB1

484-499

46-48

TB1 TB1

589-615

Page 2 of 3

6. Evaluation Scheme: Component 1 Quizzes /Assignments/ Presentation/Class Test/ Open Book Test/ Case Study Component 2* Component 3** Sessional Tests (STs)* End Term Examination** Total

20 20 60 100

* There are three Sessional Tests (STs) for all theory papers, the first two are compulsory and the third one is the non-mandatory make up / mercy test. The average of best two is considered. ** The End Term Comprehensive examination will be held at the end of semester. The mandatory requirement of 75% attendance in all theory classes is to be met for being eligible to appear in this component.

7. Details of Evaluation Component 1 Description Duration Marks Tutorial Test 1 20 min Quiz(MCQ) 20 min Tutorial Test 2 20 min

To be held in week 4th -5th Week 9h -10th Week 13th Week

Remarks

This Document is approved by: Designation Course Coordinator PI/CoD/HoD Dean Name Mr. Amit Kumar Arora Mr. Sushil Bansal Dr. Rajnish Sharma Signature

Page 3 of 3