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

"+” is a _________operator.

Choose an answer

Unary

Binary

Ternary

None of the above

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

Compiler uses which one of the following to evaluate a mathematical equation

Choose an answer

Binary Tree

Binary Search Tree

Parse Tree

AVL Tree

Each node in a double link list has ,

Choose an answer

1 pointer

2 pointer

3 pointer

4 pointers

Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the one that cannot possibly be a heap:

Choose an answer

7 6 5 4 3 2 1

7 3 6 2 1 4 5

7 6 4 3 5 2 1

7 3 6 4 2 5 1

A complete binary tree of height 3 has between ________ nodes.

Choose an answer

8 to 14

8 to 15

8 to 16

8 to 17

Which of the following is a property of binary tree?

Choose an answer

A binary tree of N external nodes has N internal node.

A binary tree of N internal nodes has N+ 1 external node

A binary tree of N external nodes has N+ 1 internal node

A binary tree of N internal nodes has N- 1 external node.

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

Choose an answer

Postfix

Infix

Prefix

None of the above

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

Choose an answer

Sorted

Unsorted

Heterogeneous

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

Choose an answer

2

3

4

5

Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when using a binary search for a value, the binary search always finds ____________

Choose an answer

the first occurrence of a value.

the second occurrence of a value

may find first or second occurrence of a value.

None of the given options

Consider the following postfix expression S and the initial values of the variable,

S = A B - C + D E F - + ^ Assume that A=3, B=2, C=1, D=1, E=2, F=3 What would be the final output of the stack?

Choose an answer

1

2

0

-1

Which one of the following is TRUE about iteration?

Choose an answer

Iteration extensively uses stack memory

Threaded Binary Trees use the concept of iteration.

Iterative function calls consumes a lot of memory.

Recursion is more efficient than iteration.

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

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

Choose an answer

Sorted

Unsorted

Heterogeneous

Random

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 there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?

Choose an answer

N-1

N

N+1

N+2

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

The definition of transitive property is

Choose an answer

For all element x member of S, x R x

For all elements x and y, x R y if and only if y R x

For all elements x, y and z, if x R y and y R z then x R z

For all elements w, x, y and z, if x R y and w R z then x R z

A simple sorting algorithm like selection sort or bubble sort have a wrostcase of

Choose an answer

O(1) time because all lists take the same amount of time to sort

O(n) time because it has to perform n swaps to order the list.

O(n² ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.

O(n³ ) time, because the worst case has really random input which takes longer to sort.

More Classes

Other Links

PHY-101 Quiz OnlineTest 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

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