Question # 1

_____ only removes items in reserve order as they were entered

Choose an answer

Stack

Queue

Both of these

None of these

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

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

_________ 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

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.

In a min heap , preculateDown procedure will move smaller value______ and bigger value______.

Choose an answer

left,right

right,left

up,down

down,up

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

Each node in a double link list has ,

Choose an answer

1 pointer

2 pointer

3 pointer

4 pointers

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

Choose an answer

insert

add

update

preculateDown

Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree)

Choose an answer

Log₂(n+1)

Log₂(n+1) -1

1.44 Log₂n

1.66 Log₂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

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