wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Algorithmic Strategies

Total questions: 10

Worksheet time: 5mins

Name
Class
Date
1.

The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi is called?

a)

Syntax

b)

Algorithm

c)

flow

d)

Flowchart

2.

____ search is a sequential method for finding a particular value in a list.

a)

Linear

b)

Sequential

c)

Binary

d)

either A or B

3.

____ is an asymptotic notation used to represent time complexity of algorithm.

Big 0

Big Ω


Big Θ

All the above

a)

Big 0

b)

Big Ω

c)

Big Θ

d)

All the above

4.

From the following sorting algorithms which algorithm needs the minimum number of swaps?

a)

BUBBLE SORT

b)

QUICKSORT

c)

MERGE SORT

d)

SELECTION SORT

5.

Two main measures for the efficiency of an algorithm are

a)

PROCESSOR AND MEMORY

b)

COMPLEXITY AND CAPACITY

c)

TIME AND SPACE

d)

DATA AND SPACE

6.

From the following sorting algorithms which has the lowest worst case complexity?

answer choices

a)

BUBBLE SORT

b)

QUICK SORT

c)

MERGE SORT

d)

SELECTION SORT

7.

Which of the following is not a stable sorting algorithm?

answer choices

a)

INSERTION SORT

b)

SELECTION SORT

c)

BUBBLE SORT

d)

MERGE SORT

8.

If a problem can be broken into subproblems that are reused several times, the problem possesses which property?

a)

OVERLAPPING SUBPROBLEMS

b)

OPTIMAL SUBSTRUCTURE

c)

MEMOIZATION

d)

GREEDY

9.

The complexity of linear search algorithm is _______

a)

O(n)

b)

O(log n)

c)

O(n2)

d)

O(n log n)

10.

The Θ notation in asymptotic evaluation represents

a)

BASE CASE

b)

AVERAGE CASE

c)

WORST CASE

d)

NULL CASE