Hall Ticket No Question Paper Code: ACS002
INSTITUTE OF AERONAUTICAL ENGINEERING
(Autonomous)
Four Year B.Tech I Semester Supplementary Examinations July, 2018
Regulation: IARE R16
DATA STRUCTURES
Time: 3 Hours (Common to CSE IT ECE EEE) Max Marks: 70
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. Write an algorithm for finding solution to the Tower's of Hanoi problem. Explain the working of
your algorithm (with 4 disks) with diagrams.
What is an algorithm? How do you find the complexity of an algorithm?
2. Compare and contrast sorting techniques of Insertion Sort, Heap Sort, Merge Sort and Quick
Sort with respect to memory space and computing time.
Execute quick sort algorithm on the following data till two key values are placed in their position

UNIT II
3. Devise a representation for a list where insertions and deletions can be made at either end. Such
a structure is called Deque (Double ended queue). Write functions for inserting and deleting at
either end.
What is the difference between circular queue and linear queue. Write a function to insert an
element in to a circular queue
4. What are circular queues? Write down routines for inserting and deleting elements from a circular
queue implemented using arrays.
Illustrate the steps for converting an infix expression into a postfix expression for the following
expression
UNIT III
5. Write a function to reverse the links in a linked list such that the last node becomes the first and
the first becomes the last by traversing the linked list only once.
Consider a linked list to store a polynomial, that is, every node of the linked list has coefficient,
exponent and pointer to the next node in the list.
Define a structure for node of such a list. (ii)Write a function to subtract two such polynomials.
The function should accept pointers to the two polynomials as arguments and return the pointer
to the resultant polynomial. Assume that the polynomials passed to the function are in decreasing
order on the exponents.
Page 1 of 3
6. Define a sparse metrics. Explain the representation of a 4X4 matrix using linked list.
Write a procedure to reverse a singly linked list with an example.
UNIT IV
7. What are priority Queues? How can priority queues be implemented? Explain in brief.
Consider the following undirected graph shown in Figure 1 and answer the following questions.
Assume that the edges are ordered alphabetically (i.e. when facing with alternatives, choose the
edges in alphabetical order)
List the nodes (cities) of the graph by depth first search starting from Varanasi.
List the nodes (cities) of the graph by breadth first search starting from Calcutta.
Figure 1
8. Differentiate BFS and DFS.
Show the result of running Bredth First Search and Depth First Search on the directed graph
shown in Figure 2 given below using vertex 3 as source. Show the status of the data structure
used at each stage.
Figure 2
Page 2 of 3
UNIT V
9. How many AVL trees of 7 nodes with keys 7 are there? Explain your answer.[7M]
The following values are to be stored in a hash table 25, 42, 96, 101, 102, 162, 197, 201 Use
division method of hashing with a table size of 11. Use sequential method of resolving collision.
Give the contents of array.
10. Explain Hash Tables, Hash function and Hashing Techniques?
What are B-trees? Construct a B-Tree of order 3 for the following set of Input data: 69, 19, 43,
16, 25, 40, 132, 100, 145, 15, 18
Page 3 of 3