P2 Computational Thinking

Question 1

What are the computational thinking methods

Answer 1

Abstraction, decomposition, algorithmic thinking

Question 2

What is abstraction

Answer 2

Ignoring unnecessary detail
Simplifying the problem and reduced complexity

Question 3

What is decomposition

Answer 3

Breaking a complex problem down into smaller parts

Question 4

What is algorithmic thinking

Answer 4

Setting out a step by step process needed to solve a problem (flowchart)

Question 5

What is the square box for in a flowchart

Answer 5

A process (action) like setting a variable value

Question 6

What is the parallelogram

Answer 6

Input/output

Question 7

What is the diamond

Answer 7

A decision (true false, bigger or smaller)

Question 8

What is a rounded rectangle

Answer 8

Start and stop

Question 9

What are the stages of a linear search

Answer 9

Starting with the first value check all the values in order

Question 10

What are the steps of a binary search

Answer 10

Pick middle number
Check if number selected is the target number
If it is larger than target discard the right half and discard the left hand if it is smaller
Repeat until number found or there is only one item left

Question 11

What happens in a bubble sort

Answer 11

Pairs of numbers are compared and if they are in the incorrect order they switch, causing the largest number to bubble to the end

Question 12

What happens in a merge sort

Answer 12

First the list is split into individual parts, then they are combined into pairs and ordered in size then two pairs join and are ordered in size.

Question 13

What are the stages in an insersion sort

Answer 13

Selects the first item in the list and places the second in the correct order. With each pass the next item is placed into the sorted list in the correct place

Question 14

What are the advantages of binary searches

Answer 14

Take less comparisons and are faster

Question 15

Why are merge sorts better than bubble sorts

Answer 15

Faster to sort for larger lists and takes a set amount of time(if list is same number of digits)

Question 16

What are the differences between an insersion sort and bubble sort

Answer 16

Insertion inserts sorts into the correct position and only completes one pass
Bubble compares pairs of values and needs multiple passes

Question 17

What are the similarities between bubble and insertion

Answer 17

Both produce sorted lists and work left to right

Question 18

What is the purpose of a truth table

Answer 18

To show all possible inputs and the associated output