UE18CS251 - Design and Analysis of Algorithms (4:0:0:0:4)

# of Hours: 56
Class Chapter Title / Topics to be Covered
% of Portion
# Reference
covered
Literature
% of Cumula
Syllabus tive %
1 Unit #1 The motivation for the course.
Scheme of the course.
T1: Chapters Introduction to Algorithms.
1.1, 1.2, 1.3,
2
2.1, 2.2, 2.3, 2.4 Fundamentals of Algorithmic problem-solving.
Important problem types – sorting, searching. 16.07 16.07
3 Important problem types – string processing,
graph problems, Combinatorial, Geometrical,
numerical problems
4 Analysis Framework, Orders of Growth
5 Asymptotic Notations
6 Basic Efficiency Classes
7 Analysis of Non-recursive Algorithms
8 Analysis of Recursive Algorithms
9 Solving Recurrences of Recursive Algorithms
10 Unit #2 Brute-Force approach and Sequential Search
11 Brute-Force String Matching
T1: Chapters
12 Selection Sort and Bubble Sort
3.1, 3.2,
13 5.2, Exhaustive Search – Travelling Salesman 23.22 39.29
3.4, Problem
14 5.1, 5.3, 5.4, 5.5 Knapsack Problem, Assignment Problem
15 Recursion
16 Decrease-and-Conquer approach - Insertion
Sort
17 Depth First Search
18 Breadth First Search
19 Topological Sorting
20 Algorithms for Generating Combinatorial
Objects
21 Johnson Trotter Algorithm
22 Decrease-by-a-Constant-Factor Algorithms
23 Unit #3 Divide-and-Conquer approach with Mergesort
24 Quicksort
T1: Chapters
25 Binary Search
4.1, 4.2, 4.3, 4.4,
26 4.5, Multiplication of Large Integers 19.64 58.93
27 6.1, 6.3, 6.4, Strassen’s Matrix Multiplication
28 7.4 Transform-and-Conquer approach – Presorting
29 Heapsort
30 Balanced Search Trees - AVL and Red-black
Trees
31 Red-black Tree Construction
32 2-3 Trees
33 B Trees
34 Unit #4 Space and Time Tradeoffs - Sorting by Counting
 35 Distribution Counting Sort
36 T1: chapters Input Enhancement in String Matching –
7.1, 7.2,
Horspool’s algorithm
12.1, 12.2,
37 9.1, 9.2, 9.3, 9.4 Boyer-Moore Algorithm 19.64 78.57
38 Backtracking: N queens Problem, Hamiltonian
circuit Problem
39 Branch-and-Bound: Knapsack Problem,
Travelling Salesman Problem
40 Greedy Approach
41 Prim’s Algorithm
42 Kruskal’s Algorithm
43 Dijkstra’s Algorithm
44 Huffman trees
45 Unit #5 Dynamic Programming approach
46 Examples of Dynamic Programming
T1: chapters
47
8.1, 8.4,
Computing a Binomial Coefficient
48 8.2, Knapsack problem and Memory Functions
49 11.1, 11.2, 11.3 Problem: All-pairs Shortest-paths
50 Floyd’s Algorithm
51 Problem: Finding Transitive Closure 21.43 100
52 Warshall’s Algorithm
53 Lower Bound Algorithms
54 Decision Trees
55 P, NP and NP-Complete classes of problems
56 Coping with the limitations of Algorithm Power

Literature

Publication Information
Book Type Code Title & Author
Edition Publisher Year
Introduction to The Design and
Text Book T1 Analysis of Algorithms 2 Pearson 2011
Anany Levitin
Introduction to Algorithms
Prentice-Hall India
Reference Thomas H. Cormen, Charles E.
R1 3 2009
Book Leiserson, Ronald L. Rivest and
Clifford Stein
Horowitz, Sahni, Rajasekaran,
Reference
R2 Fundamentals of Computer 2 Universities Press 2007
Book
Algorithms
Reference Jon Kleinberg, Eva Tardos, Pearson
R3 1 2006
Book Algorithm Design Education