Which best describes a binary search? Answers: 2

The search only works if data is in order

The worst case scenario is you have to check half the values

The list does not need to be in order

The worst case scenario is you have to check all the values

Which best describes a linear search? Answers: 2

The worst case scenario is you have to check all the values

The list does not need to be in order

The search only works if data is in order

The worst case scenario is you have to check half the values

Which best defines a bubble sort?

moving through a list repeatedly, swapping elements that are in the wrong order.

a list is split into individual lists, these are then combined (2 lists at a time).

each items is take in turn, compare to the items in a sorted list and placed in the correct position

Which best defines a merge sort?

a list is split into individual lists, these are then combined (2 lists at a time).

moving through a list repeatedly, swapping elements that are in the wrong order.

each items is take in turn, compare to the items in a sorted list and placed in the correct position

Which best defines a insertion sort?

each items is take in turn, compare to the items in a sorted list and placed in the correct position

moving through a list repeatedly, swapping elements that are in the wrong order.

a list is split into individual lists, these are then combined (2 lists at a time).

Which steps best match a bubble sort?

1. Take the first element and second element from the list 2. Compare them 3. IF element 1 > element 2 THEN --- Swap then 4 ELSE --- Do nothing 5. Repeat: Move along the list to the next pair --- IF no more elements: Goto 1 --- ELSE: Goto 2 ---Until: you have moved through the entire list and not made any changes

1. Split a list into individual lists (each element is on its own). 2. Merge the lists in pairs, putting the smallest first. 3. Merge the lists. 4. Keep merging until it is in order.

1. Element 1 is a 'sorted' list. 2. The rest of the elements are an 'unsorted' list. 3. Compare the first element in the 'unsorted' list to each element in the sorted list. 4. IF it is smaller, put it in in front of that element (move the others along). 5. ELSEIF it is larger, compare with the next. 6. ELSEIF there are no more elements in the 'sorted' list put it in the final position. 7. REPEAT UNTIL all element in the 'unsorted' list are in the 'sorted' list.

Which steps best match a merge sort?

1. Split a list into individual lists (each element is on its own). 2. Merge the lists in pairs, putting the smallest first. 3. Merge the lists. 4. Keep merging until it is in order.

1. Take the first element and second element from the list 2. Compare them 3. IF element 1 > element 2 THEN --- Swap then 4 ELSE --- Do nothing 5. Repeat: Move along the list to the next pair --- IF no more elements: Goto 1 --- ELSE: Goto 2 ---Until: you have moved through the entire list and not made any changes

1. Element 1 is a 'sorted' list. 2. The rest of the elements are an 'unsorted' list. 3. Compare the first element in the 'unsorted' list to each element in the sorted list. 4. IF it is smaller, put it in in front of that element (move the others along). 5. ELSEIF it is larger, compare with the next. 6. ELSEIF there are no more elements in the 'sorted' list put it in the final position. 7. REPEAT UNTIL all element in the 'unsorted' list are in the 'sorted' list.

Which steps best match an insertion sort?

1. Element 1 is a 'sorted' list. 2. The rest of the elements are an 'unsorted' list. 3. Compare the first element in the 'unsorted' list to each element in the sorted list. 4. IF it is smaller, put it in in front of that element (move the others along). 5. ELSEIF it is larger, compare with the next. 6. ELSEIF there are no more elements in the 'sorted' list put it in the final position. 7. REPEAT UNTIL all element in the 'unsorted' list are in the 'sorted' list.

1. Take the first element and second element from the list 2. Compare them 3. IF element 1 > element 2 THEN --- Swap then 4 ELSE --- Do nothing 5. Repeat: Move along the list to the next pair --- IF no more elements: Goto 1 --- ELSE: Goto 2 ---Until: you have moved through the entire list and not made any changes

1. Split a list into individual lists (each element is on its own). 2. Merge the lists in pairs, putting the smallest first. 3. Merge the lists. 4. Keep merging until it is in order.

