Introduction to Programming

Introduction to Programming

2nd - 10th Grade

10 Qs

quiz-placeholder

Similar activities

Java: repetition control structure for & while

Java: repetition control structure for & while

10th - 12th Grade

10 Qs

PowerPoint Quiz 2

PowerPoint Quiz 2

9th Grade

13 Qs

Quiz Struktur Data

Quiz Struktur Data

7th Grade

10 Qs

CSS9_Q3M2L1_QUIZ3

CSS9_Q3M2L1_QUIZ3

9th Grade

10 Qs

WJEC GCSE ICT Unit 1 E-Mail

WJEC GCSE ICT Unit 1 E-Mail

9th - 10th Grade

13 Qs

Scratch

Scratch

KG - Professional Development

10 Qs

REVISION

REVISION

1st - 2nd Grade

10 Qs

Introduction to cloud Computing.

Introduction to cloud Computing.

1st - 3rd Grade

10 Qs

Introduction to Programming

Introduction to Programming

Assessment

Quiz

Computers

2nd - 10th Grade

Practice Problem

Medium

Created by

Jo-Ann (Failsworth)

Used 73+ times

FREE Resource

AI

Enhance your content in a minute

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

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

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?