Question # 1

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

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

Choose an answer

This dummy node never has a value

This dummy node has always some dummy values

This dummy node has either no value or some dummy value

This dummy node has always some integer value

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message

Choose an answer

Linked List

Stack

Queue

Binary tree

Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?

Choose an answer

10,30,20,31,40,50,80,60,70

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31

31,10,30,20,70,40,50,80,60

The difference between the binary tree and a binary search tree is that:

Choose an answer

a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node

in binary search tree nodes are inserted based on the values they contain

in binary tree nodes are inserted based on the values they contain

none of these

Which of the following is not true regarding the maze generation ?

Choose an answer

Randomly remove walls until the entrance and exit cells are in same set

Removing a wall is the same as doing union of operation

Removing a randomly chosen wall if the cell is separatedare already in the same set

Do not remove a randomly chosen wall if the cells it separates are already in the same set.

What requirement is placed on an array, so that binary search may be used to locate an entry?

Choose an answer

The array elements must form a heap.

The array must have at least 2 entries

The array must be sorted.

The array‟s size must be a power of two.

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 of the following statements is correct property of binary trees?

Choose an answer

A binary tree with N internal nodes has N+1 internal links

A binary tree with N external nodes has 2N internal nodes

A binary tree with N internal nodes has N+1 external nodes.

None of above statement is a property of the binary tree

A complete binary tree of height ____ has nodes between 16-31.

Choose an answer

2

3

4

5

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

Choose an answer

Data[0]

data[1]

data[n-1]

data[n]

Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 5 12 23 10 7 40 Name the algorithm used

Choose an answer

Heap sort

Selection sort

Insertion sort

Bubble sort (

A complete binary tree of height ___ has node between 16 to 31.

Choose an answer

2

3

4

5

Binary Search is an algorithm of searching ,used with the ____ data .

Choose an answer

Sorted

Unsorted

Heterogeneous

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

Which of the following statement is correct?

Choose an answer

A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.

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)

The maximum number of external nodes for a binary tree of height H is

Choose an answer

2^h

2^h+1

2^h+2

2^h+3

Which of the given option is NOT a factor in Union by Size:

Choose an answer

Maintain sizes (number of nodes) of all trees, and during union.

Make smaller tree, the subtree of the larger one

Make the larger tree, the subtree of the smaller one.

Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k nodes

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

Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap

Choose an answer

[50,32, 37,13, 28, 22, 36] according to max heap property

[37, 28, 32, 22, 36, 13]

[37, 36, 32, 28, 13, 22]

[37, 32, 36, 13, 28, 22]

More Classes

Other Links

PHY-101 Quiz OnlineTest 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

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