Question # 1

Which of the following is a non linear data structure?

Choose an answer

Linked List

Stack

Tree

Queue

Which of the following statement is true about dummy node of threaded binary tree

Choose an answer

The left pointer of dummy node points to the itself while the right pointer points to the root of tree.

The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummy node

The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL

The right pointer of dummy node points to the itself while the left pointer is always NULL

Which of the following statement is true about find(x) operation :

Choose an answer

A find(x) on element x is performed by returning exactly the same node that is found.

A find(x) on element x is performed by returning the root of the tree containing x.

A find(x) on element x is performed by returning TRUE.

A find(x) on element x is performed by returning the whole tree itself containing x

A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?

Choose an answer

Arrays

LinkLists

Binary Search Trees

All of the given options

Which one of the following is valid postfix expression?

Choose an answer

ab+c*d-

abc*+d-

abc+*d-

abc*)+d-

While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the nodes _______.

Choose an answer

Randomly

That occur first in the text message

That are lexically smaller among others

That are lexically greater among others

Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟?

Choose an answer

increaseKey(p,delta)

decreaseKey(p,delta)

preculateDown(p,delta)

remove(p,delta)

A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays below; determine the one that cannot possibly be a heap:

Choose an answer

16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28

16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22

A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.

Choose an answer

partially

completely

incompletely

partly

In case of deleting a node from AVL tree,rotation could be prolong to the root node.

Choose an answer

yes

no

not sure

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer