We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
Code No: 1SSEV R18
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B. Tech I Year I Semester Examinations, March - 2024
DESIGN AND ANALYSIS‘OF ALGORITHMS
(Computer Seience and Engineering ~ Artificial Intelligence and Machine Learning)
‘Time: 3 Hours Max. Marks: 75
Note: i) Question paper consists of Part A, Part-B,
ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks
and may have-a, [Link] questions,
PART~'A - ed
(25 Marks)
1a) What is Theta notation? (2)
b) Differentiate between Pseudocode and an algorithm. B)
c) _ What isthe importance of Sum of Subsets? : (2)
4) . Write the differences between Backtracking and recursion. 3]
e) What'is [Link]?. ’ (2)
4) What is the importance of Reliability desigh? [3]
) What is feasible solution? 2]
h) What are the advantages and disadvantages of Greedy method? [3]
i) What is the purpose of Branch and Bound? 2]
i) Write a non deterministic algorithm to search an element in an array. 3]
J% PART-B |
i “(50 Maris)
2.a) — Write an algorithm of Linear search and analyze the time complexity of the same,
b) Derive the time complexity of Quick sort in worst case, [5+5]
OR
3.a) ;Derive-the time complexity of Strassen’s-matrix multiplication,
b) Sort the following list of elements using Quick sort and:mention the output at each pass
and iteration A Nl : ee — [545]
30, 67, 23, 18, 55, 79, 80, 15, 12
4.4) Explain about Graph coloring with an example.
6) Write an algorithm of n-Queen’s problem and also analyze the time complexity of the
same. : , (5+5]
OR | 1
5.a) Explain the Disjoint/[Link].,.
b) Discuss the general method for backtracking, [545] ja)
b)
8.a)
b)
9.a)
b)
10.a)
b)
Construct the OBST of the following data: ;
n= 4 and (qi, qa, q3, 44) = (do, if, int, while). The values for p’s and q’s are given as
PC4)='G,3,1,1) and 404) = ,3,1/1,1). i oly ay, {10}
(7 }\ \_ JOR j .
Explain the all pairs shortest path problem with an example.
Write an algorithm of 0/1 Knapsack problem using Dynamic Programming. [S+5]
Write an algorithm of Kruskal’s minimum cost spanning tree.
Explain the Greedy Knapsack problem with an example, [5+5]
' :OR ;
‘Solve the Job Sequencing with deadline problem using greedy method for the given}
data N-=" 7, Profits ate-P= {3,5;20,[Link],30} and’ Deadlines D’= (°4;3,4,3,5, 52}
respectively.
Explain the applications of Greedy method, “<< [644]
Prove that CNF satisfiability o clique decision problem.
[Link] classes of NP- Hard and NP-Complete, on [5+5]
las eu G@uuallalon Tours bos
Draw the portionoftthe state space tree generated [Link] for the following:
knapsack instances: n=5, (Pi, P2, Ps, Ps, Ps) = (10, 15, 6, 8, 4)
(Wi, W2, W3, Ws, Ws) = (4, 6, 3, 4, 2) and m= 12 - [10]
--v0000---
