Scribd
Upload
5 views2 pages

B.Tech Theory

Uploaded by

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

B.Tech Theory

Uploaded by

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

Course Code: R231107 FE HTNO

VIGNAN’S LARA INSTITUTE OF TECHNOLOGY & SCIENCE


(Autonomous)
II B.Tech I Semester Regular Examinations, NOVEMBER 2024
ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS
(COMMON TO CSE, AIML, CSE-AIML, DS, CAI BRANCHES)
Time: 3 Hrs Max. Marks: 70

Answer All the Questions


Part-A
Short Answer Questions
10x2=20 Marks
Q. No. Question Marks BL CO PO
1 a What is B-tree? 2 I I I
b What are the applications of AVL trees? 2 I I I
c How do you delete an element from heap? 2 I II I
d Define algorithm. 2 I II II
e What is knapsack problem? 2 I III II
f What is spanning tree? 2 I III I
g Explain the general method of branch and bound 2 II IV II
h Define backtracking stratagy 2 I IV II
i Define NP-Complete 2 I V II
j what is class P and NP? 2 I V I
Part-B
Long Answer Questions
5x10=50 Marks
Q. No. Question Marks BL CO PO
2 a Explain the principles of Object Oriented Programming. 5 II I I
b How do you declare a pointer in C++? Provide syntax 5
I I I
examples for different data types.
OR
3 a What is an AVL tree? How do we define the height of it? 5 I I I
Discuss about the balance factor associated with a node of
an AVL tree
b Explain the rotations of AVL Tree with an example 5 I I I

4 a What are the Data structures using by DFS and BFS? 5 I II II


b What are the applications of Heap Trees? 5 I II II
OR
5 a Write a short notes on heap trees and explain the insertion 5
I II I
and deletion process with an example
b What are the operations and applications of heap trees 5 I II I

6 a Write a greedy algorithm for sequencing unit time jobs 5


I III II
with deadlines and profits
b Explain the working principle of Kruskal’s algorithm 5 II III I
OR
7 a Explain single source shortest path problem(Bellman Ford 5 III
Algorithm) using Dynamic programming. I II

b Write and explain an algorithm to compute the all 5 III


I II
pairs shortest path using dynamic programming.
Page 1 of 2
8 a Explain 4-Queen’s problem 5 I IV III
b Explain about Graph coloring in detail. 5 I IV I
OR
9 a Explain in detail about backtracking 5 I IV III
b Give backtracking solution to sum of subsets problem 5 I IV I

10 a Explain the features of non deterministic algorithms. 5 I V III


b Briefly explain about NP-hard and NP-complete problems 5 V
I I
with example.
OR
11 a Explain the classes of P , NP and NP-Complete 5 V
II I
giving example problem for each.
b Explain about Scheduling identical processors. 5 II V II
*****

Page 2 of 2

You might also like