Search Header Logo

2.1.3 Revision Test

Authored by Simon Woods

Computers

10th Grade

Used 1+ times

2.1.3 Revision Test
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

5 questions

Show all answers

1.

DRAG AND DROP QUESTION

1 min • 1 pt

​ (a)   search works by starting at the beginning of a list and checking if that item is the one being searched for. It then looks at the ​ (b)   one and continues until either it finds the item searched for or reaches the ​ (c)   of the list. If it reaches the end of the list, then the item was not in the list.

Linear
next
end

2.

DRAG AND DROP QUESTION

1 min • 1 pt

A ​ (a)   search will only work on a ​ (b)   list. It works by finding the ​ (c)   item and comparing it to the searched item. If it is the item, it returns that it is found. If it is ​ (d)   than the searched for item, then the top half of the list is discarded. If it is less, the ​ (e)   half is discarded. The process is repeated on the remainder of the list until the item is found or you end up with a list of one, which is not the item. Then we know it is not in the list.

binary
sorted
middle
greater
bottom

3.

DRAG AND DROP QUESTION

1 min • 1 pt

​ (a)   sort works by starting at the first item and comparing it to the next. If they are out of order it ​ (b)   them. It continues through the list swapping items when they are out of order till it reaches the end. It then ​ (c)   the entire process until a full pass is completed with ​ (d)   swaps. When the swaps are made, it does a three-way swap using a ​ (e)   variable to hold the data during the swap.

Bubble
swaps
repeats
no
temporary

4.

DRAG AND DROP QUESTION

1 min • 1 pt

An ​ (a)   sort works by starting with a sublist of ​ (b)   item at the start of the list. A list of one is naturally ​ (c)   . Starting with the next item, the items are compared with the one ​ (d)   to it and if out of place swapped. This continues until either it does not need to be swapped or is at the ​ (e)   of the list, at which point it is also sorted. Once all the items are inserted the entire list is sorted.

insertion
one
sorted
prior
bottom

5.

DRAG AND DROP QUESTION

1 min • 1 pt

A merge sort uses a ​ (a)   and ​ (b)   algorithm and works by ​ (c)   the list in half. Each sublist is further split in half until all items are in lists of ​ (d)   . The algorithm then works by ​ (e)   the split lists, but it does it by taking items from the now sorted lists in order and recombining them in order.

conquer
divide
splitting
one
recombining

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?