wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

CSP_CH01_IntroToCompSci

Total questions: 15

Worksheet time: 8mins

Name
Class
Date
1.

Which statement best characterizes computer science in this course context?

a)

Fixing device issues and software installation

b)

Building computer hardware and microprocessors

c)

Study of processes, data, and problem solving

d)

Only learning programming syntax and languages

2.

A hospital wants to reduce patient wait times using computer science. Which approach aligns with CS applications mentioned?

a)

Design fashion catalogs for staff uniforms

b)

Use data processes to optimize scheduling

c)

Replace doctors with non-digital paper charts

d)

Limit appointments to fewer patients daily

3.

Which term refers to breaking a complex problem into smaller, manageable parts?

a)

Algorithm design

b)

Pattern recognition

c)

Decomposition

d)

Abstraction

4.

A developer notices repeated structures in several datasets and groups them to simplify processing. Which pillar is primarily being used?

a)

Decomposition of tasks

b)

Pattern recognition

c)

Algorithm design

d)

Abstraction of details

5.

You hide implementation details of a simulation and expose only inputs and outputs through a clean interface. Which pillar does this exemplify?

a)

Algorithm design

b)

Pattern recognition

c)

Abstraction

d)

Decomposition

6.

Which statement best describes decomposition in computational thinking?

a)

Translating parts into code to automate tasks

b)

Testing parts repeatedly to find performance issues

c)

Combining parts into one to reduce duplication

d)

Breaking problems into parts to manage complexity

7.

When designing a navigation app, engineers show only the route and current traffic while hiding raw GPS satellite data. Which pillar is exemplified and why?

a)

Decomposition, grouping sensors into modules

b)

Pattern recognition, spotting repeated trip paths

c)

Algorithm design, listing turn-by-turn procedures

d)

Abstraction, focusing on what matters to users

8.

Which statement best defines an algorithm in computing?

a)

An endless loop of trial steps

b)

A clear, finite sequence of steps

c)

A random list of possible steps

d)

A vague plan for solving tasks

9.

A program reads a number list, sorts it ascending, then prints the list. Which part corresponds to the process stage in input–process–output?

a)

Sorting the list values

b)

Saving the numbers to disk

c)

Typing the number list

d)

Displaying the sorted list

10.

In a PB&J algorithm activity, why must instructions be extremely specific?

a)

Specificity lets humans improvise missing steps freely

b)

Specificity entertains readers without affecting execution

c)

Specificity reduces ambiguity that computers cannot resolve

d)

Specificity shortens algorithms by removing detailed steps

11.

An algorithm fails because it says 'assemble sandwich' before 'open bread bag.' Which failure reason fits best?

a)

Missing required steps

b)

Incorrect order of steps

c)

Ambiguity in word meaning

d)

Excessive specificity used

12.

Which statement best describes pseudocode in programming practice?

a)

Plain English steps for program logic

b)

Executable code for a specific compiler

c)

Mathematical notation for algorithms only

d)

Graphical flowchart shapes and arrows

13.

In the provided keywords list, which pair represents a conditional structure?

a)

IF / ELSE

b)

WHILE

c)

START / END

d)

FOR EACH

14.

Given this pseudocode: START; INPUT numbers; SET max = first number; FOR EACH number; IF number > max; SET max = number; END FOR; OUTPUT max; END. What result does this algorithm produce?

a)

The first number entered unchanged

b)

The average of all input numbers

c)

The count of numbers processed

d)

The largest value from the inputs

15.

Which modification correctly changes the example pseudocode to compute the minimum value instead of the maximum?

a)

Initialize max to first number, update when number <= max

b)

Initialize min to first number, update when number < min

c)

Initialize max to zero, update when number >= max

d)

Initialize min to last number, update when number > min