Lovely Professional University, Punjab

Course Code Course Title Lectures Tutorials Practicals Credits Course Planner
CSE408 DESIGN AND ANALYSIS OF ALGORITHMS 3 0 0 3 27633::Dr. Harpreet Kaur
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50

Course Focus EMPLOYABILITY,SKILL DEVELOPMENT

Course Outcomes :Through this course students should be able to

CO1 :: Understand the basic techniques of analyzing the algorithms using space and time complexity, asymptotic notations
CO2 :: apply the various string matching algorithms
CO3 :: Analyze the divide and conquer algorithm design technique using various problems
CO4 :: Evaluate the various dynamic programming and greedy algorithm design technique to solve various problems
CO5 :: Apply the Approximation Algorithm to solve some classic problems and design technique.
CO6 :: Define intractability (NP-completeness) and understand to solve the optimization problems

It is mandatory to complete the number of courses for being eligible for End Term Examination
along with the attendance criteria of the university. The links of the courses as shared in the IP
should be completed on/before the last teaching day as per the academic calendar of the
university.

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://www.coursera.org/learn/analysis-of-algorithms Foundations of Algorithm

RW-2 https://www.coursera.org/learn/algorithms-on-strings String and its Matching Algorithms

RW-3 www.coursera.org/learn/linear-programming-and-approximation-algorithms Introduction to Approximation Algorithms

RW-4 https://www.coursera.org/learn/dynamic-programming-greedy-algorithms Divide and Conquer,Dynamic Programming ,Greedy Algoritms, NP

completeness

LTP week distribution: (LTP Weeks)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 Weeks before MTE 7
Weeks After MTE 7
Spill Over (Lecture) 7

Detailed Plan For Lectures

Week Tentative Broad Sub Topics Link of Sub Topics
Number Date Topic
10/1/2024- Analysis of Algorithms
16/1/2024
10/1/2024- 1. History and Motivation 1.https://www.coursera.org/learn/analysis-of-
16/1/2024 algorithms/lecture/oiAWW/history-and-motivation
Foundations of
10/1/2024- 2. A Scientific Approach 2. https://www.coursera.org/learn/analysis-of-
Algorithm
16/1/2024 algorithms/lecture/LAXjA/a-scientific-approach

10/1/2024- 3. Example: Quicksort 3. https://www.coursera.org/learn/analysis-of-

16/1/2024 algorithms/lecture/36aPp/example-quicksort
10/1/2024- Recurrences
16/1/2024
10/1/2024- 1. Computing Values 1.https://www.coursera.org/learn/analysis-of-
Week 1 16/1/2024 algorithms/lecture/u28LG/computing-values
10/1/2024-
16/1/2024
10/1/2024- 2. Telescoping 2. https://www.coursera.org/learn/analysis-of-
16/1/2024 Foundations of algorithms/lecture/43guA/telescoping
Algorithm
10/1/2024- 3. Types of Recurrences 3. https://www.coursera.org/learn/analysis-of-
16/1/2024 algorithms/lecture/XddoK/types-of-recurrences

10/1/2024- 4. Mergesort 4. https://www.coursera.org/learn/analysis-of-

16/1/2024 algorithms/lecture/tMV3b/mergesort
10/1/2024- 5. Master Theorem 5. https://www.coursera.org/learn/analysis-of-
16/1/2024 algorithms/lecture/PMROV/master-theorem
17/1/2024- Generating functions
23/1/2024
17/1/2024- 1. Ordinary Generating Functions, 1. https://www.coursera.org/learn/analysis-of-
23/1/2024 algorithms/lecture/RqDLx/ordinary-generating-functions
Foundations of
Week 2
17/1/2024- Algorithm 2. Counting with Generating 2. https://www.coursera.org/learn/analysis-of-
23/1/2024 Functions, algorithms/lecture/b0Spr/counting-with-generating-functions

17/1/2024- 3. Catalan Numbers, 3. https://www.coursera.org/learn/analysis-of-

23/1/2024 algorithms/lecture/EcHFd/catalan-numbers

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 17/1/2024- 4. Solving Recurrences, 4. https://www.coursera.org/learn/analysis-of-
23/1/2024 algorithms/lecture/tnmBd/solving-recurrences

17/1/2024- 5. Exponential Generating 5. https://www.coursera.org/learn/analysis-of-

