ANALYSIS AND DESIGN OF ALGORITHMS

Course Code 22ISG42 Credits 4

Hours/Week (L-T-P) 3-0-2 CIE Marks 50
Total Hrs. 52 Hours SEE Marks 50
Exam Hrs. 3 Hours Course Type PICC
Course Component Theory + Lab
COURSE LEARNING OUTCOMES
1. Describe the fundamentals of algorithms and asymptotic notations.
2. Apply brute force / divide & conquer design technique for solving the given problem.
3. Relate decrease & conquer / transform conquer design techniques for solving the given
problem.
4. Extrapolate the technique of space and time trade-ff for sorting and pattern matching
problems.
5. Demonstrate dynamic programming techniques for solving transitive closure / shortest path
/Knapsack problems.
6. Interpret the working principle of greedy and backtracking techniques to solve the given
problem.
COURSE CONTENTS
UNIT -1- (8 Hrs.)
Introduction: What is an Algorithm? Fundamentals of algorithmic problem solving
Fundamentals of Analysis of Algorithm Efficiency: Analysis Framework: Measuring an input’s size,
Units for Measuring Running Time, Orders of Growth, Worst-case, Best-Case, and Average Case
Efficiencies, Asymptotic Notations and Basic Efficiency Classes: Informal introduction, O-notation,
Ώ-notation, θ-notation, Basic Efficiency classes; Mathematical
Analysis of Non-recursive and Recursive Algorithms
UNIT -2- (9 Hrs.)
Brute Force: Brute-Force String Matching, Exhaustive Search: Travelling Salesman Problem,
Assignment Problem.
Divide and Conquer: Merge sort, Quick Sort, Binary tree traversals and related properties,
Multiplication of Large Integers and Strassen’s Matrix Multiplication.
UNIT -3- (7 Hrs.)
Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting,
Decrease by a Constant factor algorithms.
Transform and Conquer: Balanced Search Trees, Heaps and Heap sort
UNIT -4- (8 Hrs.)
Space and Time Trade-offs: Sorting by counting, Input Enhancement in String Matching: Horspools
Algorithm, Dynamic Programming:Warshall’s and Floyd’s Algorithms, Knapsack problem.
UNIT -5- (7 Hrs.)
Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Djikstra’s Algorithm, Huffman Trees,
Backtracking: n-Queens Problem
TEXT BOOKS
Text Book Edition/Year of
SINO Unit Author(s) Publisher(s)
Title Publication
Introduction
to the 2nd Edition, 2007
Pearson
1 1-5 Design & Anany Levitin
education
Analysis of
Algorithms
 Ellis Horowitz,
Computer SartajSahani, Computer
2 1-5 2nd Edition
Algorithms Sanguthevar Science Press.
Rajasekaran
REFERENCE BOOKS
Horowitz E.,
Computer Galgotia
1 1-5 SahaniS.,Rajasekaran 2001
Algorithms Publications
S
Thomas H., Cormen,
Introduction
Charles E. Leiserson,
2 1-5 to PHI 2nd Edition, 2006
Ronal L. Rivest,
Algorithms
Clifford Stein
ONLINE RESOURCES (Links to MOOCS, NPTEL, MIT COURSEWARE etc)
Topic/Title Link
https://swayam.gov.in/nd1_noc20_cs27/preview
COURSE ASSESSMENT METHOD:
Assessment Methods:
i. Aptitude Test(MCQs) based on GATE syllabus for 10 Marks.
ii. Problem Solving on each Unit for 10 Marks
i. Three MSEs for 30 Marks (40% of MSE-1+ 40% of MSE-2 + 20% of MSE-3)
iv. Semester End Examination for 100 Marks will be conducted and reduced for 50 Marks
Pedagogy
i. Black Board Teaching
ii. Power Point Presentation
iii. Tutorials
CO-PO-PSO MAPPING
PO PSO PSO
CO 2
1 2 3 4 5 6 7 8 9 10 11 12 1
1 3 - - - - - - - 1 - - 2 - 2
2 3 2 3 - - - - - 1 - - 2 - 2
3 3 2 3 - - - - - 1 - - 2 - 2
4 3 2 3 - - - - - 1 - - 2 - 2
5 3 2 3 - - - - - 1 - - 2 - 2
6 3 2 3 - - - - - 1 - - 2 - 2

LABORATORY EXERCISES (LA)- (13 Hrs)

SINO LIST OF EXPERIMENTS

1. Design a program to sort ‘n’ elements using selection sort & Insertion Sort in ascending or descending
order. Also find its space and time complexity.
2. Consider a list of ‘n’ files numbered using ID’s. Write a program to sort files based on its ID using
merge sort & Quicksort. Also find its time and space complexity.
a. Write a program that, for a given digraph outputs all the vertices reachable from a given starting
3. vertex using BFS method. Find its time and space complexity.
b. Consider a network having ‘n’ systems. Design a DFS based program in which outputs all
systems reachable from a given system. Find its time and space complexity.
4. Suppose you are given a list of students who are assigned IDs. Write a program to sort these students
based on their id’s using heapsort. Find its time and space complexity.
 Consider the problem of searching for genes in DNA sequences. A DNA sequence is represented by a
5. text using alphabets [A, C, G, T]. Design a program to locate a pattern in a given DNA sequence
using Horspool’s algorithm. Find its time and space complexity.

a. Consider a network of ‘n’ systems represented as a Graph. Write a program to find the transitive
6. closure of such a network using Warshall’s algorithm. Find its time and space complexity.
b. Suppose in a network of cities, you are interested in finding shortest paths between all cities.
Design a program to implement this using Floyd’s algorithm. Find its time and space complexity.

Suppose a travel agent is interested in finding shortest path from a single city to all the other cities in a
7. network of ‘n’ cities. Write a program to implement this using Djikstra’s algorithm. Find its time and
space complexity.
Consider a Electrical layout where ‘n’ houses are connected by electrical wires. Design a program
8. using Prim’s algorithm to output a connection with minimum cost. Find its time and space
complexity.
A Government wants to construct a road network connecting ‘n’ towns. Suppose each road must
9. connect ‘2’ towns and be straight. Write a program using Kruskal’s algorithm to output the least
expensive tree of roads. Find its time and space complexity.
Consider ‘n’ patients and ‘nxn’ small rooms. Design a program to allot the patients to these rooms
10. using n-queen’s method such that no two patients are allotted rooms in same row, column or diagonal.
Find its time and space complexity.