KEMBAR78
Data Structures July 2023 | PDF | Algorithms | Computer Programming
Scribd
Upload
2 views2 pages

Data Structures July 2023

This document outlines the examination structure for the Data Structures course for II B. Tech I Semester, including a total of 10 questions divided into five units. Each question carries equal marks, and students are required to answer one question from each unit within a 3-hour time frame.

Uploaded by

b2513621
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
2 views2 pages

Data Structures July 2023

This document outlines the examination structure for the Data Structures course for II B. Tech I Semester, including a total of 10 questions divided into five units. Each question carries equal marks, and students are required to answer one question from each unit within a 3-hour time frame.

Uploaded by

b2513621
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 No: R203105F R20 SET - 1

III
II B. Tech I Semester Supplementary Examinations, July -2023
-
DATA STRUCTURES
(Common to CE,ME,ECE)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****

UNIT-I
1. a) Explain
xplain the stack data structure with suitable example. Give algorithms for [7M]
Push, Pop operations
operations.
b) Write an algorithm to delete an element anywhere from double
doubl linked list. [7M]
(OR)
2. a) Explain the operations on single linked list.
list [7M]
b) What is a queue? Write an algorithm for implementing queue using linked list? [7M]
UNIT-II
3. a) Explain Linear search with an example [7M]
b) Explain selection sort algorithm? [7M]
(OR)
4. a) What is Hash function? What are the types of Hash functions? [7M]
b) Explain Insertion sort algorithm and trace the steps of insertion sort for sorting [7M]
the list- 17, 19, 33, 26, 29, 55, 22, 37, 03.
UNIT-III
5. a) What is a binary tree? Construct a binary tree with the following data: 50, 20, [7M]
70, 49, 71, 51, 99, 73, 101, 00, 75.
b) Explain the procedure for BST insertion with a suitable example. [7M]
(OR)
6. a) What is expression tree? What are its applications. [7M]
b) Explain insertion and deletion operation in Mintree. [7M]
UNIT-IV
7. a) Define AVL tree? Convert the following diagrams into Balanced AVL trees [7M]

b) Write an algorithm to perform insertion in B


B-trees
trees and explain it with an [7M]
example.
(OR)

1 of 2

|''|'||||''|'''|||'|
Code No: R203105F R20 SET - 1

8. a) Explain double rotations in AVL Trees. [7M]


b) Explain the procedure to delete 11,12,15 and 21 from the following B-tree
B of [7M]
order 5.

UNIT-V
9. a) What is red black tree, discuss its properties. [7M]
b) Explain deletion operation in scape goat trees with an example [7M]
(OR)
10. a) Explain about the array representation of priority queues with an example.
example [7M]
b) What are the operations of priority queue? [7M]

2 of 2

|''|'||||''|'''|||'|

You might also like