Which of the lists is least memory efficient and why? Answers: 2

As it needs more memory to create separate lists.

All sorting is done on the original list

I have a list that is already sorted. I run each of the Merge and Insertion sorts on the list. Which will be most efficient when handling an already ordered list and why? Answer: 2

If the item is already in place then it won't perform any insertions

If the item is already in order it won't perform any splits and merges.

Perform a bubble sort on the following list. [66, 21, 38, 15, 18, 19, 49] Show each swap that occurs within the first pass?

[66, 21, 38, 15, 18, 19, 49] [ 21, 66 , 38, 15, 18, 19, 49] [21, 38, 66 , 15, 18, 19, 49] [21, 38, 15, 66 , 18, 19, 49] [21, 38, 15, 18, 66 , 19, 49] [21, 38, 15, 18, 19, 66 , 49] [21, 38, 15, 18, 19, 49, 66 ]

[66, 21, 38, 15, 18, 19, 49] [ 21, 66 , 38, 15, 18, 19, 49] [21, 38, 66 , 15, 18, 19, 49] [21, 38, 15, 66 , 18, 19, 49] [21, 38, 15, 18, 19, 49, 66 ] [21, 38, 15, 18, 19, 66 , 49] [21, 38, 15, 18, 66 , 19, 49]

[21, 38, 15, 18, 19, 49, 66 ] [21, 38, 15, 18, 19, 66 , 49] [21, 38, 15, 18, 66 , 19, 49] [21, 38, 15, 66 , 18, 19, 49] [21, 38, 66 , 15, 18, 19, 49] [ 21, 66 , 38, 15, 18, 19, 49]

Perform a bubble sort on the following list. [8, 4, 9, 7] Show each swap that occurs for all passes until the list is sorted

[8, 4, 9, 7] [ 4, 8, 9, 7] [4, 8, 7, 9] [4, 7 , 8 , 9]

[8, 4, 9, 7] [ 4, 8, 9, 7] [4, 9, 8 , 7] [4, 7 , 8 , 9]

[8, 4, 9, 7] [ 4, 8, 9, 7] [4, 8, 7, 9] [ 8, 4 , 7, 9 ]

Perform a merge sort on the following list. [8, 4, 9, 7, 5, 6, 10, 11] Show each swap that occurs for all passes until the list is sorted

Splitting [8, 4, 9, 7, 5, 6, 10, 11] [8, 4, 9, 7] [5, 6, 10, 11] [8, 4] [9, 7] [5, 6] [10, 11] [8][4] [9][7] [5] [6] [10][11] Merging [4, 8] [7, 9] [5, 6] [10, 11] [4, 7, 8, 9] [5, 6, 10, 11] [4, 5, 6, 7, 8, 9, 10, 11]

Splitting [4, 8] [7, 9] [5, 6] [10, 11] [4, 7, 8, 9] [5, 6, 10, 11] [4, 5, 6, 7, 8, 9, 10, 11] Merging [8, 4, 9, 7, 5, 6, 10, 11] [8, 4, 9, 7] [5, 6, 10, 11] [8, 4] [9, 7] [5, 6] [10, 11] [8][4] [9][7] [5] [6] [10][11]

Splitting [8, 4, 9, 7, 5, 6, 10, 11] [8, 4, 9, 7] [5, 6, 10, 11] [8, 4] [9, 7] [5, 6] [10, 11] [8][4] [9][7] [5] [6] [10][11] Merging [4, 8] [7, 9] [5, 6] [10, 11] [4, 7, 8, 9] [5, 6, 10, 11] [4, 7, 8, 9, 5, 6, 10, 11]

When merging these two lists within a merge sort what will be the order that the list becomes merged? [1, 5, 6] [2, 3, 7]

[1] [1,2] [1,2,3] [1,2,3,5] [1,2,3,5,6] [1,2,3,5,6,7]

[1] [1,2] [1,2,5] [1,2,5,3] [1,2,5,3,6] [1,2,5,3,6,7]

