Simple Quiz on Data Structure

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

1. Which of the following is not the part of ADTdescription? *

5 points

Data

Operations

Both of the above

None of the above

2. A binary search tree whose left subtree and rightsubtree differ in hight by at most 1 unit is called …… *

5 points

AVL tree

Red-black tree

Lemma tree

None of the above

3. ………. Is a pile in which items are added at one end and removed from the other. *

5 points

Stack

Queue

List

None of the above

4. ………… is very useful in situation when data have to stored and then retrieved in reverse order. *

5 points

Stack

Queue

List

Link list

5. Which of the following is non-liner data structure? *

5 points

Stacks

List

Strings

Trees

6. Which data structure is used in breadth first search of a graph to hold nodes? *

5 points

Stack

queue

Tree

Array

7. Which data structure is used in depth first search of a graph to hold nodes? *

5 points

Stack

queue

Tree

Array

8. To represent hierarchical relationship between elements, Which data structure is suitable? *

5 points

Dequeue

Priority

Tree

Graph

9. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex. *

5 points

Depth First

Breadth First

With First

Depth Limited

10. Which of the following is not the internal sort? *

5 points

Insertion Sort

Bubble Sort

Merge Sort

Heap Sort

11. A graph is said to be……… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. *

5 points

Partite

Bipartite

Rooted

Bisects

12. In a circular queue the value of r will be .. *

5 points

r=r+1

r=(r+1)% [QUEUE_SIZE – 1]

r=(r+1)% QUEUE_SIZE

r=(r-1)% QUEUE_SIZE

13. There is an extra element at the head of the list called a ……… *

5 points

Antinel

Sentinel

List header

List head

14. A …………… is an a cyclic digraph, which has only one node with in-degree 0, and other nodes have in-degree 1. *

5 points

Directed tree

Undirected tree

Dis-joint tree

Direction oriented tree

15. The way in which the data item or items are logically related defines ….. *

5 points

storage structure

data structure

data relationship

data operation

16. Which of the following data structures are indexed structures? *

5 points

Linear arrays

Linked lists

Graphs

Trees

17. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as .. *

5 points

Singly Linked List

Circular Linked List

Doubly Linked List

Linear Linked List

18. In a priority queue, insertion and deletion takes place at …… *

5 points

front, rear end

only at rear end

only at front end

any position

19. The time complexity of quick sort is … *

5 points

O(n)

O(n2)

O(n log n)

O( log n)

20. Which of the following is an application of stack? *

5 points

finding factorial

tower of Hanoi

infix to postfix conversion

all of the above

Submit

Clear form

Forms

This content is neither created nor endorsed by Google.