Code.org Unit 6

Code.org Unit 6

12th Grade

19 Qs

quiz-placeholder

Similar activities

CORLANG Week6-7

CORLANG Week6-7

10th Grade - University

20 Qs

business 1.4 revision

business 1.4 revision

KG - Professional Development

20 Qs

After Effect Intoduction

After Effect Intoduction

10th Grade - University

15 Qs

Linux: Users and Groups

Linux: Users and Groups

9th Grade - University

14 Qs

Digital Icons

Digital Icons

12th Grade - University

16 Qs

Visual Basic Assessment

Visual Basic Assessment

11th - 12th Grade

21 Qs

BIM1014 Quiz 2

BIM1014 Quiz 2

KG - University

15 Qs

Code.org Unit 6

Code.org Unit 6

Assessment

Quiz

Computers

12th Grade

Hard

Created by

Thomas Martinez

FREE Resource

AI

Enhance your content in a minute

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

19 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is true of algorithms?

Allgorithms 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

1 min • 1 pt

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

Wake up

Brush teeth

Put on shirt

Put on pants

Put on socks

Put on shoes

Tie shoes

Which concept does this algorithm BEST demonstrate?

Sequencing

Iteration

Selection

Execution

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

Media Image
Media Image
Media Image
Media Image

4.

MULTIPLE CHOICE QUESTION

1 min • 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

1 min • 1 pt

Media Image

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

1 min • 1 pt

Media Image

Media Image
Media Image
Media Image
Media Image

7.

MULTIPLE CHOICE QUESTION

1 min • 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?