Data Structures and Algorithms 2019-Objective

Group A

Attempt all the questions. [10x1 = 10]

1.

i) What is the measurement for time complexity of an algorithm?

a) Counting microseconds    

b) Counting kilobytes of algorithms

c) Counting number of key operations

d) Counting number of statements

1.

ii) Which of the following is the result of evaluation of 5 7 4 - * 8 4 / +?

a) 5    b) 8    c) 10    d) 17

1.

iii) What is the recursive formula for post order traversal of binary tree?

a) Left-Root-Right    b) Root-Left-Right    c) Left-Right-Root    d) Right-Left-Root

1.

iv) What is the number of disk movement in TOH with 4 disks?

a) 9    b) 14    c) 17    d) 15

1.

v) What is the Big-Oh of best case complexity of insertion sort?

a) O (n)    b) O (nlogn)    c) O (1)    d) O (n²)

1.

vi) How does the rear index incremented in circular queue?

a) front=(rear+1)%SIZE    b) rear=(rear+1)%SIZE    c) rear=rear+1    d) rear=(rear-1)%SIZE

1.

vii) A variation of linked list in which none of the node contains NULL pointer is ……

a) Singly    b) Multiple    c) Circular    d) Doubly

1.

viii) Which of the following data structure is used in depth first search of graph?

a) Stack    b) Queue    c) Linked List    d) None of the above

1.

ix) Which of the following is true for B-Tree of order M?

a) Leaf nodes should be at different level

b) All the key values within a node must be in descending order

c) Every node has at least M children

d) All non-leaf nodes with M-1 keys must have M number of children

1.

x) Which of the following is not a hash function?

a) Division remainder    b) Folding    c) Chaining    d) Mid square