23/1/2024 Functions. algorithms/lecture/WpbNx/exponential-generating-functions

24/1/2014- Asymptotics
30/1/2024
24/1/2014- 1.Standard Scale 1. https://www.coursera.org/learn/analysis-of-
30/1/2024 algorithms/lecture/0IJDV/standard-scale
24/1/2014- 2.Manipulating Expansions 2. https://www.coursera.org/learn/analysis-of-
30/1/2024 algorithms/lecture/j8EnC/manipulating-expansions
Foundations of
Algorithm
24/1/2014- 3. https://www.coursera.org/learn/analysis-of-
30/1/2024 algorithms/lecture/vradC/asymptotics-of-finite-sums
3.Asymptotic of Finite Sums
24/1/2014- 4. https://www.coursera.org/learn/analysis-of-
30/1/2024 algorithms/lecture/OHrli/bivariate-asymptotics
4. Bivariate Asymptotics
Week 3
24/1/2014- Trees
30/1/2024
24/1/2014- 1. Trees and Forests 1. https://www.coursera.org/learn/analysis-of-
30/1/2024 algorithms/lecture/feztA/trees-and-forests

24/1/2014- 2. Binary Search Trees 2. https://www.coursera.org/learn/analysis-of-

30/1/2024 Foundations of algorithms/lecture/IXKQw/binary-search-trees
Algorithm

24/1/2014- 3. Path Length 3. https://www.coursera.org/learn/analysis-of-

30/1/2024 algorithms/lecture/Bzppb/path-length
24/1/2014- 4. Other Types of Trees. 4. https://www.coursera.org/learn/analysis-of-
30/1/2024 algorithms/lecture/Je4Cj/other-types-of-trees

31/1/2024- Strings and Tries

6/2/2024
31/1/2024- 1. Bit strings with Restrictions 1. https://www.coursera.org/learn/analysis-of-
6/2/2024 algorithms/lecture/eASyM/bitstrings-with-restrictions
String and its
Week 4 31/1/2024- Matching 2. Languages 2. https://www.coursera.org/learn/analysis-of-
6/2/2024 Algorithms algorithms/lecture/EYuD7/languages
31/1/2024- 3. Tries 3. https://www.coursera.org/learn/analysis-of-
6/2/2024 algorithms/lecture/5iqb3/tries
31/1/2024- 4. Trie Parameters 4. https://www.coursera.org/learn/analysis-of-
6/2/2024 algorithms/lecture/rrWLr/trie-parameters

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 31/1/2024- Key pattern matching concepts:
6/2/2024
31/1/2024- 1. Suffix Tree 1. https://www.coursera.org/learn/algorithms-on-strings/home/week/1
6/2/2024
31/1/2024- 2. Knuth-Morris-Pratt algorithm 2. https://www.coursera.org/learn/algorithms-on-strings/home/week/3
6/2/2024
7/2/2024-
13/2/2024

Divide and Conquer https://www.coursera.org/learn/dynamic-programming-greedy-

Technique algorithms/supplement/uYVoZ/overview-of-module-1
7/2/2024-
13/2/2024

1.What Are Divide and Conquer 1. https://www.coursera.org/learn/dynamic-programming-greedy-

Algorithms? algorithms/lecture/WDlY3/what-are-divide-and-conquer-algorithms
week5 7/2/2024-
13/2/2024 Divide and
Conquer
Technique

2.Max Subarray Problem Using 2.https://www.coursera.org/learn/dynamic-programming-greedy-

Divide and Conque algorithms/lecture/zZxvL/max-subarray-problem-using-divide-and-conquer
7/2/2024-
13/2/2024

3. .Karatsuba’s Multiplication 3. https://www.coursera.org/learn/dynamic-programming-greedy-

7/2/2024- Algorithm , algorithms/lecture/eYkEq/karatsubas-multiplication-algorithm
13/2/2024
14/2/2024- 1. FFT Part 1: Introduction and 1. https://www.coursera.org/learn/dynamic-programming-greedy-
20/2/2024 Complex Numbers,FFT algorithms/lecture/UErFb/fft-part-1-introduction-and-complex-numbers

14/2/2024- 2. Definition and Interpretation 2. https://www.coursera.org/learn/dynamic-programming-greedy-

