MODULE-1-DATA STRUCTURES

The essential condition which is checked before insertion in a linked queue is?

• A. Underflow
• B. Overflow
• C. Front value
• D. Rear value

Consider the following rooted tree with the vertex labelled P as the root.

• SQPTRWU
• SQPTUWR
• SQPTWUR
• SQPTRUW

Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28. How many heapify operations have been performed on root of heap?

• A. 1
• B. 2
• C. 3 or 4
• D. 5 or 6

What is the number of edges present in a complete graph having n vertices?

• A. (n*(n+1))/2
• B. (n*(n-1))/2
• C. n
• D. Information given is insufficient

If several elements are competing for the same bucket in the hash table, what is it called?

• A. Diffusion
• B. Replication
• C. Collision
• D. Duplication

Given input array elements are 8,9,2,6,1. What will be output after third pass of insertion sort?

• A. 1,2,6,8,9
• B. 2,6,8,9,1
• C. 2,8,9,6,1
• D. 2,6,8,1,9

Write post order traversal result of the given tree

• 1 2 4 5 3
• 4 2 5 1 3
• 4 5 2 3 1
• 1 2 3 4 5

A binary search tree whose left and right subtree differ in height by at most one 1 is called

• A. Red Black tee
• B. AVL Tree
• C. Binary search tree
• D. None of the above

The data structure used to implement Breadth first search of graph is

• A. Stack
• B. Queue
• C. Tree
• D. Graph

Which of the following is the prefix form of A+B*C?

• A. A+(BC*)
• B. +AB*C
• C. ABC+*
• D. +A*BC