Page 1 of 55
INVITATION TO COMPUTER SCIENCE PREP 2026 QUESTIONS WITH
VERIFIED ANSWERS DETAILED RATIONALES GRADED A+
Part I: Introduction to Computer Science (Chapter 1)
1. Computer science is best defined as the study of which of the following?
A. Building and repairing physical computer hardware
B. Algorithms, including their formal properties, hardware realizations, and
applications
C. Using software applications such as word processors and spreadsheets
D. Designing computer graphics and video games
Rationale: The textbook defines computer science as the study of algorithms,
encompassing their theoretical foundations, hardware and software
implementations, and real-world applications.
2. The textbook organizes computer science into how many levels of abstraction?
A. Three levels
B. Six levels
C. Ten levels
D. Two levels
Rationale: The text uses a six-level hierarchy: algorithmic foundations, hardware,
virtual machine, software, applications, and social issues.
3. An algorithm is formally defined as which of the following?
A. A programming language used to write software
B. An ordered sequence of unambiguous, effectively computable instructions
that solves a problem
1|Page
,Page 2 of 55
C. A physical component of a computer system
D. A type of computer network protocol
Rationale: A formal algorithm is a finite sequence of unambiguous and effectively
computable operations that, when executed, produces a result and halts.
4. Which of the following is NOT a characteristic of a proper algorithm?
A. It must be unambiguous.
B. It may run forever without producing a result.
C. It must be effectively computable.
D. It must produce a result and halt.
Rationale: An algorithm must terminate after a finite number of steps; an infinite
process does not satisfy the definition.
5. The three basic operations used to construct algorithms are which of the
following?
A. Input, output, and storage
B. Sequential, conditional, and iterative
C. Sorting, searching, and merging
D. Reading, writing, and arithmetic
Rationale: Algorithms are built from sequential operations (straight-line steps),
conditional operations (if-then-else), and iterative operations (loops).
6. A sequential operation in an algorithm is best described as which of the
following?
A. Performing one step after another in a prescribed order
B. Repeating a set of steps multiple times
C. Choosing between two alternative paths
D. Halting the algorithm immediately
Rationale: Sequential operations execute steps in order without branching or
looping.
7. A conditional operation allows an algorithm to do which of the following?
2|Page
,Page 3 of 55
A. Execute steps in a fixed order
B. Choose between alternative actions based on a test condition
C. Repeat steps indefinitely
D. Terminate without producing output
Rationale: Conditional (if-then-else) operations allow the algorithm to select
among alternatives depending on whether a condition is true or false.
8. An iterative operation in an algorithm is used to do which of the following?
A. Perform a single step only once
B. Repeat a block of steps while a condition holds or for a specified number of
times
C. Choose between two alternatives
D. Halt the algorithm
Rationale: Iterative operations (loops) repeat a set of instructions, enabling
repetition and efficient processing.
9. Pseudocode is best described as which of the following?
A. A specific programming language that compiles directly
B. A structured, English-like notation used to express algorithms without
language-specific syntax
C. A type of computer hardware
D. A binary encoding scheme
Rationale: Pseudocode uses natural language and structured constructs to
describe algorithms, making them readable and language-independent.
10. The process of breaking a problem into smaller, more manageable
subproblems is known as which of the following?
A. Binary search
B. Top-down design (divide and conquer)
C. Boolean algebra
D. Compilation
3|Page
, Page 4 of 55
Rationale: Top-down design decomposes a complex problem into simpler
subproblems that can be solved individually and then combined.
11. Which of the following best describes the role of algorithms in computing?
A. Algorithms are only used in theoretical research.
B. Algorithms provide the logical foundation for all computer programs and
problem-solving.
C. Algorithms are limited to sorting and searching.
D. Algorithms are hardware components.
Rationale: Every computer program embodies one or more algorithms, making
algorithms the conceptual core of computing.
12. A problem is considered algorithmically solvable when which of the following
is true?
A. It has been implemented in a specific programming language.
B. There exists a finite, unambiguous, effectively computable sequence of steps
that solves it.
C. It can be solved by a human without a computer.
D. It has been approved by a standards organization.
Rationale: Algorithmic solvability depends on the existence of an algorithm,
independent of any particular implementation.
13. The statement that computer science is not just about programming but about
problem-solving emphasizes which of the following?
A. Programming is the only skill needed.
B. Algorithmic thinking and problem decomposition precede coding.
C. Hardware design is more important than software.
D. Computers can solve any problem.
Rationale: The textbook emphasizes that computer science is fundamentally
about algorithmic problem-solving, with programming as one implementation
tool.
4|Page
INVITATION TO COMPUTER SCIENCE PREP 2026 QUESTIONS WITH
VERIFIED ANSWERS DETAILED RATIONALES GRADED A+
Part I: Introduction to Computer Science (Chapter 1)
1. Computer science is best defined as the study of which of the following?
A. Building and repairing physical computer hardware
B. Algorithms, including their formal properties, hardware realizations, and
applications
C. Using software applications such as word processors and spreadsheets
D. Designing computer graphics and video games
Rationale: The textbook defines computer science as the study of algorithms,
encompassing their theoretical foundations, hardware and software
implementations, and real-world applications.
2. The textbook organizes computer science into how many levels of abstraction?
A. Three levels
B. Six levels
C. Ten levels
D. Two levels
Rationale: The text uses a six-level hierarchy: algorithmic foundations, hardware,
virtual machine, software, applications, and social issues.
3. An algorithm is formally defined as which of the following?
A. A programming language used to write software
B. An ordered sequence of unambiguous, effectively computable instructions
that solves a problem
1|Page
,Page 2 of 55
C. A physical component of a computer system
D. A type of computer network protocol
Rationale: A formal algorithm is a finite sequence of unambiguous and effectively
computable operations that, when executed, produces a result and halts.
4. Which of the following is NOT a characteristic of a proper algorithm?
A. It must be unambiguous.
B. It may run forever without producing a result.
C. It must be effectively computable.
D. It must produce a result and halt.
Rationale: An algorithm must terminate after a finite number of steps; an infinite
process does not satisfy the definition.
5. The three basic operations used to construct algorithms are which of the
following?
A. Input, output, and storage
B. Sequential, conditional, and iterative
C. Sorting, searching, and merging
D. Reading, writing, and arithmetic
Rationale: Algorithms are built from sequential operations (straight-line steps),
conditional operations (if-then-else), and iterative operations (loops).
6. A sequential operation in an algorithm is best described as which of the
following?
A. Performing one step after another in a prescribed order
B. Repeating a set of steps multiple times
C. Choosing between two alternative paths
D. Halting the algorithm immediately
Rationale: Sequential operations execute steps in order without branching or
looping.
7. A conditional operation allows an algorithm to do which of the following?
2|Page
,Page 3 of 55
A. Execute steps in a fixed order
B. Choose between alternative actions based on a test condition
C. Repeat steps indefinitely
D. Terminate without producing output
Rationale: Conditional (if-then-else) operations allow the algorithm to select
among alternatives depending on whether a condition is true or false.
8. An iterative operation in an algorithm is used to do which of the following?
A. Perform a single step only once
B. Repeat a block of steps while a condition holds or for a specified number of
times
C. Choose between two alternatives
D. Halt the algorithm
Rationale: Iterative operations (loops) repeat a set of instructions, enabling
repetition and efficient processing.
9. Pseudocode is best described as which of the following?
A. A specific programming language that compiles directly
B. A structured, English-like notation used to express algorithms without
language-specific syntax
C. A type of computer hardware
D. A binary encoding scheme
Rationale: Pseudocode uses natural language and structured constructs to
describe algorithms, making them readable and language-independent.
10. The process of breaking a problem into smaller, more manageable
subproblems is known as which of the following?
A. Binary search
B. Top-down design (divide and conquer)
C. Boolean algebra
D. Compilation
3|Page
, Page 4 of 55
Rationale: Top-down design decomposes a complex problem into simpler
subproblems that can be solved individually and then combined.
11. Which of the following best describes the role of algorithms in computing?
A. Algorithms are only used in theoretical research.
B. Algorithms provide the logical foundation for all computer programs and
problem-solving.
C. Algorithms are limited to sorting and searching.
D. Algorithms are hardware components.
Rationale: Every computer program embodies one or more algorithms, making
algorithms the conceptual core of computing.
12. A problem is considered algorithmically solvable when which of the following
is true?
A. It has been implemented in a specific programming language.
B. There exists a finite, unambiguous, effectively computable sequence of steps
that solves it.
C. It can be solved by a human without a computer.
D. It has been approved by a standards organization.
Rationale: Algorithmic solvability depends on the existence of an algorithm,
independent of any particular implementation.
13. The statement that computer science is not just about programming but about
problem-solving emphasizes which of the following?
A. Programming is the only skill needed.
B. Algorithmic thinking and problem decomposition precede coding.
C. Hardware design is more important than software.
D. Computers can solve any problem.
Rationale: The textbook emphasizes that computer science is fundamentally
about algorithmic problem-solving, with programming as one implementation
tool.
4|Page