20/2/2024 of Discrete Fourier Transforms, algorithms/lecture/mSmQQ/fft-part-2-definition-and-interpretation-of-discrete-
Divide and FFT: fourier-transforms
Week 6 Conquer
14/2/2024- Technique 3. Divide and Conquer 3. https://www.coursera.org/learn/dynamic-programming-greedy-
20/2/2024 Algorithm for FFT, algorithms/lecture/DD0H5/fft-part-3-divide-and-conquer-algorithm-for-fft
14/2/2024- 4. Application # 1 : Fast 4. https://www.coursera.org/learn/dynamic-programming-greedy-
20/2/2024 Polynomial Multiplication using algorithms/lecture/vkC5d/application-1-fast-polynomial-multiplication-using-
FFT , fft

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 14/2/2024- 5. Application # 2: Data 5. https://www.coursera.org/learn/dynamic-programming-greedy-
20/2/2024 Analysis using FFT) algorithms/lecture/skosc/application-2-data-analysis-using-fft

21/2/2024-
Week 7
27/2/2024 TEST 2
Lecture 20
Lecture 21
MTE
14/02/2024- Dynamic Programming and https://www.coursera.org/learn/dynamic-programming-greedy-
20/02/2024 Greedy Techniques algorithms/supplement/wOGMy/overview-of-module-2

14/02/2024- 1. Introduction to Dynamic 1. . https://www.coursera.org/learn/dynamic-programming-greedy-

20/02/2024 Programming + Rod Cutting algorithms/lecture/6E9rT/introduction-to-dynamic-programming-rod-cutting-
Problem problem

Dynamic
14/02/2024- Programming 2. Rod Cutting Problem: 2. https://www.coursera.org/learn/dynamic-programming-greedy-
Week 8
20/02/2024 and Greedy Memoization algorithms/lecture/7UsUu/rod-cutting-problem-memoization
Techniques

14/02/2024- 3. Coin Changing Problem 3. https://www.coursera.org/learn/dynamic-programming-greedy-

20/02/2024 algorithms/lecture/1ymc9/coin-changing-problem
14/02/2024- 4. Knapsack Problem 4. https://www.coursera.org/learn/dynamic-programming-greedy-
20/02/2024 algorithms/lecture/ev4NL/knapsack-problem

21/02/2024- 1. When Optimal Substructure 1. https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 Fails algorithms/lecture/7U6eq/when-optimal-substructure-fails

21/02/2024- 2.Dynamic Programming: 2. https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 Longest Common Subsequence algorithms/lecture/H3XVF/dynamic-programming-longest-common-
Dynamic subsequence
Programming
Week 9
and Greedy
Techniques

21/02/2024- Greedy Algorithms 1.https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 algorithms/supplement/07H2P/overview-of-module-3

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 21/02/2024- 2. Introduction to Greedy 2. https://www.coursera.org/learn/dynamic-programming-greedy-
27/02/2024 Algorithm algorithms/lecture/x57tt/introduction-to-greedy-algorithms

21/02/2024- 3. Greedy Interval Scheduling 3. https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 algorithms/lecture/N5OjG/greedy-interval-scheduling

21/02/2024- 4. Prefix Codes 4. https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 algorithms/lecture/acxZW/prefix-codes

21/02/2024- 5. Huffman Codes 5.https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 algorithms/lecture/n381c/huffman-codes

21/02/2024- 6. Huffman Codes: Proof of 6 https://www.coursera.org/learn/dynamic-programming-greedy-

27/02/2024 Optimality algorithms/lecture/bQW95/huffman-codes-proof-of-optimality

28/02/2024- Approximation
03/04/2024 Algorithms:Scheduling,Vertex
Cover and MAX-SAT

28/02/2024- 1. Introduction to 1. https://www.coursera.org/learn/linear-programming-and-approximation-

03/04/2024 Approximation Algorithms algorithms/lecture/cRczb/introduction-to-approximation-algorithms

Approximation
Week 10
Algorithms

28/02/2024- 2. Introduction to Jobshop 2. https://www.coursera.org/learn/linear-programming-and-approximation-

03/04/2024 Scheduling and Algorithm algorithms/lecture/X9s0L/introduction-to-jobshop-scheduling-and-algorithm-
design design

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 28/02/2024- 3. Analysis of Jobshop 3. https://www.coursera.org/learn/linear-programming-and-approximation-
03/04/2024 Scheduling algorithms/lecture/EukmR/analysis-of-jobshop-scheduling