Perform an insertion sort on the following list [ 66 , 21, 38, 15, 18, 49]

Underline is sorted part of list [ 21 , 66 , 38, 15, 18, 49] [ 21 , 38 , 66 , 15, 18, 49] [ 15 , 21 , 38 , 66 , 18, 49] [ 15 , 18 , 21 , 38 , 66 , 49] [ 15 , 18 , 21 , 38 , 49 , 66 ]

Underline is sorted part of list [21,38, 15, 18, 49, 66 ] [21, 15, 18, 38, 49, 66 ] [ 15, 18,21, 38, 49, 66 ]

2.1 Algorithms (Key Terms, Sort and Search)

Authored by Ian Currie

Computers

10th - 12th Grade

Used 29+ times

2.1 Algorithms (Key Terms, Sort and Search)

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

32 questions

Show all answers

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of computational thinking.

Development of algorithms to solve problems.

Using abstraction, decomposition and algorithmic thinking.

representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of abstraction.

Development of algorithms to solve problems.

Using abstraction, decomposition and algorithmic thinking.

representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of decomposition.

Development of algorithms to solve problems.

Using abstraction, decomposition and algorithmic thinking.

representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of algorithmic thinking.

Development of algorithms to solve problems.

Using abstraction, decomposition and algorithmic thinking.

representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

What are the two searches you must know for the exam

Answers: 2

Binary

Linear

Bubble

Merge

Insertion

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which best defines a binary search?

An ordered list is divided in 2 with each comparison.

Each item in the list is checked in order.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which best defines a linear search?

An ordered list is divided in 2 with each comparison.

Each item in the list is checked in order.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

27 questions

CDI - Electronic Components & Signals

Quiz

•

10th - 12th Grade

30 questions

Programming Techniques

Quiz

•

8th - 10th Grade

30 questions

COMPUTER 3

Quiz

•

3rd Grade - University

28 questions

All words GCSE Computer Science

Quiz

•

1st - 10th Grade

30 questions

Cryptography & Linux

Quiz

•

9th - 12th Grade

30 questions

10 Brahamadik 1st term

Quiz

•

10th Grade

28 questions

CIS IT Fundamentals Chapter 6

Quiz

•

11th - 12th Grade

30 questions

Spreadsheet Quiz

Quiz

•

10th Grade

Popular Resources on Wayground

7 questions

History of Valentine's Day

Interactive video

•

4th Grade

15 questions

Fractions on a Number Line

Quiz

•

3rd Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

$fractions$

22 questions

fractions

Quiz

•

3rd Grade

15 questions

Valentine's Day Trivia

Quiz

•

3rd Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

Discover more resources for Computers

10 questions

Exploring Valentine's Day with Charlie Brown

Interactive video

•

6th - 10th Grade

18 questions

Valentines Day Trivia

Quiz

•

3rd Grade - University

20 questions

-AR -ER -IR present tense

Quiz

•

10th - 12th Grade

10 questions

Valentine's Day History and Traditions

Interactive video

•

6th - 10th Grade

21 questions

Presidents Day Trivia

Quiz

•

6th - 12th Grade

10 questions

Valentine's Day: History and Modern Celebration

Interactive video

•

9th - 12th Grade

11 questions

Valentine's Day Trivia

Quiz

•

8th - 12th Grade

10 questions

Elijah McCoy: Innovations and Impact in Black History

Interactive video

•

6th - 10th Grade

2.1 Algorithms (Key Terms, Sort and Search)

What is the definition of computational thinking.

What is the definition of abstraction.

What is the definition of decomposition.

What is the definition of algorithmic thinking.

What are the two searches you must know for the examAnswers: 2

Which best defines a binary search?

Which best defines a linear search?

Which best describes a binary search?Answers: 2

Which best describes a linear search?Answers: 2

Which image shows a linear search?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

What are the two searches you must know for the exam

Answers: 2

Which best describes a binary search?

Answers: 2

Which best describes a linear search?

Answers: 2