Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No CSE408

Cours Title ALGORITHM ANALYSIS AND DESIGN

Course Planner 14786 :: Shivani Malhotra

Lectures Tutorial Practical Credits 4 0 0 4

Text Book:

1 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, PHI Pvt. Ltd., 2007.

Other Specific Book:

2 A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis Of Computer Algorithms, Pearson Education Asia, 2007. 3 Sara Baase and Allen Van Gelder, Computer Algorithms - Introduction to Design and Analysis, Pearson Education Asia, 2006. 4 Anany Levitin, Introduction to the Design and Analysis of Algorithm, Pearson Education Asia, 2003. 5 Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Galgotia Publishers, 2005.

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 6 http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html (Concepts of Design of Algorithms) 7 http://delab.csd.auth.gr/~manolopo/Design/ch03.ppt (Brute Force String Matching) 8 http://www.cse.unl.edu/~goddard/Courses/CSCE310J/Lectures/Lecture1-Intro.pdf (Transform and conquer) 9 http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Complexity/npComplete.htm (NP Completeness) Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 10 http://www.cs.princeton.edu/~wayne/kleinberg-tardos/ Salient Features Summarized notes

Detailed Plan For Lectures

1 Approved for Spring Session 2011-12

Week Number Lecture Number Lecture Topic

Chapters/Sections of Pedagogical tool Textbook/other Demonstration/case reference study/images/anmatio n ctc. planned

Part 1
Week 1 Lecture 1 Introduction: Notion of Algorithm,Fundamental of Algorithmic Solving Important Problem Types,Fundamentals of the analysis framework. Asympotic Notations and Basic Efficiency Classes. ->Reference :1,Chapter 1 (1.1and1.2) ->Reference :2,Chapter 1(2) ->Reference :3,Chapter 3(3.1) ->Reference :2,Chapter 2(2.5) ->Reference :1,Chapter 4 ->Reference :2,Chapter 2(2.6) ->Reference :1,Chapter4 (4.5) ->Reference :1,Chapter 4(4.3) ->Reference :1,Chapter 4(4.1) http://bit.csc.lsu.edu/~ka rki/DA-05/DA01.pdf http://www.csc.lsu.edu/~ karki/DA/03ProblemTypes.pdf http://www.cs.utsa.edu/~ bylander/cs3343/chapter 2handout.pdf http://www.csc.villanova. edu/~map/8301/lec03.p df http://www.csc.villanova. edu/~map/8301/lec03.p df www.becs.ac.in/cst/Part ha/algo_6hrs.ppt

Lecture 2

Lecture 3

Lecture 4

Mathematical Analysis of Non-recursive Algorithm

Week 2

Lecture 5

Mathematical Analysis of Recursive Algorithm

Lecture 6 Lecture 7 Lecture 8 Week 3 Lecture 9

Fibonacci Series Solving recurrences using master method Substitution and iteration method

Sorting and order statistics: ->Reference Heap sort: Heaps and Maintaining the heap property :1,Chapter 6(6.1 and 6.2) Building a heap and heapsort algorithm ->Reference :1,Chapter 6(6.3 and 6.4) ->Reference :1,Chapter 6(6.5) ->Reference :1,Chapter 7(7.1 and 7.2) http://www.personal.kent .edu/~rmuhamma/Algori thms/MyAlgorithms/Sorti ng/quickSort.htmdevices

Lecture 10

Lecture 11 Lecture 12

Priority Queues

(Term paper allocation)

Quick sort: Description of quick sort and Performance of quick sort

Approved for Spring Session 2011-12

Week 4

Lecture 13

Quick sort: A randomized version of quick sort and Analysis of quick sort

->Reference :1,Chapter 7(7.3and 7.4)

http://www.personal.kent .edu/~rmuhamma/Algori thms/MyAlgorithms/Sorti ng/quickSort.htmdevices

