GCSE Computer Science [Component 1]

GCSE Computer Science [Component 1]

9th Grade

46 Qs

quiz-placeholder

Similar activities

GCSE DataRep Part 2

GCSE DataRep Part 2

9th Grade

47 Qs

OCR GCSE Computer Science Keywords Set 1

OCR GCSE Computer Science Keywords Set 1

9th - 12th Grade

45 Qs

2.6 Data Representation All MCQ Revision Quiz

2.6 Data Representation All MCQ Revision Quiz

8th - 10th Grade

50 Qs

St Michael's - Year 9 - Data Representation

St Michael's - Year 9 - Data Representation

9th Grade

47 Qs

Year 10 Term 4 roundup

Year 10 Term 4 roundup

9th - 12th Grade

50 Qs

AP CSP Review

AP CSP Review

9th - 12th Grade

50 Qs

Year 10 AO1 revision

Year 10 AO1 revision

9th Grade

47 Qs

AP CSP 12-2 - Unit 1 and 2 Selected Review

AP CSP 12-2 - Unit 1 and 2 Selected Review

9th - 12th Grade

41 Qs

GCSE Computer Science [Component 1]

GCSE Computer Science [Component 1]

Assessment

Quiz

Computers

9th Grade

Hard

Created by

Sam Knott

Used 450+ times

FREE Resource

46 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the decimal representation of this binary number?

00111011

58

102

59

220

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the binary representation of the following denary number?

76

10001110

01001100

00011111

00101011

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following character sets holds the most characters?

Unicode

ASCII

Extended ASCII

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What denary number does the hexadecimal number E represent?

8

11

12

14

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Given the following list:

[4, 6, 2, 10, 7, 98, 8]

Using the Linear Search algorithm, how many comparisons will I do to find the number 7?

5

4

3

10

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Why is it not possible to use the Binary Search algorithm on the following list?


[4, 6, 2, 10, 7, 98, 8]

The list is too small

The list is un-ordered

The list has an odd number of elements

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

On the following list, which algorithm would find a specific number the quickest?


[1, 2, 4, 5, 7, 8, 10, 12, 20, 56]

Bubble Sort

Linear and Binary search would be about the same

Linear Search

Binary Search

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?