Paper 2 Revision

Paper 2 Revision

10th Grade

15 Qs

quiz-placeholder

Similar activities

A words - GCSE Computer Science

A words - GCSE Computer Science

1st - 10th Grade

13 Qs

Searching Algorithms

Searching Algorithms

9th - 11th Grade

16 Qs

Year 8 Quiz 1

Year 8 Quiz 1

9th - 12th Grade

10 Qs

Searching and Sorting

Searching and Sorting

University - Professional Development

15 Qs

2.1 Linear Search

2.1 Linear Search

7th - 12th Grade

20 Qs

Unit 2.3 Robust Programs MCQs L1

Unit 2.3 Robust Programs MCQs L1

10th - 11th Grade

20 Qs

Sorting algorithms (Y11)

Sorting algorithms (Y11)

8th Grade - University

20 Qs

2.1.3 Searching Algorithms

2.1.3 Searching Algorithms

10th - 11th Grade

12 Qs

Paper 2 Revision

Paper 2 Revision

Assessment

Quiz

Computers

10th Grade

Medium

Created by

Pippa Lewty

Used 3+ times

FREE Resource

15 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Media Image

An algorithm to sort data is shown in the image. State the name of the sorting algorithm

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an example of a 'defensive design consideration'?

Comments or indentation in code

Syntax errors or Boolean operators

Iterative or final testing

Handling exceptions in programs

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Checking data input by the user meets specific criteria before processing is the definition for which key term?

Syntax error

Validation

Verification

Authentication

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

State the equivalent Boolean expression for this circuit diagram.

X = A OR (C AND NOT B)

Y = (C AND NOT B) OR A

A = (NOT B AND C) OR A

Z = (NOT B AND C) OR A

5.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Which flowchart symbol is used to signify an output?

6.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Pick all the statements that define a merge sort.

a divide and conquer algorithm

a list is repeatedly divided into smaller lists eventually containing just one item

two lists are merged together into four

each element is compared with the adjacent list

7.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Select all the characteristics of a binary search

Starts from the calculated middle position

if the item is not found, quarter of the data set can be discarded

the data set must be sorted first

algorithm repeats until the data item is found or no items are left to check

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?