Search Header Logo

Unit 6 Pre-Assessment - Algorithms

Authored by Erin Pennington

Mathematics, Computers

11th - 12th Grade

Used 77+ times

Unit 6 Pre-Assessment - Algorithms
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Which of the following is true of algorithms?

Algorithms may have an infinite set of instructions

Algorithms must be expressed using a programming language

Every algorithm can be constructed using combinations of sequencing, selection, and iteration

Every problem can be solved with an algorithm

2.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

The following algorithm is followed by a person every morning when they get up from bed to go to school:

1. Wake up

2. Brush teeth

3. Put on shirt

4. Put on pants

5. Put on socks

6. Put on shoes

7. Tie shoes

Which concept does this algorithm BEST demonstrate?

Sequencing

Selection

Iteration

Execution

3.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

Which of these algorithms will move the robot along the same path as the algorithm shown?

Media Image
Media Image
Media Image
Media Image

4.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

A town government is designing a new bus system and are deciding where to put the different bus stops. They want to pick the collection of locations that minimizes the distance anyone needs to walk in order to get to at least one bus stop. What term best defines the kind of problem?

A decision problem

An optimization problem

An undecidable problem

An efficiency problem

5.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

The algorithm shown is used to find the largest element in a list of numbers.

By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how?

Line 01 becomes target <- list[2]

Line 04 becomes IF (num < target)

Line 04 becomes IF (num = target)

Line 01 becomes list[0] <- target

6.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

Media Image
Media Image
Media Image
Media Image

7.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

These algorithms are equally efficient

Algorithm A is more efficient than algorithm B

Algorithm B is more efficient than algorithm A

The algorithms have different efficiencies depending on the input size

Access all questions and much more by creating a free account

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

Already have an account?