Data Structure
Jump to paper
2018051403
B.Tech Examination, 2018
Instructions
- The marks are indicated in the right-hand margin.
- There are NINE questions in this paper.
- Attempt FIVE questions in all.
- Question No. 1 is compulsory.
Questions
Ask AI
Q1
Answer the following:
a)2 marksDefine data structure.
b)2 marksWhat are average, best and worst case complexities?
c)2 marksWrite formula to calculate address of elements in two-dimensional array.
d)2 marksWhat is deque? Explain with example.
e)2 marksDefine tail recursion.
f)2 marksWhat is the need for linked representation of lists?
g)2 marksGive node structure for the term of polynomial having single variable.
h)2 marksWhat is the maximum number of nodes in a binary tree of depth ?
i)2 marksWhat is threaded binary tree?
j)2 marksWhat is worst case time complexity of quick sort?
Ask AI
Q2
Answer the following:
a)14 marksFormulate an algorithm to find the number of total nodes in a binary tree. What is the complexity of your algorithm?
Ask AI
Q3
Answer the following:
a)14 marksWhat is Tower of Hanoi problem? Draw the recursive tree diagram for the solution of Tower of Hanoi problem, where the number of disks is 4 and number of pegs is 3.
Ask AI
Q4
Answer the following:
a)14 marksExplain the following operations on a binary search tree with suitable algorithms:
Ask AI
Q5
Answer the following:
a)14 marksExplain the following operations with pseudo-code in a doubly circular linked list:
Ask AI
Q6
Answer the following:
a)14 marksThe odd-even transposition sort proceeds as follows : Pass through the file several times. On the first pass, compare x[i] with x[i+1] for all odd i. On the second pass, compare x[i] with x[i+1] for all even i. Each time that x[i] > x[i+1], interchange the two. Continue altering in this fashion until the file is sorted.
Ask AI
Q7
Answer the following:
a)14 marksConstruct an inorder threaded binary tree (TBT) for the given tree. Illustrate its node structure. Also show the memory representation of a complete TBT for this :
Ask AI
Q8
Answer the following:
a)14 marksDefine AVL tree. Construct an AVL tree for the following elements : 3, 5, 11, 8, 4, 1, 12, 7, 2, 6, 10
Ask AI
Q9
Answer the following:
a)14 marksProve the correctness of Kruskal's algorithm for minimum spanning tree. Draw minimum cost spanning tree for the graph given below and also find its cost :
Ask AI