Introduction to Programming

Introduction to Programming

2nd - 10th Grade

10 Qs

quiz-placeholder

Similar activities

Bubble Sort

Bubble Sort

1st Grade - Professional Development

13 Qs

GCSE Computer Science 9-1: Sorting Algorithms

GCSE Computer Science 9-1: Sorting Algorithms

10th Grade - University

10 Qs

Introduction to Computational Thinking

Introduction to Computational Thinking

7th - 8th Grade

12 Qs

GC Y8 - Algorithms - reminder

GC Y8 - Algorithms - reminder

7th - 8th Grade

11 Qs

Search Algorithms

Search Algorithms

9th - 12th Grade

10 Qs

Code.org - Unit 6 Review

Code.org - Unit 6 Review

9th - 12th Grade

15 Qs

Searches

Searches

9th Grade

15 Qs

AQA Computer Science GCSE - 3.1 Fundamentals of algorithms

AQA Computer Science GCSE - 3.1 Fundamentals of algorithms

10th - 12th Grade

15 Qs

Introduction to Programming

Introduction to Programming

Assessment

Quiz

Computers

2nd - 10th Grade

Medium

Created by

Jo-Ann (Failsworth)

Used 73+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an Algorithm?

A list of steps in any order

A list of steps in order (sequence)

A list of paragraphs

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are computer programs made up of?

Bits and Bobs

Algorithmics

Algorithms

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is pseudocode?

An algorithm in the wrond order

A written algorithm

A series of shapes linked together

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is this shape for in a Flowchart?

Decision

Start Stop

Process

Input Output

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is this shaped used for in a Flowchart?

Decision

Input output

Start Stop

Process

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm have we learnt about?

Merge

Insertion

Bubble

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following describes a Bubble Sort?

compares values in turn, starting with the second value in the list. If this value is greater than the value to the left of it, no changes are made. Otherwise this value is repeatedly moved left until it meets a value that is less than it. The sort process then starts again with the next value. This continues until the end of the list is reached.

uses a technique called divide and conquer. The list is repeatedly divided into two until all the elements are separated individually. Pairs of elements are then compared, placed into order and combined. The process is then repeated until the list is recompiled as a whole.

goes through a list of data a number of times, comparing two items that are side by side to see which is out of order. It will keep going through the list of data until all the data is sorted into order. Each time the algorithm goes through the list it is called a ‘pass’.

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?