Question # 1

If a complete binary tree has n number of nodes then its height will be

Choose an answer

Log₂(n+1)-1

2ⁿ

2ⁿ-1

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

Which one of the following is TRUE about recursion ?

Choose an answer

Recursion extensively use stack memory

Threaded Binary Trees use the concept of recursion.

Recursive function calls consume a lot of memory.

Iteration is more efficient than iteration.

A queen is a data structure where elements are,

Choose an answer

inserted at the front and removed from the back

inserted and removed from the top.

inserted at the back and removed from the front.

inserted and removed from both ends.

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

Choose an answer

insert

add

update

preculateDown

Which one of the following is NOT the property of equivalence relation

Choose an answer

Reflexive

Symmetric

Transitive

Associative

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

Choose an answer

Sorted

Unsorted

Heterogeneous

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

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 (

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

There is/are ________ case/s for rotation in an AVL tree,

Choose an answer

1

2

3

4

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