J277 Paper 2 Computational Thinking, Programming and Algorithms

J277 Paper 2 Computational Thinking, Programming and Algorithms

9th - 10th Grade

90 Qs

quiz-placeholder

Similar activities

big computing quiz

big computing quiz

9th - 12th Grade

92 Qs

TECH Troubleshooting Theory

TECH Troubleshooting Theory

9th - 12th Grade

88 Qs

 J277 GCSE Computer Science  - 1.1 Systems architecture

J277 GCSE Computer Science - 1.1 Systems architecture

7th - 11th Grade

88 Qs

J277-01 Parts 1.1, 1.2 & 1.6

J277-01 Parts 1.1, 1.2 & 1.6

8th - 10th Grade

93 Qs

ÔN TẬP CUỐI KỲ 2 - TIN 10

ÔN TẬP CUỐI KỲ 2 - TIN 10

10th Grade

91 Qs

Unit 5 - Implementing Algorithms Review

Unit 5 - Implementing Algorithms Review

9th - 12th Grade

86 Qs

Mantenimiento computadoras

Mantenimiento computadoras

5th Grade - University

94 Qs

Malicious Software

Malicious Software

8th - 10th Grade

95 Qs

J277 Paper 2 Computational Thinking, Programming and Algorithms

J277 Paper 2 Computational Thinking, Programming and Algorithms

Assessment

Quiz

Computers

9th - 10th Grade

Practice Problem

Hard

2.2 Programming Fundamentals, 2.1 Algorithms, 2.3 Producing Robust Programs

+2

Standards-aligned

Created by

Jason Davis

Used 496+ times

FREE Resource

AI

Enhance your content in a minute

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

90 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an Algorithm?

A set of instructions.

A Diagram.

A list of things to do.

Tags

2.1 Algorithms

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does the process of Abstraction do?

Remove information.

Ignore unimportant details.

Highlight important information.

Ignore unimportant details and highlight important ones.

Tags

2.1 Algorithms

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Decomposition is the process in which you?

Break a large task down into smaller sections.

Solve easy parts of a problem.

Look for patterns in the problem.

Ignore unimportant details and highlight important ones.

Tags

2.1 Algorithms

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following are Searching Algorithms?

Binary and Linear

Merge and Bubble

Linear and Insertion

Insertion and Merge

Tags

2.1 Algorithms

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of these are Sorting Algorithms?

Bubble, Linear and Insertion

Bubble, Insertion and Merge

Binary, Insertion and Merge

Binary, Linear and Merge

Tags

2.1 Algorithms

6.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Which of these are advantages of a Binary search algorithm?

It is more suitable for large lists.

It is more efficient as its takes less average steps.

Suitable for small lists.

Works on un-ordered lists.

Tags

2.1 Algorithms

7.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Which of these are advantages of a Linear searching algorithm?

It is more suitable for large lists.

It is more efficient as its takes less average steps.

Suitable for small lists.

Works on un-ordered lists.

Tags

2.1 Algorithms

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?