cse 408

Lovely Professional University, Punjab Course Code

Course Title

CSE408

Course Planner

DESIGN AND ANALYSIS OF ALGORITHMS

Course Category

Lectures

15691::Surmeet Kaur

Tutorials Practicals Credits

3.0

Courses with Placement focus

TextBooks Sr No

Title

Author

T-1

Introduction to Algorithms

Edition

Year

Publisher Name

C.E. Leiserson, R.L. Rivest 3rd and C. Stein

2007

Thomas Telford Publishing

Reference Books Sr No

Title

Author

Edition

Year

Publisher Name

R-1

The Design and Analysis Of Computer Algorithms

A.V.Aho, J.E. Hopcroft and J.D.Ullman

2nd

2007

Pearson Education

R-2

Introduction to the Design and Analysis of Algorithm

Anany Levitin

2nd

2003

Pearson Education

R-3

Computer Al Algorithms - Introduction to Design and Analysis

Sara Baase and Allen Van Gelder

2nd

2006

Pearson Education

R-4

Fundamentals of Computer Algorithms

Horowitz, S. Sahni

2nd

2005

Galgotia Publishers

Other Reading Sr No

Jour Journa nals ls arti articl cles es as Comp Compul ulsa sary ry read readin ing g (sp (spec ecif ific ic arti articl cles es,, com compl plet etee refe refere renc nce) e)

OR-1 OR-1

http:/ http://ww /www.p w.pers ersona onal.k l.kent ent.ed .edu/~ u/~rmu rmuham hamma/ ma/Alg Algori orithm thms/M s/MyAl yAlgor gorith ithms/ ms/Com Comple plexit xity/n y/npCo pComp mplet lete.h e.htm tm (NP Comple Completen teness ess)) ,

OR-2 OR-2

http http:/ ://d /del elab ab.c .csd sd.au .auth th.g .gr/ r/~m ~man anol olop opo/ o/Des Desig ign/ n/ch ch03 03.p .ppt pt (Bru (Brute te Force Force Stri String ng Match Matchin ing) g) ,

OR-3 OR-3

http http:/ ://w /www ww.p .per erso sona nal. l.ke kent nt.ed .edu/ u/~r ~rmu muha hamm mma/ a/Al Algo gori rith thms ms/a /alg lgor orit ithm hm.h .htm tmll (Con (Concep cepts ts of of Desig Design n of Alg Algor orit ithm hms) s) ,

OR-4 OR-4

http ttp://w ://www ww.c .csc sc.v .viillan llano ova.e va.ed du/~m u/~map ap/8 /83 301/l 01/lec ec03 03.p .pd df ,

OR-5 OR-5

http http:/ ://w /www ww.p .per erso sona nal. l.ke kent nt.ed .edu/ u/~r ~rmu muha hamm mma/ a/Al Algo gori rith thms ms/M /MyA yAlg lgor orit ithm hms/ s/So Sort rtin ing/ g/qu quic ickS kSor ort. t.ht htmd mdev evice icess ,

Relevant Websites Sr No

(Web address) (only if relevant to the course)

Salient Features

RW-1

http://courses.ncsu.edu/ma103/common/media/05/MA103Lct25.mp4

Prims and Kruskals algorithms

RW-2

http://optla bb-server.sc e. e.c ar arleton.ca/POAnimations2007/DijkstrasAlgo.html

Dijkstra' s shortest path

RW-3

http://www.cse.yorku.ca/~aaw/Zambito/TSP_L/Web/TSPStart.html

Travelling Salesman Problem

0.0

0.0

3.0

Weeks before MTE

7

Weeks After MTE

6

Spill Over

2

Detailed Plan For Lectures Week Number

Lecture Number

Broad Topic(Sub Topic)

Week 1

Lecture 1

Week 2

Chapters/Sections of Text/reference books

Lecture Description

Learning Outcomes

Pedagogical Tool Demonstration/ Case Study / Images / animation / ppt etc. Planned

Introduction to Basic Concepts of T-1:Chapter1(1.1and Algorithms(Notion of Algorithm , 1.2) Fundamentals of Algorithmic R-1:Chapter1(1.2) Solving , Important Problem types R-3:Chapter3(3.1) , Fundamentals of the Analysis Framework , Asymptotic Notations and Basic Efficiency Classes.)

Basic knowledge about algorithms and concepts of complexities of algorithms

Would be knowing about fundamentals of algorithms

Slides

Lecture 2




Slides

Lecture 3




Slides

Lecture 4




Slides

Lecture 5

Mathematical Analysis of Nonrecursive and Recursive Algorithm (Fibonacci Numbers, Solving recurrences using master method, substitution and iteration method.)

Some examples of recursive and non recursive algorithms

Would be learning about iteration and substitution methods

Slides

-1:Chapter4(4.1 and 4.3 and 4.5) R-1:Chapter2(2.5 and 2.6)

Other Readings, Relevant Websites, Audio Visual Aids, software and Virtual Labs

OR-4

Week 2

Lecture 6



OR-4



Slides

Week 3

Lecture 7



OR-4



Slides

Lecture 8



OR-4



Slides

Lecture 9



OR-4



Slides

Week 4

Week 5

Lecture 10

Test 1

