Free Practice Quiz Question List

01. Introduction to Programming and Algorithmic Problem Solving Online Quiz Questions

Use this free practice quiz with 20 questions to review 01. Introduction to Programming and Algorithmic Problem Solving, test your knowledge, and prepare for your next test or exam.

20 questions

True or false

1 point

True or false: A program can have valid syntax but still have incorrect semantics.

A
True
B
False

Choose one

1 point

Which example is an expression rather than a statement?

A
2 + 3
B
x = 2 + 3
C
print(x)
D
if x > 0:

True or false

1 point

True or false: Binary search requires the input collection to be sorted.

A
True
B
False

Written response

1 point

What programming problem-solving process breaks a larger task into smaller operations?

Fill in the blank

1 point

A finite, ordered procedure for solving a problem is an .

Choose one

1 point

In age = 21, what programming concept is represented by age?

A
A data type
B
A Boolean expression
C
A variable
D
An index

Choose all

1 point

Which categories should a thorough test plan include? Select all correct choices.

A
Normal cases
B
Boundary cases
C
Special cases
D
Invalid cases
E
Only cases with positive integers

Written response

1 point

How many times does this code print Repeat?

for count in range(3):
print("Repeat")

Fill in the blank

1 point

A named, reusable block of code that may accept inputs and return an output is a .

Choose one

1 point

In an if/elif/else structure, what happens after one tested condition matches?

A
Every branch whose condition is true executes
B
Only the first matching branch executes
C
Only the else branch executes
D
Branches execute in reverse order

Choose all

1 point

Which two measures are commonly used to evaluate an algorithm's resource use? Select all correct choices.

A
Syntax complexity
B
Time complexity
C
Space complexity
D
Name complexity
E
Comment complexity

Open ended

1 point

Explain a reliable workflow for turning a vague programming requirement into a tested and refined solution. Describe the purpose of the major stages and how they relate to one another.

Choose one

1 point

Given colors = ["red", "green", "blue"], which element does colors[0] access?

A
The second element
B
The last element
C
The first element
D
An element chosen at random

Choose one

1 point

Which statement correctly distinguishes decidability from efficiency?

A
Decidability asks only whether an algorithm is fast
B
Decidability asks whether a universally halting correct algorithm exists
C
Decidability and efficiency are exactly the same question
D
Efficiency determines whether every problem has an algorithm

True or false

1 point

True or false: An algorithm can be described in natural language or pseudocode, but a program must follow the formal rules of a programming language.

A
True
B
False

Choose one

1 point

The following algorithm starts with the first item as the current largest and replaces it whenever a larger item is found. What value does it return for [7, 2, 10, 4]?

A
4
B
10
C
7
D
2

Written response

1 point

What is the single term for breaking a programming task into smaller operations, such as reading scores, calculating an average, comparing boundaries, and displaying a result?

Choose one

1 point

A program runs until it attempts to divide by zero and then stops. Which category best describes this defect?

A
Syntax error
B
Logic error
C
Runtime error or exception
D
Efficiency problem

Choose one

1 point

Which question is primarily about decidability rather than algorithmic efficiency?

A
Whether an algorithm exists that always gives the correct answer and halts for every valid input
B
Whether an algorithm uses less memory than another algorithm
C
Whether a program has syntactically valid statements
D
Whether a loop repeats a fixed number of times

Written response

1 point

A program must represent whether a user account is active or inactive. What data type is the most appropriate for this value?