Part 2
Week 4 Lecture 14 Sorting in Linear Time: Lower bounds for sorting, Counting sort Sorting in Linear Time: Radix sort Sorting in Linear Time: Bucket sort ->Reference :1,Chapter 8(8.1and 8.2) ->Reference :1,Chapter 8(8.3) ->Reference :1,Chapter 8(8.4) http://www.personal.kent .edu/~rmuhamma/Algori thms/MyAlgorithms/Sorti ng/bucketSort.htm

Lecture 15 Lecture 16

Week 5

Lecture 17 Lecture 18 Lecture 19 Lecture 20

Data Structures: Elementary data structures: Stacks ->Reference and queues :1,Chapter 10(10.1) Elementary data structures: Linked Lists Elementary data structures: Implementing pointers and objects Elementary data structures: Representing rooted trees ->Reference :1,Chapter 10(10.2) ->Reference :1,Chapter 10(10.3) ->Reference :1,Chapter 10(10.4)

Week 6

Lecture 21

Data structures: Hash tables: Direct address tables, ->Reference Hash tables, Hash functions :1,Chapter 11(11.1 11.2 and 11.3) Binary search trees: Binary search trees and querying a binary search tree, Binary search trees: Insertion Class Test Binary search trees: Deletion Red black trees: Properties of red black trees and Rotations Red black trees: Insertion and deletion ->Reference :1,Chapter 13(13.1 and 13.2) ->Reference :1,Chapter 13(13.3 and 13.4) ->Reference :1,Chapter 15(15.1) http://www.cse.iitb.ac.in/ ~sharat/previous/course s/algo/cmsc451/451.htm l Approved for Spring Session 2011-12 ->Reference http://www.personal.kent :1,Chapter 12(12.1 and .edu/~rmuhamma/Algori 12.2) thms/MyAlgorithms/bina rySearchTree.htm

Lecture 22

Lecture 23 Lecture 24

Week 7

Lecture 25

Lecture 26

Dynamic Programming: Assembly line scheduling,

Week 7

Lecture 27

Dynamic Programming: Matrix chain multiplication

->Reference :1,Chapter 15(15.2)

http://www.cse.iitb.ac.in/ ~sharat/previous/course s/algo/cmsc451/451.htm l http://www.cse.iitb.ac.in/ ~sharat/previous/course s/algo/cmsc451/451.htm l

Lecture 28

Elements of dynamic programming

->Reference :1,Chapter 15(15.3)

MID-TERM Part 3
Week 8 Lecture 29 Lecture 30 Lecture 31 Lecture 32 Advanced design and analysis techniques: Greedy Algorithms: An activity selection problem ->Reference :1,Chapter 16 (16.1) Greedy techniques: Elements of the greedy strategy ->Reference :1,Chapter 16 (16.2) Greedy techniques: Huffman codes Greedy techniques: Theoretical function for greedy methods, A task scheduling problem Brute force string matching Amortized analysis : Aggregate analysis , The accounting method ->Reference :1,Chapter 16 (16.3) ->Reference :1,Chapter 16 (16.4 and 16.5) ->Reference :7,>Reference 7 ->Reference :1,Chapter 17(17.1 17.2) http://www.cs.purdue.ed u/homes/gopal/cs5802004/7.pdf

Week 9

Lecture 33 Lecture 34

Lecture 35

Amortized analysis: The potential method, Dynamic ->Reference tables :1,Chapter 17(17.3 17.4) Advanced data structures: Binomial heaps ->Reference :1,Chapter19(19.1 and 19.2) ->Reference :1,Chapter 20 (20.1 and 20.2) ->Reference :1,Chapter 23 (23.1) ->Reference :1,Chapter 20(20.3)

Lecture 36

Week 10

Lecture 37

Advanced data structures: Fibonacci heaps: Structure of fibonacci heaps, mergeable heap operation Class test Fibonacci heaps: Decreasing a key and deleting a node Graph Algorithm: Minimum spanning trees : Growing a minimum spanning tree

Lecture 38 Lecture 39

Approved for Spring Session 2011-12

