Computational Thinking

Question 1

What is the definition of ‘Computational Thinking’?

Answer 1

• A systematic approach to solving problems

- Understanding a problem and developing possible solutions that can be understood by a computer/person/both

Question 2

What are the 3 characteristics of Computational Thinking?

Answer 2

1) . Decomposition
2) . Abstraction
3) . Algorithmic Thinking

Question 3

What is ‘decomposition’?

Answer 3

Decomposition is the breaking down of problems into smaller/more manageable sub-problems.

Question 4

What is ‘abstraction’?

Answer 4

Abstraction is the removing unnecessary info and focusing on important details.

Question 5

What is ‘algorithmic thinking’?

Answer 5

Algorithmic thinking is when you develop an algorithm to solve a problem —> precise step-by-step solution to a problem that can be replicated.

Question 6

What is the definition of an algorithm?

Answer 6

An algorithm is a precise set of instructions, executing these instructions is meant to solve a problem.

Question 7

What is the difference between an algorithm and a computer program?

Answer 7

• Computer programs are interactive but algorithms aren’t
• An algorithm describes the logic of a solution
• A program is an implentation of this solution, written in programming language
• Programs have to be precise (no mistakes)

Question 8

What is a ‘linear search’?

Answer 8

A linear search is when you check each item in a list/sequence one at a time to see if it is the right item.

Best-case scenario: first item = search item
Worst-case scenario: last item = search item

Question 9

What is a ‘binary search’?

Answer 9

1. Take an ordered list and search item
2. Find the item in the middle of the range
3. Compare midpoint to search item
4. If search item = midpoint, then stop
5. If the midpoint is lower then the search item, change the range to the items after the midpoint
6. If the midpoint is higher then the search item, change the range to the items before the midpoint
7. Repeat (2-6) until the search item = midpoint

Question 10

What is a ‘bubble sort’?

Answer 10

• A bubble sort is when you repeatedly go through a list, comparing adjacent items and swapping the items if they are in the wrong order
• Each item the algorithm goes the list it is called a pass. The pass through the list is repeated until the list is sorted

Question 11

What is an ‘insertion sort’?

Answer 11

• An insertion list is when you insert an item in the correct list
• Works by grouping the items in a list into 2 parts:
  
  • Sorted sub-list
  • Unsorted sub-list