11) Stack is useful for implementing
a) recursion
b) breadth first search
c) depth first search
d) both (a) and (c)
12) The maximum degree of any vertex in a simple graph with n vertices is
a) n
b) n-1
c) n+1
d) 2n-1
13) Which f the following need not be a binary tree ?
a) Search tree
b) Heap
c) AVL-Tree
d) B-Tree
14) The process of accessing data stored in tape is similar to manipulating data on a
a) Stack
b) Set
c) List
d) Heap
15) Likned lists are not suitable for implementing
a) insertion sort
b) binary search
c) radix sort
d) polynomial manipulation
16) In the above Question the average access time will be
a) 268 unit
b) 256 units
c) 293 units
d) 210 unit
17) The smallest element of an array’s index is called its
a) Lower bound
b) Upper bound
c)Range
d) Extraction
18) Which of the following is not good for linked list?
a) Sorting
b) Queues
c) Binary reach
d) none of the above
19) ………… is called self referential structure
a) linked list
b) Stack
c) queue
d) graph
20) A complete binary tree of level 5 has how many nodes?
a) 15
b) 25
c) 63
d) 33