iare.ac.in B.Tech Data Structures Previous Question Papers : Institute Of Aeronautical Engineering
Name of the Organisation : Institute Of Aeronautical Engineering
Exam : B.Tech I Semester End Examinations
Category : Common for CSE/IT/ECE/EEE
Subject : Data Structures
Document Type : Previous Question Papers
Website : https://www.iare.ac.in/?q=node/2222
Download Previous/ Old Question Papers :
May 2017 : https://www.pdfquestion.in/uploads/26083-DATAmay.pdf
Jul 2017 : https://www.pdfquestion.in/uploads/26083-DATAjul.0.pdf
IARE B.Tech Data Structures Previous Question Papers
B.Tech II Semester End Examinations (Regular) – May, 2017
Regulation: IARE – R16
Common for CSE/IT/ECE/EEE
Related / Similar Question Paper : IARE B.Tech Modern Physics Question Paper
Time: 3 Hours
Max Marks: 70
Instruction
** Answer ONE Question from each Unit
** All Questions Carry Equal Marks
** All parts of the question must be answered in one place only
UNIT – I
1. (a) Explain the method to calculate the address of an element in an array. A 254 matrix array DATA is stored in memory in ‘row-major order’. If base address is 200 and 4 ! = words per memory cell. Calculate the address of DATA [12, 3] . [6M]
(b) Bubble sort algorithm is inefficient because it continues execution even after an array is sorted by performing unnecessary comparisons. Therefore, the number of comparisons in the best and worst cases are the same. Modify the algorithm in such a fashion that it will not make the next pass when the array is already sorted. [8M]
2. (a) Describe insertion sort and its time complexity. [7M]
(b) What are the characteristics of a good algorithm? What is the relation between the time and
space complexities of an algorithm? [7M]
UNIT – II
3. (a) Explain how to implement two stacks in one array A[1..n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. The PUSH and POP operations should run in O(1) time. [7M]
(b) Suppose a queue is maintained by a circular array QUEUE with N = 12 memory cells. Find the number of elements in QUEUE if [7M]
i. Front = 4, Rear =8.
ii. Front = 10, Rear = 3.
iii. Front = 5, Rear = 6 and then two elements are deleted.
4. (a) Using stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not. [7M]
(b) Define double ended queue and its types and give its applications in real time scenario. [7M]
UNIT – III
5. (a) Two linked lists contain information of the same type in ascending order. Write a module to merge them to a single linked list that is sorted. [9M]
(b) Write an algorithm to count number of nodes in the circular linked list. [5M]
6. (a) Write an algorithm and show diagrammatic representation to insert an element k in double linked list at [7M]
i. Start of linked list
ii. After a given position P of list
iii. End of linked list.
(b) Write an algorithm that will split a circularly linked list into two circularly linked lists. [7M]
UNIT – IV
7. (a) Consider the following undirected graph and answer the following questions. [8M]
Assume that the edges are ordered alphabetically (i.e. when facing with alternatives, choose the edges in alphabetical order)
i. List the nodes (cities) of the graph by depth first search starting from Varanasi.
ii. List the nodes (cities) of the graph by breadth first search starting from Calcutta.
(b) What are priority Queues? How can priority queues be implemented? Explain in brief. [6M]
8. (a) Describe Kruskal’s algorithm to find minimum spanning trees. Apply Kruskal’s algorithm from node a for the below figure 2. [7M]
(b) What is a binary tree? Write an algorithm for the preorder traversal of a binary tree using stacks. [7M]
UNIT – V
9. (a) What do you mean by hash clash? Explain in detail any one method to resolve hash collisions. [5M]
(b) What is a height balanced tree? Explain how the height is balanced after addition/deletion of nodes in it? [9M]
10. (a) Define hashing. Describe any two commonly used hash functions. Describe one method of collision resolution. [7M]
(b) Draw a B-tree of order 3 for the following sequence of keys: [7M] 2, 4, 9, 8, 7, 6, 3, 1, 5, 10