Computational Thinking

Question 1

What is decomposition?

Answer 1

Breaking something down into smaller parts

Question 2

What is abstraction?

Answer 2

Removing any unnecessary details

Question 3

How does linear search work?

Answer 3

Where an algorithm starts at the beginning of a list and moves through item by item until it finds the matching item

Question 4

How does binary search work?

Answer 4

Where an algorithm takes the median, compares it with the search item and discards the irrelevant items

Question 5

How does bubble sort work?

Answer 5

1. The algorithm starts at the beginning of a list and examines the first two items
2. The items in the wrong order are swapped
3. When the algorithm reaches the end of the list, it repeats

Question 6

How does merge sort work?

Answer 6

1. The algorithm break the list into two until each list only holds a single value
2. The items are reassembled in their lists
3. They are then combined to make a final list in the correct order