Reg. No.

:
SETA
SET BReg. No.:|
TECHNOLOGY
CHENNAI INSTITUTE OF
Chennai-600 069.
CHENNAI
INSTITUTE OF
Sarathy Nagar, Pudupedu,
TECHNOLOGY
Model
Max. Marks 100 Marks
Date /Timne 17-06-2021
Time 180 minutes
CS8451-Design and Analysis of Algorithmn
Subject with Code
Computer Science and Engineering/1T Year/Semester IIV
Branch
Course Objectives:
The Student should be able
Course Objective
S. No.
To understand and apply the algorithm analysis
techniques.
of alternative algorithmic solutions for the same problem
To critically analyze the efficiency
To understand different algorithm design techniques.
To understand the limitations of Algorithmic power.
To understand and apply the algorithm analysis techniques.
Course Outcomes:
On Completion of the course the students will be able to
Course Outcome
CO No.
C213.1 Design algorithms for various computing problems.
C213.2 Analyze the time and space complexity of algorithms. for given problem.
Critically analyze the different algorithm design techniques
a
C213.3
C213.4 Modify existing algorithms to improve efficiency.
C213.5 Design algorithms for various computing problems.

BLOOMS TAXONOMY(BT)
,K6-Creating
K1-Remembering, K2-Understanding, K3-Applying, K4-Analyzing, K5-EvaluatingCO BT Univ. QP
Part A-(10x2=10 marks)
(Answer allthe questions) level Referencee
C213.1 K2 A/M2019
1 How do you measure the efficiency of the algorithm?

Prove that f(n)=O(g(n)) and g(n)-O(f(g(n))then f(n)-O(g(n) C213.1 KAM 2019

What is exhaustive search? C213.2 KI A/M2018

3
Write an algorithm for brute force closest-pair problem C213.2 KI N/D 20166
4
State the principle of optimality C213.3 KI N/D 2017
5
How Dynamic Programming is used to solve Knapsack Problem? C213.3 K2 N/D 2018
6
Define the Capacity Constraint in the context of Maximum flow C213.4 KI AM 2019
problem.
When a linear programming is said to be unbounded? C213.4 K2 N/D 2019
8
Explain Promising and Non-Promising Node C213.5 KI N/D 2017
9
C213.5 K2 N/D 2019
10 State Hamiltonian Circuit Problem
 Part B-(5x13=65 marks) CO BT Univ.QP Marks
(Answer allthe questions) level Reference Alloted
11 | (a) () | Discuss Fundamentals of the analysis of algorithm C214.1 K2 N/D 19
|
7
efficiencyelaborately
ii) Explain the mathematical analysis ofnon-recursive C214.1 K4 MJ2017| 6

algorithms
OR
(b) (0) Write an Algorithm using recursion that determines the C214.1 K4 N/D 2019 7+6
GCD of two numbers. Determine the timeand space
complexity.
12 (a) (i) Discuss QuickSort Algorithm and Explain it with C214.2 K3 M/J 2019 5+4+4
example.DeriveWorst caseand Average Case Complexity.
(ii) Write algorithm to find closest pair of points using | C214.2 K6 N/D 2019 7+6
divide and conquer and explain it with example.
Derive the worst case and average case time
complexity
OR
(6) Explain in detail about the merge sort algorithm. C214 M/J 2018 13
Illustrate the working of this algorithm using an
example

13 (a) ) Write the Floyd algorithm to find all pairs C214.3 K6 MJ2019 4+3
i)
shortest path and deriveits time complexity
Solve the following using Floyd's algorithm.C214.3
K6 M/J/2019

OR
(6) () Write the Huffman code algorithm and derive | C214.3| K3 M/J/2019 5+2
its time complexity.
(Generate the Huffman code for the following c214.3 K6 M/J/2019 6
data comprising of alphabet and their
frequency.
a:1,b:1,c:2,d:3,e:5,f:8,g:13,h:21...
 What is bipartite graph? Is the subset of bipartite graph is C214.4 K4 N/D 2019 13
14 (a)
bipartite? Outline with example
OR
C214.4 K4 N/D 2019 13
Explain in detail about Maximum Flow Problem
(6)|
C214.5 K5 N/D 2019 13
15 (a) Elaborate how back tracking technique be
can

used to solve then-queens problem. Explain with

an example.

OR
Outline the steps to find approximate solution to NP-Hard
C214.5 K4 N/D 2019 13
(b)
optimization problems using approximation algorithms
with anexample.

CO BT Univ.QP Marks
Part C-(1x15-15 marks) level |Reference| Alloted
C213.3 K4 N/D 17 15
16. (a) Find a Hamiltonian Circuit or disprove its existence
in the graph given below

OR
and Bound C213.3 K2 ND 17 15
(b) Find the optimal solution using Branch
for the following assignment problem
Job1 Job 2 Job 3 Job 4

A9 2
B6 4 3
C5 8 8
D 7 6 4

o i6l

Bepcoed b