SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code : 15CS204J Course Title : Algorithm Design and Analysis Semester : IV Course Time : JAN – MAY 2017

Day

E slot/ E1 Hour

E slot/E2

Timing

Hour

Timing

Day 1

-

-

-

Day 2

-

-

-

Day 3

3

9.45- 10.35 a.m

8

2.20-3.10 pm

Day 4

-

-

-

-

Day 5

1,2

6,7

12.30-2.15 pm

8.00-9.40 a.m

Location : TECH PARK and University Building Faculty Details Sec. Group 1 (B1)

Name

Office

Office hour

Mrs.S.Ushasukhanya

TP003

Monday

[email protected]

Ms.A.NthyaKalyani

TP003

- Friday

[email protected]

Mr.M.Thyagarajan

TP712

[email protected]

Ms.R.Lavanya

UB1204

[email protected]

Ms.R.Brindha(102096)

UB1204

[email protected]

Mr.A.SELVAKUMAR

TP706A

[email protected]

TP Ground floor Lab

[email protected]

Mr.A.Saravanan

Group 2 (B2)

Mail id

Mrs.A.JACKULIN MAHARIBA

TP810

Mrs.R.RADHA

UB810

[email protected]

Mrs.T.Y.J.NAGA MALLESWARI

TP003

[email protected]

Mr.N.PRAVEEN

TP710

[email protected]

Mr.M.ELIAZER

TP Ground Floor Lab

[email protected]

TP 803A

[email protected]

Mrs. P.SARANYA

Monday

[email protected]

- Friday

Ms.M.Umadevi

TP 603

[email protected]

Dr.R.ANNIE UTHRA

TP 810

[email protected]

TEXT BOOKS

1. Ellis Horowitz, Sartajsahni, Sanguthevar, Rajesekaran, “Fundamentals of Computer Algorithms”, Galgotia Publication Pvt. Ltd., Reprint, 2010.

2. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein, “Introduction to Algorithms” 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2014 3.

S.Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 2015

REFERENCE BOOKS/OTHER READING MATERIAL

4. Richard Johnson Baugh, Marcus Schaefer,“Algorithms”, Pearson education, 2004 5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education, Inc., 2006

6. Rajesh K Shukla, “Analysis and Design of Algorithms-A Beginner’s Approach”, Wiley publisher ,2015 INSTRUCTIONAL OBJECTIVES 1.

Apply Mathematical concepts and notations to define a problem

2.

Apply divide and conquer method to solve a problem

3.

Ability to solve a real life problems with these algorithmic techniques

4.

Familiarize the concept of multidisciplinary functions

5.

Interpret data using NP problems and applications of various algorithms to solve real life problems

ASSESSMENT DETAILS

Cycle Test I

15 Marks

Surprise test

5 Marks

Quiz

5 Marks

Cycle Test II

25 Marks

TEST SCHEDULE

S.No.

Test

Topics

Duration

1.

Cycle Test I

Unit I and II

2 periods

2.

Surprise Test

From completed units

1 period

3.

Cycle test II

All 5 Units

3 hours

Detailed Lesson Plan Session

Description of Topic

UNIT I: INTRODUCTION TO ALGORITM DESIGN 1. 2. 3.

Introduction, Fundamentals of algorithm(Line count, operation count) Algorithm Design Techniques (Approaches, Design Paradigms) Designing an algorithm and its Analysis(Best ,Worst & Average

Contact C-D- IIOs References hours O 10 1

C

1

2,3,6

1 2

C C,D

1 1,3

1,2,3,6 1,2,3,6

Session

Description of Topic

Contact C-D- IIOs References hours O

case) 4.

1

C,I

1

1,2,3,6

5. Mathematical Analysis - Induction 6. Recurrence Relation - Substitution method 7. Recurrence Relation - Recursion method 8. Recurrence Relation - Master's Theorem UNIT II: DIVIDE AND CONQUER

1 1 2 1 8

C C C C

1 1 1 1

3,4 3,2 2,3 2

9. Introduction, Binary Search 10. Merge sort and its algorithm analysis 11. Quick sort and its algorithm analysis 12. Strassen's Matrix multiplication 13. Finding Maximum and minimum 14. Algorithm for finding closest pair 15. Convex Hull Problem UNIT III: GREEDY AND DYNAMIC PROGRAMMING

1 1 2 1 1 1 1 9

D,I C,D D,I C D,I C,I C

2 2 2 2 2,3 2 2

1,3 1,3 1,3 1,3 1,3 3,5 1,3

1 1 2 1 1 1 2

C C,D,I C,D,I C,D C C,D C,D,I

3 3 3 3 3 3 3

1 1,3 1,3 1,3 1,3 1,3 1

Asymptotic Notations (( ⃝ , Ω, ʘ) based on Orders of Growth

16. 17. 18. 19. 20. 21. 22.

Introduction - Greedy- Huffman Coding Greedy - Knapsack Problem Greedy - Minimum Spanning Tree(Kruskals Algorithm) Introduction - Dynamic Programming - 0/1 Knapsack Problem Dynamic Programming - 0/1 Knapsack Problem Dynamic Programming- Travelling Salesman Problem Dynamic Programming- Multistage Graph- Forward path and backward path UNIT IV: BACK TRACKING

9

23. Introduction - NXN Queen's Problem 24. NXN Queen's Problem 25. Sum Of Subsets 26. Graph Coloring 27. Hamiltonian's Circuit 28. Travelling Salesman Problem 29. Generating Permutation UNIT V: BRANCH BOUND AND RANDOMIZED ALGORITHM

1 1 1 2 1 2 1 9

C D,I D,I D,I C C C

4 4 4 3,4 3,4 3,4 1

1,2 1,2 1,3 1 1 1,3 2,4

30. 31. 32. 33. 34. 35. 36. 37.

1 1 1 1 1 1 1 2

D,I C,I C,I C,I C C C C

4 3,4 3,4 3,4 4 5 5 5 *

1,3 1,3 2 1,2 2 5 5 4,5

Branch and bound - 0/1 Knapsack Branch and Bound - Travelling Sales man Problem Randomized algorithm- Hiring Problem Randomized algorithm- Matrix Chain Multiplication Randomized Quick Sort Introduction to PN problems Introduction to NP problems NP Complete Total Contact Hours

Course Coordinator,

45

Approved By,

Dr.R. Annie Uthra

Dr.B.Amutha HOD/CSE