Part 4
Week 10 Week 11 Lecture 40 Lecture 41 Minimum spanning trees: The algorithms of Kruskal ->Reference and Prim :1,Chapter 23 (23.2) Single source shortest paths (Term paper submission) Lecture 42 Lecture 43 Single source shortest paths: The bellman ford algorithm ->Reference :1,Chapter 24(24.1) ->Reference :1,Chapter 24

Single source shortest paths: Single source shortest ->Reference http://ww0.java4.datastr paths in directed acyclic grpahs and Dijkstra's :1,Chapter 24(24.2 and uctures.net/handouts/Sh algorithm 24.3) ortestPath.pdf All pair shortest paths: Shortest paths and matrix multiplication All pair shortest paths: The Floyd Warshall algorithms ->Reference :1,Chapter 25(25.1) ->Reference :1,Chapter 25(25.2)

Lecture 44 Week 12 Lecture 45 Lecture 46

Maximum flow: Flow networks , The Ford Fulkerson ->Reference method :1,Chapter 26(26.1 and 26.2) String matching techniques: Brute force String matching techniques: Robin Karp algorithm ->Reference :7,>Reference 7 ->Reference :1,Chapter 32(32.2)

Lecture 47 Lecture 48 Week 13 Lecture 49 Lecture 50

String matching techniques: The Knuth-Morris-Pratt ->Reference algorithm :1,Chapter 32(32.4) Problem classes P ->Reference http://www.personal.kent :2,Chapter 10(10.1 and .edu/~rmuhamma/Algori 10.2) thms/algorithm.html ->Reference :1,Chpater 34(34.5) http://www.personal.kent .edu/~rmuhamma/Algori thms/algorithm.html http://www.springerlink.c om/content/0nkk050472 236601/

Lecture 51

NP, NP-hard and NP-complete

Lecture 52

Deterministic and non deterministic polynomial time ->Reference :9,algorithms >Reference 9

Spill Over
Week 14 Lecture 53 Approximation algorithms for some NP-complete problems. ->Reference :1,Chpater 35 ->Reference :10 http://www.personal.kent .edu/~rmuhamma/Algori thms/MyAlgorithms/Apro xAlgor/AproxIntro.htm Approved for Spring Session 2011-12

Week 14

Lecture 54

Approximation algorithms for some NP-complete problems. Approximation algorithms for some NP-complete problems.

->Reference :1,Chapter 35 ->Reference :10 ->Reference :1,Chapter 35 ->Reference :10

http://www.pnas.org/con tent/94/24/12734.full.pdf http://www.pnas.org/con tent/94/24/12734.full.pdf

Lecture 55

Details of homework and case studies

Homework No. Objective Topic of the Homework Nature of homework (group/individuals/field work Evaluation Mode Allottment / submission Week 3 / 11

Term Paper 1

To understand the Allot one Term paper to each student on important topics from the Individual real life application complete syllabus. Refer List of suggested topics for term paper. of design and analysis

Check the relavance of the topic with its applications. Also check the logic, proper figures and representations step by step evaluation of attempted questions step by step evaluation

Test 1

Fundamentals of algorithm

Fundamentals of algorithm, Mathematical analysis of algorithm, sorting and order staticstics , data structures

Individual

5/6

Test 2

Advanced data structures

Advanced design and analysis techniques, string matching techniques

Individual

9 / 10

Scheme for CA:out of 100*

Component Term Paper,Test Frequency 2 Total :Out Of 3 Each Marks Total Marks 10 10 20 20

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the UMS List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)

Approved for Spring Session 2011-12

Sr. No. Topic 1 1. Fundamentals of analysis framework 2. sorting and order statics 3. graph algorithm 4. binomial heap 5. fibonacci 6. spanning trees 7. substitution and iteration method 8. robin karp 9. bellman ford 10. quick sort 11. heap functions 12. problem classes 13. np-hard 14. np-complete 15. advanced data structures

Approved for Spring Session 2011-12