1

Question 1

Decomposition (2)

Answer 1

• Breaking down a problem into more manageable parts that are easier to solve
• Different teams can work on different things + code can be reused

Question 2

Abstraction (1)

Answer 2

• Taking the basic details of a problem and representing them in a way the computer can understand

Question 3

Flowchart symbols: terminal (rounded box)

Answer 3

• Shows start and end of an algorithm

Question 4

Flowchart symbols: decision (diamond)

Answer 4

• Shows yes/no or true/false decisions where there are two possible outcomes

Question 5

Flowchart symbols: decision (diamond)

Answer 5

• Shows yes/no or true/false decisions where there are two possible outcomes

Question 6

Flowchart symbols: process (rectangle)

Answer 6

• Shows data processing e.g a calculation

Question 7

Flowchart symbols: subroutine (rectangle with lines)

Answer 7

• Shows a function or procedure that has its owns flowchart

Question 8

Flowchart symbols: line (arrow)

Answer 8

• Represents the code moving along

Question 9

Linear search

Answer 9

• The algorithm starts at the beginning of the list and moves through item by item or until it reaches the end of the list

Question 10

Best and worse case of linear search

Answer 10

• Best: the item is first term
• Worst: the item is the last term
  Can take a very short/long time therefore inefficient - hight average case

Question 11

Binary search

Answer 11

• Selects the median and determines if the item is above or below. Continues this process

Question 12

Pros and cons of binary search

Answer 12

• Very efficient
• List needs to be in order therefore can take longer

Question 13

Bubble sort

Answer 13

• Starts at beginning of list and exmines first 2 items

Question 14

Merge sort

Answer 14

• Breaks a list into its component parts and then builds them up in the correct order