Algorithms Definitions

Question 1

Define computational thinking

Answer 1

The process of thinking about a problem using computational means in order to create a solution which a computer can implement

(Thinking about a problem like a computer)

Question 2

Define abstraction

Answer 2

The process of removing irrelevant or unnecessary information from the problem in order to better understand the basic parts of it

(Removing unnecessary information)

Question 3

Define decomposition

Answer 3

The process of breaking a problem down into smaller parts to make it easier to solve

(Breaking down a problem into smaller parts)

Question 4

Define Algorithmic thinking

Answer 4

The process of working out the individual steps needed to solve a problem in order to produce an algorithmic solution

(Working out the individual steps to solve a problem)

Question 5

Define algorithm

Answer 5

A sequence of logical instructions to carry out a particular task

Question 6

Define binary seach

Answer 6

A way of searching an ordered list by looking at the middle item in the list, then looking at either the items above or below depending on if the required value is higher or lower. This process repeats until the value is found.

Question 7

Define Linear search

Answer 7

A way of searching through a list of items, checking them one at a time until the required value is found.

Question 8

Define bubble sort

Answer 8

A way of sorting a list by comparing the items in a list, two at a time, and changing the order if needed. The process repeats until the list is in the correct order.

Question 9

Define merge sort

Answer 9

A way of sorting a list by dividing it into two until each item is separated individually. Pairs of items are compared and placed in order until the list as a whole is ordered.

Question 10

Define insertion sort

Answer 10

A way of sorting a list by working through the items one at a time and placing them in the correct position in the list.