wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

CCIS 104 Quiz #1.2

Total questions: 13

Worksheet time: 13mins

Name
Class
Date
1.

What is an algorithm?

a)

A finite set of steps to solve a specific problem

b)

A programming language

c)

A type of data structure

d)

A random set of instructions

2.

What does analysis refer to in the context of algorithms?

a)

The coding of the algorithm

b)

A detailed examination of the elements or structure of something

c)

A simple overview of the algorithm

d)

The execution of the algorithm

3.

Which of the following is NOT a category of algorithm?

a)

SEARCH

b)

SORT

c)

COMPILE

d)

DELETE

4.

What is the first step in writing an algorithm?

a)

Test the algorithm

b)

Write the code

c)

Define the problem domain

d)

Analyze the algorithm

5.

What does A Priori Analysis involve?

a)

Empirical analysis of an algorithm

b)

Theoretical analysis of an algorithm

c)

Testing the algorithm on a computer

d)

Implementation of the algorithm

6.

What is measured in Time Complexity?

a)

The number of algorithms available

b)

The memory space required

c)

The amount of time required by the algorithm to run

d)

The number of variables used

7.

What does Space Complexity represent?

a)

The efficiency of an algorithm

b)

The number of steps in an algorithm

c)

The time taken to execute an algorithm

d)

The amount of memory space required by the algorithm

8.

What does Big-O notation express?

a)

The average case time complexity

b)

The upper bound of an algorithm’s running time

c)

The lower bound of an algorithm’s running time

d)

The exact time complexity

9.

What does Omega (Ω) notation measure?

a)

The average case time complexity

b)

The best case time complexity

c)

The worst case time complexity

d)

The space complexity

10.

What is the purpose of Theta (Θ) notation?

a)

To express the lower bound of an algorithm

b)

To express the upper bound of an algorithm

c)

To measure the space complexity

d)

To define exact asymptotic behavior

11.

What is the fixed part in Space Complexity?

a)

Space required for input data

b)

Space required for recursion stack

c)

Space required to store certain data and variables

d)

Space required for dynamic memory allocation

12.

What is the main factor that decides the efficiency of an algorithm?

a)

The number of lines of code

b)

The time and space used by the algorithm

c)

The programming language used

d)

The complexity of the problem

13.

What is the purpose of analyzing proposed solution algorithms?

a)

To write the code

b)

To define the problem domain

c)

To create new algorithms

d)

To implement the best suitable solution