Question # 1

A binary relation R over S is called an equivalence relation if it has following property(s)

Choose an answer

Reflexivity

Symmetry

Transitivity

All of the given options

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 binary tree with 24 internal node has ____ external node.

Choose an answer

22

23

48

25

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

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

In complete binary tree the bottom level is filled from________

Choose an answer

Left to right

Right to left

Not filled at all

None of the given option

Which formula is the best approximation for the depth of a heap with n nodes?

Choose an answer

log (base 2) of n

The number of digits in n (base 10), e.g., 145 has three digits

The square root of n

n

Which of the following method is helpful in creating the heap at once?

Choose an answer

insert

add

update

preculateDown

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Choose an answer

Array ()

List

Both of these

None of these

Merge sort makes two recursive calls,which statement is true after these recursive calls,finish but before the merge step?

Choose an answer

Elements in the first half of the array are less than or equal to elements in the second half of the array

None of the given options

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the array

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

Choose an answer

2

3

4

5

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