Question # 1

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

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 statement is correct property of binary trees?

Choose an answer

A binary tree with 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 node.

None of above statement is a property of the binary tree.

If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.

Choose an answer

Array

List

Both

None of the above

In a selection sort of n element ,how many times the swap function is called the execution of the algorithm?

Choose an answer

n-1

0

n log n

1

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 (

A kind of expression where the operator is present between two operands called ________ expressions .

Choose an answer

Postfix

Infix

Prefix

None of the above

"+” is a _________operator.

Choose an answer

Unary

Binary

Ternary

None of the above

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

The arguments passed to a function should match in number, type and order with the parameters in the function definition.

Choose an answer

True

False

both

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

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