CSP Unit 1 Review

CSP Unit 1 Review

9th - 12th Grade

26 Qs

quiz-placeholder

Similar activities

Brynleigh

Brynleigh

2nd Grade - University

23 Qs

Networks, Internet Communication and Protocols

Networks, Internet Communication and Protocols

9th Grade

25 Qs

FNaF 2

FNaF 2

5th Grade - University

24 Qs

OSPF Practice

OSPF Practice

11th Grade

22 Qs

1.02 vocab

1.02 vocab

9th Grade

21 Qs

Computers

Computers

KG - Professional Development

21 Qs

PT3 2

PT3 2

1st - 12th Grade

22 Qs

Quiz wiadomości Python

Quiz wiadomości Python

11th Grade

22 Qs

CSP Unit 1 Review

CSP Unit 1 Review

Assessment

Quiz

Computers

9th - 12th Grade

Medium

Created by

Eric Schumacher

Used 1+ times

FREE Resource

AI

Enhance your content

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

26 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

Multiple Choice

1. The figure below shows four grids, each containing a robot represented as a triangle. The robot cannot move to a black square or move beyond the edge of the grid. Which of the following algorithms will allow the robot to make a single circuit around the rectangular region of black squares, finishing in the exact location and direction that it started in each of the four grids?

Step 1: Keep moving forward, one square at a time, until the square to the right of the robot is black.

Step 2: Turn right and move one square forward.

Step 3: Repeat steps 1 and 2 three more times.

Step 1: Keep moving forward, one square at a time, until the square to the right of the robot is no longer black.

Step 2: Turn right and move one square forward.

Step 3: Repeat steps 1 and 2 three more times.

Step 1: Move forward three squares.

Step 2: Turn right and move one square forward.

Step 3: If the square to the right of the robot is black, repeat steps 1 and 2.

Step 1: Move forward three squares.

Step 2: Turn right and move one square forward.

Step 3: If the square to the right of the robot is not black, repeat steps 1 and 2.

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Two algorithms are used to find the smallest number in a list:

- Algorithm X: Compare each number in the list one by one until the smallest is found.

- Algorithm Y: Divide the list into pairs, remove the larger number, and repeat until one number remains.

Which is true for a list of 64 numbers?

Algorithm X is faster

Algorithm Y is faster

Both are equally fast

It depends on the numbers

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which factor most strongly affects the efficiency of an algorithm?

The computer's internet speed

The number of times instructions repeat

How easy the steps are to read

The appearance of the pseudocode

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is written in low-level machine language?

print("Hello World")

MOVE_FORWARD

01001001 01001110

if x > 5 then y = y + 1

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

A city wants to count how many people ride the subway each day. Which plan is most scalable?

Have one person count at every station.

Hire 100 people to stand inside trains and count.

Use digital turnstiles that record entries automatically.

Estimate based on the number of trains running.

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

Using a Caesar cipher with a shift of +5, encode the message: data rules.

ifyf wzqjx

efwf vxszn

ifyf wzumn

czsz qtkcz

7.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

The following grid contains a robot represented as a triangle, which is initially in the bottom-left square of the grid and facing the top of the grid. The robot can move into a white or a gray square but cannot move into a black region.

The following code segment implements an algorithm that moves the robot from its initial position to the gray square and facing the top of the grid.

When the robot reaches the gray square, it turns around and faces the bottom of the grid. Which of the following changes, if any, should be made to the code segment to move the robot back to its original position in the bottom-left square of the grid and facing toward the bottom of the grid?

Interchange the 

ROTATE_RIGHT 

and the 

ROTATE_LEFT 

blocks.

Replace 

ROTATE_RIGHT 

with 

ROTATE_LEFT.

Replace 

ROTATE_LEFT 

with 

ROTATE_RIGHT.

No change is needed; the algorithm is correct as is.

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?