Scribd
Upload
9 views2 pages

17D58101 Advanced Data Structures and Algorithms

This document outlines the syllabus and examination structure for the M.Tech I Semester Supplementary Examinations in Advanced Data Structures & Algorithms. It includes various topics such as linked lists, tree structures, sorting algorithms, and graph theory, with specific questions and marks allocated for each section. The exam is scheduled for July 2024 and consists of multiple choice and descriptive questions.

Uploaded by

hod.ce
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
9 views2 pages

17D58101 Advanced Data Structures and Algorithms

This document outlines the syllabus and examination structure for the M.Tech I Semester Supplementary Examinations in Advanced Data Structures & Algorithms. It includes various topics such as linked lists, tree structures, sorting algorithms, and graph theory, with specific questions and marks allocated for each section. The exam is scheduled for July 2024 and consists of multiple choice and descriptive questions.

Uploaded by

hod.ce
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/ 2

Code: 17D58101

M.Tech I Semester Supplementary Examinations July 2024


ADVANCED DATA STRUCTURES & ALGORITHMS
(Common to CN, CSE, CS & AIML)

Time: 3 hours Max. Marks: 60


Answer all the questions
*****
1 (a) Specify the difference between singly, doubly, and circular linked lists. 6M
(b) Explain how to implement insert and traverse operations in a circular linked list. 6M
OR
2 (a) Prove that 𝑓 𝑛 = 𝑂(𝑕 𝑛 ) where 𝑓 𝑛 = 𝑂(𝑔 𝑛 ) and 𝑔 𝑛 = 𝑂(𝑕 𝑛 ). 4M
(b) Write the non-recursive algorithm for finding the Fibonacci sequence and derive its time 8M
complexity.

3 (a) Explain about Breadth First Search Traversal technique with an example. 6M
(b) Analyze the differences between threaded trees and normal binary trees. 6M
OR
4 (a) Describe LL & RR rotations and explain a balance factor in the AVL tree. 6M
(b) Explain the operations of B-Tree with an example. 6M

5 (a) Evaluate the features of the Red Black Tree with an example. 6M
(b) Consider the following splay tree: 6M

Perform a delete operation for the key 3 under the assumption that this is a bottom-up splay
tree and show each step.
OR
6 (a) What do you mean by collision and how can you handle it by using linear probing? 6M
(b) Write the differences between sequential files and indexed sequential files. 6M

7 (a) Describe in detail Strassen's Matrix Multiplication algorithm based on divide and conquer 6M
strategies.
(b) Illustrate the operation of merge sort on the following array. 6M
𝐴 = 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9
OR

Contd. in Page 2

Page 1 of 2
Code: 17D58101

8 (a) Apply the Branch and Bound algorithm to solve the TSP for the following cost matrix. 10M

(b) State the principle of backtracking. 2M

9 (a) Find the minimum cost path from s to t in the multistage graph of the five stages shown 10M
below first using the forward approach.

(b) Define the state-space tree. 2M


OR
10 (a) Discuss the TSP for the given graph and obtain an optimum cost tour. 10M

(b) Write the time complexity of the traveling salesperson problem. 2M

*****

Page 2 of 2

You might also like