Scribd
Upload
38 views2 pages

Malla Reddy College of Engineering & Technology: M.Tech I Year I Semester Supplementary Examinations, August 2023

This document is an examination paper for the M.Tech I Year I Semester in Advanced Data Structures at Malla Reddy College of Engineering & Technology, conducted in August 2023. It consists of two parts: Part A, which includes 10 compulsory questions, and Part B, which has five sections with various topics related to data structures, algorithms, and their applications. Each question in Part B carries 10 marks, and students must choose one question from each section.

Uploaded by

KeerthiVardhani
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
38 views2 pages

Malla Reddy College of Engineering & Technology: M.Tech I Year I Semester Supplementary Examinations, August 2023

This document is an examination paper for the M.Tech I Year I Semester in Advanced Data Structures at Malla Reddy College of Engineering & Technology, conducted in August 2023. It consists of two parts: Part A, which includes 10 compulsory questions, and Part B, which has five sections with various topics related to data structures, algorithms, and their applications. Each question in Part B carries 10 marks, and students must choose one question from each section.

Uploaded by

KeerthiVardhani
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

R22

R22
Code No: R22D5802
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
M.Tech I Year I Semester Supplementary Examinations, August 2023
Advanced Data Structures
(CSE)
Roll No

Time: 3 hours Max. Marks: 60


Note: This question paper contains two parts A and B
Part A is compulsory which carries 10 marks and Answer all questions.
Part B Consists of 5 SECTIONS (One SECTION for each UNIT). Answer FIVE Questions,
Choosing ONE Question from each SECTION and each Question carries 10 marks.
***.
PART-A (10 MARKS)
(Write all answers of this PART at one place)
1 A What is Sparse matrix and give an example [1M]
B What is time complexity and space complexity [1M]
C What is Vector classes [1M]
D What is iterators? [1M]
E Define sorting. [1M]
F Compare Linear and binary search methods. [1M]
G Define Binary tree ADT [1M]
H Write the Properties of Binary trees [1M]
I What is B-Trees and give an example. [1M]
J Define Binary search tree and give an example. [1M]
PART-B( 50 MARKS)
SECTION-I
2 A Describe about doubly linked listsinsertion, deletion operations with [5M]
example.
B Explain about singly linked lists -insertion, deletion and search [5M]
operations with example.
OR
3 A Discuss about Linear List ADT, Array representation, Linked [5M]
representation and Vector representation.
B Explain Asymptotic Notation with example. [5M]
SECTION-II
4 A Write a short note on insertion into a Max Heap and deletion from a [5M]
Max Heap,.
B Differentiate Dequeue ADT and Priority queue ADT. [5M]
OR
5 A Discuss about Circular queue-insertion and deletion operation. [5M]
B Illustrate infix to postfix conversion using stack. [5M]
SECTION-III
6 A Write a short note Bubble sort, Insertion sort and Quick sort. [5M]
Page 1 of 2
B Interpret about Hashing-Hash functions and Collision Resolution [5M]
methods.
OR
7 A Discuss about Merge sort and Heap sort [5M]
B Analyse about Open Addressing, Chaining and Hashing in java.util- [5M]
HashMap
SECTION-IV
8 A Write about Dijkstra’s algorithm for Single Source Shortest Path [5M]
Problem.
B Explain Threaded binary trees with illustration. [5M]
OR
9 A Explain Minimum cost spanning tree using Kruskal’s algorithm. [5M]
B Explain various traversals of tree. [5M]
SECTION-V
10 A Explain KMP algorithm with example. [5M]
B Explain about Text compression-Huffman coding and decoding. [5M]
OR
11 A Analyse about Red Black trees with illustration. [5M]
B Describe AVL trees with illustration. [5M]
*****

Page 2 of 2

You might also like