Computer Science 2.1

Computer Science 2.1

10th Grade

8 Qs

quiz-placeholder

Similar activities

Computational Thinking & Searching Algorithm

Computational Thinking & Searching Algorithm

9th - 10th Grade

12 Qs

Year 10 GCSE CS Retrieval and Recall 4.03.22

Year 10 GCSE CS Retrieval and Recall 4.03.22

10th Grade

13 Qs

Search Algorithms

Search Algorithms

9th - 12th Grade

10 Qs

HTML Basics

HTML Basics

8th - 10th Grade

10 Qs

GCSE Computer Science 9-1: Sorting Algorithms

GCSE Computer Science 9-1: Sorting Algorithms

10th Grade - University

10 Qs

Searching Algorithm

Searching Algorithm

10th - 11th Grade

12 Qs

HTML Lists Tag

HTML Lists Tag

10th Grade

10 Qs

Exam Style Questions

Exam Style Questions

10th - 12th Grade

12 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