Download Original PDF
Get the official Barkatullah University print version scanned document.
đ¤ Help Your Juniors!
Have previous year question papers that aren't on our website? Help the next batch of students by sending them to us! With your consent, we will proudly feature your name as a Top Contributor on our platform.
Submit Papers đŠ
Roll No. .....................................
Total No. of Questions : 12
[Total No. of Printed Pages : 4
EY-312
B.Tech. IIIrd Semester (New Scheme)
Inform. Tech.
Examination, 2023-24
Data Structure
Paper - IT - 305
Time : 3 Hours
[Maximum Marks : 60
Note : - Attempt all questions.
I. Short answer type questions : (any five) 5×2=10
1.
What is a Multidimensional array?
2.
What is a doubly linked list?
3.
What are the operations that can be performed on a stack?
4.
List some applications of queue data structure.
5.
What is the merge sort? How does it work?
6.
What is an AVL tree?
7.
What is Kruskal's minimum Spanning tree algorithm?
II. Long answer type questions :- 5×10 = 50
1.
How can you perform the Selection sort and sort the following elements by using the selection sort technique
70, 30, 20, 50, 60, 10, 40.
70, 30, 20, 50, 60, 10, 40.
OR
How does Binary search work? Explain the algorithm of binary Searching.
2.
Explain Quick Sort with the help of Suitable example.
OR
Convert the following infix notation to postfix form:
A +(B * (D/E) * F)
A +(B * (D/E) * F)
3.
What do you mean by a hash table and hash function? Explain the following hash function with an example
(i) Division reminder method
(ii) Mid square method
(iii) Folding method
(i) Division reminder method
(ii) Mid square method
(iii) Folding method
OR
Explain circular queue. Also write the algorithm for Insertion of an element from the queue.
4.
The Inorder and preorder traversal of a tree are given below.
Inorder: D B M I N E A F C J G K
Preorder: A B D E I M N C F G J K
(i) Construct the corresponding Binary tree.
(ii) Determine the postorder traversal of the three drawn
Inorder: D B M I N E A F C J G K
Preorder: A B D E I M N C F G J K
(i) Construct the corresponding Binary tree.
(ii) Determine the postorder traversal of the three drawn
OR
Explain heap as a data structure. Build a Max-Heap by in-vesting the following data arriving as a Sequential set.
23, 7, 92, 6, 12, 14, 40, 44, 20, 21.
23, 7, 92, 6, 12, 14, 40, 44, 20, 21.
5.
What is a minimum Spanning tree? Give kruskal's algorithm to find a minimum spanning tree. Determine the minimum Span-ning tree of the following graph.
OR
What is Graph? Explain the BFS and DFS graph traversal and also differentiate between DFS and BFS graph traversal.