Lecture 11

Sorting and order statics(Heap sort, T-1:Chapter 6(6.3 Quick sort and sorting in linear and 6.4) Chapter time.) 7(7.1 and 7.2 and 7.3 and 7.4) Chapter 8(8.1 and 8.2 and 8.3 and 8.4)

OR-5

Different sorting techniques

Would be learning the Slides method to sort the given list by using different methods

Lecture 12


OR-5



Lecture 13


OR-5



Lecture 14


OR-5



Wee k 5

Lecture 15

Data Struc tures(Eleme ntary da ta structures, Hash tables, BST, Red Black trees.)

T-1:Chapter10(10.1 and 10.2 and 10.3 and 10.4) Chapter 11(11.1 and 11.2 and 11.3) Chapter 12(12.1 and 12.2)

Different operations on Binary Search trees and basics of stacks and linked lists and hashing

Would be knowing the fundamentals of red blacks trees and BST and Hashing concept

Slides

Wee k 6

Lecture 16

Data Struc tures(Eleme ntary da ta structures, Hash tables, BST, Red Black trees.)




Slides

Lecture 17

Data Structures(Elementary data structures, Hash tables, BST, Red Black trees.)




Slides

Lecture 18 Week 7

Test 2

Lecture 19

Advanced Data Structures (Binomial Heap ,Fibonacci heap.)

T-1:Chapter19(19.1 and 19.2) Chapter 20(20.1 and 20.2 and 20.3) Chapter 23(23.1)

Structure of Fibonacci heaps

Would be knowing about Advanced Data Structures

Slides

Lecture 20





Slides

Lecture 21





Slides

MID-TERM Wee k 8

Lecture 22

Advanc ed des ign and analys is techniques(Dynamic Programming.)

T-1:Chapter 15(15.1 and 15.2 and 15.3) Chapter 16(16.1)

Assembly Line Would be knowing the scheduling,Matrix Chain basics of some Multiplication Dynamic Algorithms

Slides

Lecture 23

Advanced design and analysis techniques(Dynamic Programming.)



Slides

Wee k 8

Lecture 24

Advanc ed des ign and analys is techniques(Dynamic Programming.)



Slides

Wee k 9

Lecture 25

Advanc ed des ign and analys is techniques(2)(Greedy techniques, Brute force techniques, amortized analysis.)

T-1:Chapter 17(17.1 and 17.2 and 17.3 and 17.4) Chapter 16(16.2 and 16.3 and 16.4)

Elements of Greedy Strategy,A task scheduling problem

Would be knowing about potential method and aggregate analysis

Slides

Lecture 26

Advanced design and analysis techniques(2)(Greedy techniques, Brute force techniques, amortized analysis.)




Slides

Lecture 27





Slides

Lecture 28





Slides

Lecture 29





Slides

Lecture 30

Graph Algorithm(Minimum Spanning trees,Single source and all source shortest path algorithm,Maximum flow)

-1:Chapter 23(23.2) Chapter 24(24.1 and 24.2 and 24.3) Chapter 25(25.1 and 25.2) Chapter 26(26.1 and 26.2)

RW-1 RW-2

Minimum Spanning Tree Would be knowing and Shortest path about graphs Algorithms

Slides

Lecture 31



RW-1 RW-2


Slides

Week 10

Wee k 11

Wee k 11

Lecture 32



RW-1 RW-2


Lecture 33 Week 12

Week 13

Slides

Quiz 1

Lecture 34

String Matching Techniques(Brute T-1:Chapter 32(32.2 force, Robin Karp, Bellman and 32.4) Ford,KMP)

OR-2

Some string matching techniques

Would be knowing the methods to match two given strings

Slides

Lecture 35


OR-2



Slides

Lecture 36


OR-2



Slides

Lecture 37

Problem classes P(NP, NP-hard and NP-complete, deterministic and non deterministic polynomial time algorithms)

T-1:Chapter 34(34.5) R-1:Chapter10(10.1 and 10.2)

OR-1

Distinction between Deterministic and Non Deterministic Algorithms

Would be leaning about Slides NP complete problems

Lecture 38



OR-1



Lecture 39



OR-1



SPILL OVER Week 14

Lecture 40

T-1:Chapter 35

Approximation algorithms for some NPcomplete

Some more NP complete problems

Slides

Lecture 41

T-1:Chapter 35

Approximation algorithms for some NPcomplete

Some more NP complete problems

Slides

Scheme for CA: Component

Frequency

Out Of

Test

1

Quiz

1

Each Marks Total Marks 2

Total :-

10

10

10

10

20

20

Details of Academic Task(s) AT No.

Objective

Topic of the Academic Task

Nature of Academic Task (group/individuals/field work

Evaluation Mode

Allottment / submission Week 10 / 11

Quiz 1

To pursue the WEEK 1 TO WEEK 11 students practicing the objective type questions related to placement activities

Individual

MCQ with 1/4 of negative marking

Test 2

Advanced Data Structure

WEEK 1 TO WEEK 6

Individual

Step by step evaluation of selected questions

5/6

Test 1

Fundamentals of algorithm

WEEK1 TO WEEK4

Individual

Step by Step evaluation of selected questions

3/4

cse 408

Recommend Documents