Computer Science 2.1

Computer Science 2.1

10th Grade

8 Qs

quiz-placeholder

Similar activities

Linear Search

Linear Search

10th - 12th Grade

8 Qs

Bubble Sort

Bubble Sort

1st Grade - Professional Development

13 Qs

OCR GCSE CS - 2.1 ERL sorts and searches

OCR GCSE CS - 2.1 ERL sorts and searches

10th - 11th Grade

9 Qs

HTML Quiz #2 Review - CodeHS (Sec 5 & 6)

HTML Quiz #2 Review - CodeHS (Sec 5 & 6)

7th - 10th Grade

9 Qs

WarmUp: Algorithm, design, and problem solving

WarmUp: Algorithm, design, and problem solving

10th Grade

12 Qs

WD 2 - More HTML

WD 2 - More HTML

KG - 12th Grade

10 Qs

Sorts and searches

Sorts and searches

1st - 12th Grade

6 Qs

Review- Python Data Types

Review- Python Data Types

10th Grade

7 Qs

Computer Science 2.1

Computer Science 2.1

Assessment

Quiz

Computers

10th Grade

Hard

Created by

Emily Argall

Used 26+ times

FREE Resource

8 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

An ... is a sequence of instructions that can be followed to solve a problem.

2.

FILL IN THE BLANK QUESTION

1 min • 1 pt

... is the process of breaking down complex problems into smaller chunks.

3.

FILL IN THE BLANK QUESTION

1 min • 1 pt

... is the process of creating a model by filtering the characteristics we need.

4.

FILL IN THE BLANK QUESTION

1 min • 1 pt

... there a some repetitive parts to the overall problem, thus means more than one part of the program can be dealt with by simply altering the information.

5.

FILL IN THE BLANK QUESTION

1 min • 1 pt

... search - each item in the list is checked in order from the start of the list until the item is found.

6.

FILL IN THE BLANK QUESTION

1 min • 1 pt

... search - an ordered list is split into two each time a comparison is made.

7.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Select the advantages and disadvantages of linear search.

list does not need to be ordered

slower

faster

list must be in order

8.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Select the advantages and disadvantages of binary search.

list does not need to be ordered

slower

faster

list must be in order