Q 1.

Queue data structure can be used for

Epression Parsing Resource Allocation Recursion All of the Above

Q 2.

What is the prefix notation of (a + b) * (c + d)?

* + a b + c d * + + a b c d + * a b + c d + a b * c + d

Q 3.

What is the output when a binary search tree is traversed in order?

Sorted List The Reverse of Input Unsorted List None of the above

Q 4.

An example of linear data structure is

Graphs Trees Arrays All of the Above

Q 5.

An example of a Non-linear data structure is

Linked Lists Trees and Graph Arrays All of the Above

Q 6.

The data structure is used for breadth-first traversal of a graph?

queue stack list None of the above

Q 7.

The data structure is used for depth-first traversal of a graph?

queue stack list None of the above

Q 8.

Hash list is generalization of __________ .

Heap Hash list Hash list BST

Q 9.

________data structure is preferred to have lesser search time when the list size is small?

self-organizing list search tree linked list sorted list

Q 10.

The pop() and push() functions are found in

queues stacks trees lists

Q 11.

An abstract data type is

Linear collection of data elements Representation of data structure in memory Allocation of data structure in memory None of the above

Q 12.

Lempel – Ziv – Welch’s algorithm of data compression is used as a

Tango tree prefix tree suffix tree Top tree

Q 13.

In digital currency which tree is used

Rope tree Hash tree Both A and B none

Q 14.

What is the time complexity of Depth First Traversal

Θ(|V|+|E|) Θ(|V|*|E|) Θ(|E|) Θ(|V|)

Q 15.

The load factor for separate chaining hashing is

0.5 1 0.1 1.5

Q 16.

Which matrix has most of the elements as Zero?

Zero Matrix Identity Matrix Sparse Matrix Unit Matrix

Q 17.

Fast implementation of a set of string operation is allowed by

TangoTree Top Tree Rope Tree Generalized Suffix Tree

Q 18.

In Java the growth factor of ArrayList is

0.5 1 1.5 2

Q 19.

The number of ways by which ways we can reach the end of the array arr[]={1,3,5,8,9}?

1 2 3 4

Q 20.

Arrays are ________ data structures.

Linear Indexed Linked None of the above