CSP Unit 10 - Algorithms Review

CSP Unit 10 - Algorithms Review

9th - 12th Grade

19 Qs

quiz-placeholder

Similar activities

Unit 6 Pre-Assessment - Algorithms

Unit 6 Pre-Assessment - Algorithms

11th - 12th Grade

15 Qs

Unit 6 Algorithms Review

Unit 6 Algorithms Review

12th Grade

15 Qs

Unit 8 Test and Benchmark Review 2

Unit 8 Test and Benchmark Review 2

12th Grade

22 Qs

Cryptography

Cryptography

11th Grade

20 Qs

Computer Science Personal Reflections

Computer Science Personal Reflections

9th Grade

15 Qs

Hamiltonian Circuits - Discrete Ch 2

Hamiltonian Circuits - Discrete Ch 2

11th - 12th Grade

15 Qs

DMU7 Study Guide

DMU7 Study Guide

12th Grade

21 Qs

Quantum Detanglers Division B Science Olympiad Elimination

Quantum Detanglers Division B Science Olympiad Elimination

9th Grade

22 Qs

CSP Unit 10 - Algorithms Review

CSP Unit 10 - Algorithms Review

Assessment

Quiz

Mathematics

9th - 12th Grade

Medium

Created by

Ryan Murphy

Used 17+ times

FREE Resource

19 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

A finite set of instructions that accomplish a task

algorithm

problem

binary search

linear search

2.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

general description of a task that can (but sometimes cannot) be solved with an algorithm

algorithm

problem

heuristic

search

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

search algorithm that checks each element of a list, in order, until either the desired value is found or until all elements have been checked

iteration

binary search

linear search

heuristic

4.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

doing some steps of an algorithm over and over

selection

iteration

sequencing

efficiency

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated

binary search

linear search

heuristic

algorithm

6.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

BMO the robot is programming a new game called “Open the box!” You give him a number and he tries to open a numbered box. He’s using Binary Search to accomplish this. Unfortunately, the boxes are not sorted. They are in the following order:


1, 3, 6, 9, 14, 10, 21


Which box can NEVER be found using binary search?

9

6

14

10

7.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

deciding which steps to do next

sequencing

iteration

selection

efficiency

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?