Question # 1

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.

Choose an answer

Equal to the small frequency

Equal to the greater

Equal to the sum of the two frequencies

Equal to the difference of the two frequencies

Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?

Choose an answer

x y -a * b +c /

x *y a - b c / +

x y a * - b c / +

x y a * - b/ + c

Which of the following statement is NOT true about threaded binary tree?

Choose an answer

Right thread of the right-most node points to the dummy node

Left thread of the left-most node points to the dummy node.

The left pointer of dummy node points to the root node of the tree

Left thread of the right-most node points to the dummy node.

In an array list the current element is

Choose an answer

the first element

the middle element

the last element

The element where the current pointer points to

We are given N items to build a heap ,this can be done with ______ successive inserts.

Choose an answer

N-1

N

N+1

N+2

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

it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Choose an answer

Variable

Constant

Inconsistent

None of the above

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]

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

Choose an answer

N

N²

Nlog2N

log₂N

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

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