Hemat Sou

Course Name: BTech (CSE)

Course Outcome
of Big Oh, Theta and Omega
CO1: Understanding of complexity represcntalion in terms
notations.
of Sorting and Divide-and
CO2: Derive and solve recurrences describing the performance
Conquer algorithms. structures such as RB Tree, B Tree,
CO3: Compare and analyze different advancc data
Binomial Hcaps, Fibonacci Heaps.
CO4: Explain the major graph algorithms and their analyses. Employ graphs to model
various problems, whcn appropriate and their analysis.analyze when an algorithmic design
COS: Understand thc greedy paradigm and ahle to
situation calls for it. Synthesize grecdy algorithms them.
CO6: Synthesize dynamic-programming algorithms and analyze and able to analysis
CO7: Understand the backtracking and branch & bound paradigm
when an algorithmic designsituation calls for it. NP, NP-complete, NP-Hard.
CO8: Understand the Complexiy Theory with P,

Printed Pages: 5 University Roll No..21S000463

END Term Examination, Odd Semester 2023-24
B.Tech. (CSE), III Year, V Semester
BCSC1012:Design and Analysis of Algorithms
Maximum Marks: 50
Time: 3 Hours
Section -A
4 X5 = 20 Marks
Attempt Al Questions
Marks CO BLKL
No. Detail of Question
a) Consider a situation where swap operation is
very costly. Which of the following sorting
algorithms should be preferred so that the in
number of swap operations are minimized
general? Justify your answer.
1.5+2.5 CO2 C
(i) Quick Sort
(i) Selection Sort
(ii) Insertion Sort
(iv) Merge Sort

KB) Write an algorithm of Quick Sort.

LaVrite and explain the merge sort algorithm 2.5+1.5 CO2 U C
2 using the divide and conquer strategy.
Derive the complexity of merge sort algorithm
 (Do not jast statc the result, but explain how to
calculate he complexity)
Solve the following recurrence cquations:
a) T(n) =4 T(n/4) +nlogn CO1 A P
n=0
b) T(n) -T(n- 1)+n n>0
Explain Branch and bound technique.
State Travelling Salesman Problem (TSP).
Explain the basic steps that are to be followed to
solve TSP using branch and bound with the
following graph.

1+1+
4
2
CO7 A P
20
10 15

25 30

35

You are the mission planner for a space

expedition to a distant planet. The spacecraft has
limited cargo capacity, and you need to decide
what scientific instruments to bring for analysis
on the planet's surface. Each instrument has a
weight and a scientific value, and your goal is to
maximize the total scientific value while staying
within the spacecraft's weight limit.
5
|Scientific 2+2 CO6 A
Weight Value
Instruments
Instrument 1 3 kg 12
Instrument 2 2 kg 8
Instrument 3 5 kg 20
|Instrument 3 1kg
Maximum weight capacity:8kg
a) Write an algorithm to determine the optimal
 selection of scientific instruments to
maximize the total scientific valuc within the
given weight capacity.
b) Apply the algorithm and compute the total
scientific value.

Section -B
3X5 = 15 Marks
Attempt Al Questions
No. Detail of Question Marks CO BL KL
Write the total number of spanring trees
a)
possible for acomplete graph with 6vertices. 1+2 COS U C
b) Write thrce differences between Prim's and
Kruskal's algorithm
Give the job sequencing algorithm with
deadlines. You have given 5jobs with profit pi
and deadline di as
job i- {1, 2,3,4, 5} -
7 pi= {20 0, 5,15, 1} - 3 COS A P

|di= {2, 1, 3,2, 3

executed in
Find the optimal job lists that can bemaximize the
sequence with their deadlines so to
profits.
Discuss the backtracking approach. and
Also, discuss the sum of the subset problem 1+2 CO7 A P
instance
create a state-space-tree for the given show
n-4, m=25, W (1:4) = (3, 10, 12, 13) and
the solutions.
P, class
What types of problems are called class 1.5+1.5 COs U
9NP andclass NP-complete?
Differentiate between P and NP class problems.
on
You are a bioinformatics researcher working
comparing DNA sequences for genetic analysis.
Check how these two DNA sequences are
closely related to each other. 3 CO6 A P
10
Each DNAstrand is represented as a sequence of
nucleotides (A, C, G, T).
DNA Strands:
 Strand A: AGGTACG
Strand B: GÇTAGT

Section -C
Atempt AllQuestions 5X3 =15 Marks
No. Detail of Question Marks Co BLKL
a) List and explain the characteristic properties
associated with a problem that can be solved
using dynamic programming.
b)Compare Divide & Conquer and Dynamic
programming design paradigm.
c) Obtain all pair shortest path using Floyd's
Algorithm for the given weighted gaph.
7 1+
11 1.5+ CO6 A
2.5

10 4
3

a) Write the dijkstra's algorithm for a single

source shortest path in a weighted connected
graph. 2+
12
b) Derive the complexity of dijkstra's algorithm 1.5+ C06| E C
(Do not just state the result, but explain what 1.5
each loop/step contributes)
c) Find he shortest path from the node S to
other nodes in the following graph:
 a

12
14/
16
13

You are responsible for setting up a network

infrastructure for a new office building. Each
room in the building is a node, and the cost of
laying network cables between rooms is given as
the weight of the edges. Your goal is to establish
areliable network with the minimum total cost.
Consider the following undirected graph
representing the toomis and the cost of laying
network cables:

a) Write an algorithm to solve the above problem.

|b) Apply the algorithm on the graph given below 2+
13 and compute the total cost in setting up the 2+ CO4 A P
network infrastructure. 1
c) What is the complexity of the algorithm?