Signature of the invigilator S.V.

ENGINEERING COLLEGE FOR WOMEN Marks Obtained

Karakambadi Road, Tirupati – 517507

II B.Tech I Semester II Midterm (Objective) Examinations November-2016
Branch: EEE-A
Subject: DATA STRUCTURES
Time : 20 Minutes.
Max. Marks: 10 H.T.No:

-------------------------------------------------------------------------------------------------------------------------------------------
CHOOSE THE CORRECT ANSWER ½ x 10 = 5 M
1 In a linked representation of a binary tree, if there are n number of nodes then the number of [ ]
null links are __________
A)n+1 B)n C)n-1 D)None of these
2 Which traversal of tree visit root , left subtree, then finally right subtree [ ]
A)Inorder B)Preorder C)Postorder D)Levelorder
3 In a red black tree if a node is colored with red color then child can color with [ ]
A)Black B)Red C)Green D)Null
4 The possible number of pointers and key values in a m-way search tree are respectively [ ]
A)m,m-1 B)m-1,m C)m&m+1 D)m-1,m-1
5 The sorting technique which is purely based on pivot node classification [ ]
A) Shell Sort B) Heap Sort C)Quick Sort D)Insertion Sort
6 No of merge files required in balance two-way merge sort: [ ]
A) 4 B)2 C)3 D)1
7 No of comparisons needed in straight selection sort for an unsorted list [ ]
A) (3*(n-1))/2 B) (3*(n-1))/n C) (3*(n-1)2)/n D)n(n-1)/2
8 The hashing technique purely works on classification of memory into buckets. [ ]
A)Linear Hashing B)Pseudo Random Hashing C) Rotation hashing D) None of these
9 The time complexity for binary search is [ ]
A)O(n) B)O(log n) C)O(n2) D)O(n/2)
10 Apply modulo division method for the key value 78 of list size 4 and address is: [ ]
A)2 B) 10 C)0 D)9
FILL IN THE BLANKS ½x5=2½M

11.________________________rotation has to perform if unbalance occurs due to insertion in to left sub-tree of

left child of pivot node.
12.Balancing Factor of a node can be calculate using formula_________________________
13.
5
1 2
5 Apply DFS traversal for the graph_____________________
7 3
14. Quick Sort mainly follows ____________________________ strategy.
15. In ___________ search the value to be search is added as last element to the given input list.

State TRUE or FALSE ½x5=2½M

16. BSF is a tree traversal. [ ]

17. The given array represents binary search tree 10 5 14 3 6 12 16 [ ]

18. Heap sort mainly depends on Heap ADT. [ ]

19. Topological sorting can be applied to Cyclic graphs. [ ]
20. In linear probe we search the locations randomly to store key value. [ ]
 S.V. ENGINEERING COLLEGE FOR WOMEN
Karakambadi Road, Tirupati - 517507
II B.Tech I Semester II Midterm Examinations (Descriptive), November -2016
Branch: EEE-A
Sub: DATA STRUCTURES
Time : 90 Minutes. Max. Marks: 30
Answer any three questions 3 X 10 = 30 M
1. (a) Define Binary search tree and heap tree with examples. 5M
(b) Define Height balanced trees with any one rotation. 5M
2. (a) Given In-order traversal is HDIBEAFCG and Pre-order traversal is ABDHIECFG 5M
construct a binary tree with neat explanation?
(b) Explain Shell sort with example. 5M
3 What is Red-black tree? Perform deletion operation for the case node having two children 10M
with neat explanation.
4. Explain the following searches with suitable examples with algorithm 10M
(i) Probability search (ii) Binary search
5. (a) Explain the following hashed list search with example 5M
(i)Rotation method (ii) Pseudo random hashing
(b) Explain bucket hashing with example 5M

S.V. ENGINEERING COLLEGE FOR WOMEN

Karakambadi Road, Tirupati - 517507
II B.Tech I Semester II Midterm Examinations (Descriptive), November -2016
Branch: EEE-A
Sub: DATA STRUCTURES

Time : 90 Minutes. Max. Marks: 30

Answer any three questions 3 X 10 = 30 M
1. (a) Define Binary search tree and heap tree with examples. 5M
(b) Define Height balanced trees with any one rotation. 5M
2. (b) Given In-order traversal is HDIBEAFCG and Pre-order traversal is ABDHIECFG 5M
construct a binary tree with neat explanation?
(b) Explain Shell sort with example. 5M
3 What is Red-black tree? Perform deletion operation for the case node having two children 10M
with neat explanation.
4. Explain the following searches with suitable examples with algorithm 10M
(ii) Probability search (ii) Binary search
5. (a) Explain the following hashed list search with example 5M
(i)Rotation method (ii) Pseudo random hashing
(b) Explain bucket hashing with example 5M