NEW_SMP_Mls8_Quiz

NEW_SMP_Mls8_Quiz

7th - 12th Grade

18 Qs

quiz-placeholder

Similar activities

iGCSE Computer Science: Problem Solving

iGCSE Computer Science: Problem Solving

9th - 12th Grade

20 Qs

Sorting

Sorting

7th - 8th Grade

20 Qs

Searching and Sorting

Searching and Sorting

10th - 12th Grade

20 Qs

Search and Sort Algorithms

Search and Sort Algorithms

7th - 11th Grade

18 Qs

GCSE J277 - 2.1.3 - Searching Algorithms

GCSE J277 - 2.1.3 - Searching Algorithms

7th Grade

20 Qs

Searching and Sorting Algorithms

Searching and Sorting Algorithms

6th - 10th Grade

18 Qs

2.1 Linear Search

2.1 Linear Search

7th - 12th Grade

20 Qs

Sorting algorithms (Y11)

Sorting algorithms (Y11)

8th Grade - University

20 Qs

NEW_SMP_Mls8_Quiz

NEW_SMP_Mls8_Quiz

Assessment

Quiz

Computers

7th - 12th Grade

Medium

Created by

Kode Kiddo

Used 265+ times

FREE Resource

18 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an Algorithm?

A chart showing the flow of a series of events

A decision arrived at by following instructions

Step-by-step instructions used to solve a problem

A computer program that follows a chart

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is NOT an algorithm?

Media Image
Media Image
Media Image
Media Image

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What should be considered when designing an algorithm?

If the correct hardware is being used

If the correct software is being used

If there is more than one way of solving the problem

4.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

Which of these pseudocode algorithms matches this flowchart?

input a

b <- 1

c <- 1

IF (a>1)

d <- b + c

c <- b

d <- c

a <- a - 1

ENDIF

output c

input a

b <- 1

WHILE (a>1)

d <- b + c

c <- b

d <- c

a <- a - 1

ENDWHILE

output c

input a

b <- 1

c <- 1

WHILE (a>1)

d <- b + c

b <- c

c <- d

a <- a - 1

ENDWHILE

output c

input a

b <- 1

c <- 1

IF (a>1)

d <- b + c

b <- c

c <- d

a <- a - 1

ENDIF

output c

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Some pseudocode to manipulate a numeric list is given below:


input list

a <- first_item_in_list

WHILE NOT end of list

b <- next item in the list

IF a > b

a <- b

ENDIF

ENDWHILE

output a

average(list)

max(list)

min(list)

search list for a

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A bubble sort algorithm will loop until?

We have completed an entire run of comparing each item with the next in the list, and have made no changes during the run.

We have compared each item with the item next to it and swapped them if needed.

We have compared each item with each other item.

We have made a number of swaps equal to the number of items in the list.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm may make multiple swaps per pass?

Bubble Sort

Merge Sort

Insertion Sort

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?