GCSE Computer Science [Component 1]

GCSE Computer Science [Component 1]

9th Grade

•

46 Qs

quiz-placeholder

Similar activities

TIK Kelas 9

TIK Kelas 9

9th Grade

•

50 Qs

CSS 9- Third Quarter Periodic Examination

CSS 9- Third Quarter Periodic Examination

9th Grade

•

50 Qs

Year 9 Computer Science Revision

Year 9 Computer Science Revision

9th Grade

•

45 Qs

KS3 Graphics Assessment

KS3 Graphics Assessment

7th - 9th Grade

•

50 Qs

Web Authoring (10th)

Web Authoring (10th)

8th - 12th Grade

•

50 Qs

Y11 Assessment Prep

Y11 Assessment Prep

9th - 10th Grade

•

46 Qs

Periodical Test in CompTech 9 (Fourth Quarter)

Periodical Test in CompTech 9 (Fourth Quarter)

9th Grade

•

50 Qs

How the Internet Works

How the Internet Works

9th - 12th Grade

•

42 Qs

GCSE Computer Science [Component 1]

GCSE Computer Science [Component 1]

Assessment

Quiz

•

Computers

•

9th Grade

•

Practice Problem

•

Hard

Created by

Sam Knott

Used 451+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?