# Algorithm Quiz Questions: Test!

15 Questions | Total Attempts: 131  Settings  Are you familiar with an algorithm? Would you like to try this quiz? In mathematics, an algorithm is a limited sequence of computer instructions. It is typically utilized to solve a class of problems or to perform a calculation. Algorithms are always clear-cut and are used as specifications for performing calculations. It is an integral part of programming, and if you choose to learn more about algorithms go no further than this quiz.

• 1.
These are algorithm paradigms except one:
• A.

Divide and Conquer

• B.

Backtracking

• C.

Searching

• D.

Greedy

• 2.
These are sorting algorithm except one:
• A.

Insertion

• B.

Merge

• C.

Linear

• D.

Selection

• 3.
O(n) is in what time complexity?
• A.

Linear

• B.

Constant

• C.

• D.

Logatihmic

• 4.
This algorithm analysis evaluates and algorithm in its best case.
• A.

Big Oh

• B.

Big Omega

• C.

Big Theta

• 5.
This algorithm analysis specifies the Upper bound.
• A.

Big Oh

• B.

Big Omega

• C.

Big Theta

• 6.
If f(x) =  x +1   the Big Oh is O(1)
• A.

True

• B.

False

• 7.
If you are searching within Array A,  which value of X will be in the best case? A = | 3 | 4| 1| 9| 6|  2| 7|
• A.

2

• B.

3

• C.

4

• D.

5

• 8.
If you are searching within Array A,  which value of X will be in the best case? A = | 3 | 4| 1| 9| 6|  2| 7|
• A.

3

• B.

9

• C.

2

• D.

7

• 9.
What operations can we get from the following line ? (Wrong choices will be deducted from your scores) for i = 1 to  (n-1)
• A.

Assignment

• B.

Indexing

• C.

Return

• D.

• E.

Subtraction

• F.

Comparison

• G.

Call

• 10.
What operations can we get from the following line? (Wrong choices will be deducted from your scores) if x > 2 and i = j+1
• A.

Assignment

• B.

Indexing

• C.

Return

• D.

• E.

Comparison

• F.

Subtraction

• G.

Call

• 11.
Performing an Insertion sort in the following, what will be the arrangement after 3 iterations? 5    4   2  1   7   9  3   8
• A.

1  2   4   5   7   9   3   8

• B.

1   2    3   5   7   9   4   8

• C.

1   4   2   5   7   9   3   8

• D.

1   2   4   5   7   9   3   8

• 12.
In a binary tree, given the following array, who will be put in the middle or root node? A =  6 9 5 7 2 3 8
• A.

2

• B.

4

• C.

5

• D.

7

• 13.
Sorting was conceptualized to aid in the searching process.
• A.

True

• B.

False

• 14.
There is only one algorithm for a specific task.
• A.

True

• B.

False

• 15.
O(n) time complexity is faster than O(1).
• A.

True

• B.

False

Related Topics Back to top