Syllabus

for Bachelor of Technology

Computer Engineering

Subject Code: 01CE0503

Subject Name: Design and Analysis of Algorithm

B.Tech. Year - III

Objective: Obtaining efficient algorithm is very important in modern computer

engineering as the world wants applications to be time and space and energy
efficient. This course enables to understand and analyse efficient algorithms for
various applications.

Credits Earned: 5 Credits

Course Outcomes:

• Learn and understand asymptotic notations for performance of different algorithms.

(Understand)
• Derive and solve recurrences describing the performance of divide-and-conquer
algorithms (Evaluate)
• Design optimal solution by applying various methods like Dynamic Programming
and Greedy Method. (Application)
• Summarize the certain graph algorithms and their analysis.(Application)
• Apply pattern matching algorithms (Application)
• Differentiate polynomial and non-polynomial problems. ( Analysis)

Pre-requisite of course: Data Structure and proficiency in programming

language, knowledge of Mathematical functions like logarithms, graphs etc.

Teaching and Examination Scheme

Tutorial/ Practical
Teaching Scheme (Hours) Theory Marks
Marks
Total
Credits Mid Term
ESE Internal Marks
Theory Tutorial Practical Sem Viva (V) work
(E) (I)
(M) (TW)
4 0 2 5 50 30 20 25 25 150

Contents:

Sr No Course content Total Hrs
1 Introduction to Design and Analysis of Algorithms: 02
What is an algorithm, Mathematics for Algorithmic Sets, Functions and
Relations, Vectors and Matrices, Linear Inequalities and Linear
 Syllabus for Bachelor of Technology

Computer Engineering

Equations.
2 Analysis of Algorithm: 08
The efficient algorithm, Average, Best and worst case analysis,
Amortized analysis , Asymptotic Notations(Big Oh, Big Theta, Big
Omega), Master Method, Sorting Algorithms and analysis: Bubble sort,
Selection sort, Insertion sort, Shell sort, Heap sort, Sorting in linear
time : Bucket sort, Radix sort and Counting sort
3 Divide and Conquer: 08
Introduction, Recurrence and different methods to solve recurrence,
Multiplying large Integers Problem, Problem Solving using divide and
conquer algorithm - Binary Search, Max-Min problem, Sorting (Merge
Sort, Quick Sort), Matrix Multiplication, Exponential.
4 Dynamic Programming: 08
Introduction, Elements of Dynamic Programming, The Principle of
Optimality, Problem Solving using Dynamic Programming – Calculating
the Binomial Coefficient, Making Change Problem, Assembly Line-
Scheduling, Knapsack problem, Matrix chain multiplication, Longest
Common Subsequence.
5 Greedy Algorithm 06
General Characteristics of greedy algorithms, Elements of greedy
strategy, Problem solving using - Activity selection problem, Fractional
Knapsack Problem, Job Scheduling Problem.

6 Graph Algorithms 08
Representation of Undirected & Directed Graph, Traversing Graphs,
Depth First Search, Breath First Search, Topological sort, Strongly
Connected components. Single pair shortest path and Minimum
Spanning trees (Kruskal’s algorithm, Prim’s algorithm) using greedy
approach, All Points Shortest path using Dynamic Programming,
7 Backtracking and Branch and Bound: 05
Introduction, The Eight queens problem, Knapsack problem, Travelling
Salesman problem, Minimax principle.
8 String Matching: 05
Introduction, The naive string matching algorithm, The Rabin-Karp
algorithm, String Matching with finite automata, The Knuth-Morris-
Pratt algorithm.
9 Introduction to NP-Completeness: 06
The class P and NP, Polynomial reduction, 2-CNF Satisfiability, 3- CNF
Satisfiability, NP- Completeness Problem, NP-Hard Problems.
Travelling Salesman problem, Hamiltonian problem.
Total 56 hrs

 Syllabus for Bachelor of Technology

Computer Engineering

References:

1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L.

Rivest and Clifford Stein, PHI.
2. Fundamental of Algorithms by Gills Brassard, Paul Bratley, PHI.
3. Introduction to Design and Analysis of Algorithms, Anany Levitin, Pearson.
4. Foundations of Algorithms, Shailesh R Sathe, Penram
5. Design and Analysis of Algorithms, Dave and Dave, Pearson.

Suggested Theory distribution:
The suggested theory distribution as per Bloom’s taxonomy is as per follows.
This distribution serves as guidelines for teachers and students to achieve
effective teaching-learning process

Distribution of Theory for course delivery and evaluation

Remember Understand Apply Analyse Evaluate Create

0% 20% 40% 20% 20% 0%

Suggested List of Experiments:
1. Implementation and Time analysis of sorting algorithms.
Bubble sort, Selection sort, Insertion sort, Merge sort and Quicksort
2. Implementation and Time analysis of linear and binary search algorithm.
3. Implementation of max-heap sort algorithm
4. Implementation and Time analysis of factorial program using iterative and
recursive method
5. Implementation of a knapsack problem using dynamic programming.
6. Implementation of chain matrix multiplication using dynamic programming.
7. Implementation of making a change problem using dynamic programming
8. Implementation of a knapsack problem using greedy algorithm
9. Implementation of Graph and Searching (DFS and BFS).
10. Implement prim’s algorithm.
11. Implement Kruskal’s algorithm.
12. Implement LCS problem.
13. To implement following string matching algorithms and analyze time
complexities: a. Naïve b. Rabin Karp c. Knuth Morris Pratt
14. Write a program for Floyd-Warshal algorithm.
15. Write a program for travelling salesman problem.
 Syllabus for Bachelor of Technology

Computer Engineering

16. Write a program for Hamiltonian cycle problem.

17. To implement Huffman coding and analyze its time complexity.
18. Write a program for Strassen’s Matrix Multiplication.

Instructional Method:
a. The course delivery method will depend upon the requirement of content
and need of students. The teacher in addition to conventional teaching
method by black board, may also use any of tools such as demonstration, role
play, Quiz, brainstorming, MOOCs etc.
b. The internal evaluation will be done on the basis of continuous evaluation of
students in the laboratory and class-room.
c. Practical examination will be conducted at the end of semester for evaluation
of performance of students in laboratory.

Supplementary Resources:
Students will use supplementary resources such as online videos, NPTEL videos,
e-courses, Virtual Laboratory.

1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html
2. http://nptel.ac.in/courses/106101060/
3. http://www.comp.nus.edu.sg/~cs5234/Links/Course-Links.htm
4. https://www.coursera.org/learn/algorithm-design-analysis
5. http://apps.topcoder.com/wiki/di...
6. http://www.geeksforgeeks.org,
7. http://www.algolist.net
8. http://www.cprogramming.com
9. http://www.codingunit.com