Scribd
Upload
7 views3 pages

Ada 2023

This document outlines the examination details for the Analysis and Design of Algorithms course for B.Tech. students, including the exam code, subject code, and structure. It specifies that students must attempt five questions, selecting one from each unit, with the first question being compulsory. The document also lists various topics and questions related to algorithms, data structures, and complexity analysis.

Uploaded by

186kalpana186
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views3 pages

Ada 2023

This document outlines the examination details for the Analysis and Design of Algorithms course for B.Tech. students, including the exam code, subject code, and structure. It specifies that students must attempt five questions, selecting one from each unit, with the first question being compulsory. The document also lists various topics and questions related to algorithms, data structures, and complexity analysis.

Uploaded by

186kalpana186
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Roll No.

Exam Code : M-23

Subject Code--13074
B.Tech. (CSE/IT) EXAMINATION
(Batch 2018 Onwards)
(Fourth Semester)
ANALYSIS AND DESIGN OF ALGORITHMS
PCC-CSE-208-T/PCC-IT-208-T

Time:3 Hours Maximum Marks:70

Note: Atempt Five questions in all, selecting one


question from each Unit. Q. No. 1 is
compulsory.

(Compulsory Question)
1. (a) What is an algorithm and what are the
criteria it must satisfy ? 2

(b) What is the significance of using


notations in analysis of algorithms ? 2

(3-26-3-0523) J-13074 P.T.0.


(c) What is chaining ? Explain. 3. (a) Give the proof that shows that the
(d) Discuss minimum spanning tree and the recurrence relation T(n) = mT(n/2) + an'
applications of minimum spanning tree. 2 is satisfied by T(n) = O(nlog my for
m> 4.
(e) Determine the order of magnitude of the 7

worst-case computing time for the (b) Write the algorithm for merging two
sorted subarrays using auxiliary storage.
backtracking procedure that finds all
Hamiltonian cycles. 2
() Use backtracking to show that there is Unit II
no solution for 3-queen problem. 2 4. (a) Write an algorithm to delete the element
(g) How NP-hard problems are different from in position iof a max heap sort. The
NP-complete ? 2 complexity of the algorithm should be
O (log ). 7
Unit I (b) What is red-black tree? Discuss the
deletion operation on red-black tree.
2. (a) What do you mean by analysis of
algorithms ? Discuss the analysis of 5. (a) Discuss the Kruskal's algorithm for
insertion sort algorithm. Also give its minimum spanning tree and explain the
running time of algorithm. 7
complexity. 7

(b) Explain recursive binary search algorithm (b) Discuss the algorithm to find single
source shortest path for directed acylic
using suitable exarmple. graphs using an example. 7

J-13074 3
2 (3-26-4-0523) J-13074 P.T.0.
9. (a) Prove that the Hamiltonian cycle problem
is NP-Complete. 7
Unit III
(b) Prove that Satisfiability of Boolean
6. (a) What is longest common subsequence formulas is NP-complete. 7
problem ? How dynamic programming
can be useful for longest common
subsequence problem ? 10
(b) Find an optimal parenthesization of a
matrix chain product whose sequences
of dimension are (5, 10, 3, 12, 5, 50, 6).
4

7. (a) What is graph coloring problem ? How


backtracking can be used to solve this
problem ?
(b) What is backtracking ? Design an
algorithm for 8-Queen's problem. 7

Unit IV
8. (a)
Discuss the travelling salesman problem
usng branch and bound method. 7
(b) Write a branch and bound algorithm for
the job
Use the sequenc cing with deadline problem.
fixed tuple size formulation. 7 (3-26-5-0523) J-13074
26
J-13074 4

You might also like