04/04/2024- 1. Approximation Algorithms 1. https://www.coursera.org/learn/linear-programming-and-approximation-

10/04/2024 for Vertex Cover and their algorithms/lecture/Ii8kJ/approximation-algorithms-for-vertex-cover-and-their-
Analysis analysis

Approximation
Week 11
Algorithms
04/04/2024- 2. Approximation Algorithms 2. https://www.coursera.org/learn/linear-programming-and-approximation-
10/04/2024 for the Maximum Satisfiability algorithms/lecture/59sPO/approximation-algorithms-for-the-maximum-
Problem satisfiability-problem

11/04/2024- Travelling Salesman Problem

17/04/2024 and Approximation schemes

Approximation
Week 12 11/04/2024- 1.Introduction to TSP and its 1.https://www.coursera.org/learn/linear-programming-and-approximation-
Algorithms
17/04/2024 applications algorithms/lecture/e0BRo/introduction-to-tsp-and-its-applications

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 11/04/2024- 2. NP-Hardness of TSPs 2.https://www.coursera.org/learn/linear-programming-and-approximation-
17/04/2024 algorithms/lecture/7aOFO/np-hardness-of-tsps

11/04/2024- 3. Hardness of Approximating 3.https://www.coursera.org/learn/linear-programming-and-approximation-

17/04/2024 General TSPs algorithms/lecture/kHKKa/hardness-of-approximating-general-tsps

18/04/2024- Intractability and supplement

24/04/2024 on Quantum Computing

18/04/2024- .1.Decision Problems and 1. https://www.coursera.org/lecture/dynamic-programming-greedy-

24/04/2024 Languages, algorithms/decision-problems-and-languages-1Ngm0

18/04/2024- 2. Polynomial Time Problmes 2. https://www.coursera.org/learn/dynamic-programming-greedy-

24/04/2024 algorithms/lecture/sgyBD/polynomial-time-problems
Introduction to
intractability
(NP-
Week 13 completeness)
and solving
optimization
18/04/2024- problems 3. NP Definition, 3. https://www.coursera.org/learn/dynamic-programming-greedy-
24/04/2024 algorithms/lecture/QBI2s/np-definition

18/04/2024- 4. NP Completeness and 4. https://www.coursera.org/learn/dynamic-programming-greedy-

24/04/2024 Reductions algorithms/lecture/FX8p4/np-completeness-and-reductions

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 18/04/2024- 5.,NP Complete Problems: 5. https://www.coursera.org/learn/dynamic-programming-greedy-
24/04/2024 Examples, algorithms/lecture/HZV05/np-complete-problems-examples

18/04/2024- 6. Computation and Physics , 6. https://www.coursera.org/learn/dynamic-programming-greedy-

24/04/2024 algorithms/lecture/xsbpd/computation-and-physics

18/04/2024- 7.Qubits and Operations, 7. https://www.coursera.org/learn/dynamic-programming-greedy-

24/04/2024 algorithms/lecture/bzesh/qubits-and-operations

18/04/2024- 8. Bell's Inequality, 8. https://www.coursera.org/learn/dynamic-programming-greedy-

24/04/2024 algorithms/lecture/nRWD3/bells-inequality

18/04/2024- 9.Grover's Search Algorithm 9. https://www.coursera.org/learn/dynamic-programming-greedy-

24/04/2024 algorithms/lecture/PJoyZ/grovers-search-algorithm

25/4/2024- Lecture 40 TEST3

01/05/2024
25/4/2024- Lecture 41
Week 14 01/05/2024
25/4/2024- Lecture 42
01/05/2024

Scheme for CA:

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 CA Category of this Course Code is:A0203 (2 best out of 3)

Component Weightage (%) Mapped CO(s)

Test 1 50 CO1, CO2
Test 2 50 CO3
Test 3 50 CO4, CO5, CO6

Details of Academic Task(s)

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Test 1 To check the MCQ Based Class Test Individual Online 30 5/5
learning level
Test 2 To Check the MCQ based Class Test Individual Online 30 7/7
Learning level
Test 3 To check the MCQ Based Class Test Individual Online 30 13 / 14
learning level

It is mandatory to complete the number of courses for being eligible for End Term Examination
along with the attendance criteria of the university. The links of the courses as shared in the IP
should be completed on/before the last teaching day as per the academic calendar of the
university.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.