Question # 1

Select the FALSE statement binary tree.

Choose an answer

Every binary tree has at least one node.

Every non-empty tree has exactly one root node.

Every node has at most two children.

Every non-root node has exactly one parent.

The data of the problem is of 2 GB and the hard disk is of 1 GB capacity,to solve this problem we should

Choose an answer

use better data structure

Increase the hard disk space

Use the better algorithm

Use as much data as we can store on the hard disk

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Choose an answer

4,6,7,5

6,7,5,4

4,5,6,7

4,6,5,7

Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?

Choose an answer

11,22,33,44,55,66

11,22,33,44,66,55

11,22,33,66,44,55

11,22,66,33,44,55

Which of the following is not an example of equivalence relation:

Choose an answer

Electrical Connectivity

Set of people

<= relation

Set of pixels

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 3 has between ________ nodes.

Choose an answer

8 to 14

8 to 15

8 to 16

8 to 17

If there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?

Choose an answer

N-1

N

N+1

N+2

If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

Choose an answer

Expression tree

threaded binary tree

complete binary tree

perfectly complete binary tree

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

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ .

Choose an answer

N

N²

Nlog₂N

log₂N

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