2.1)Algorithms

Question 1

What is abstraction?

Answer 1

• Ignore unnecessary information and focus on important facts

Question 2

Why would you use abstraction?

Answer 2

• Simplifies a problem to make it less complex. Makes it more straightfoward

Question 3

What is decomposition?

Answer 3

Breaks a problem down into smaller tasks making it easier to solve

Question 4

Why do people use decomposition?

Answer 4

• Different people work on different parts of a larger problem. Can be recombined to produce a full solution

Question 5

What is algorithmic thinking?

Answer 5

Final stage as logical steps are followed to solve a problem

Question 6

How is alorithmic thinking used?

Answer 6

• Is broken down using decomposition into smaller problems.

Question 7

What is an algorithm?

Answer 7

• A set of instructions presented in a logicalmsequence

Question 8

Whats a Linear search?

Answer 8

• Each data item is searched in order from first item to last as they were in a line.
• Not very efficient

Question 9

What is a binary search?

Answer 9

• Middle point of data is selected
• More efficient
• Data must already be sorted

Question 10

Whats a merge sort?

Answer 10

• divide and conquer
• Divides list into half until each data item is seperate

Question 11

Whats a bubble sort?

Answer 11

• Comparison of adjacent data elements
• Data elements are swapped if not in correct

Question 12

What is a curved rectangle?

Answer 12

Start/Stop terminator

Question 13

Whats a rectangle?

Answer 13

Operation (process)

Question 14

Whats a kite?

Answer 14

Decision

Question 15

Whats a paralellogram?

Answer 15

Input/output

Question 16

Whats a rectangle with lines on the side?

Answer 16

Subroutine

Question 17

Whats an Insertion sort?

Answer 17

• split into sorted values on left and unsorted on the right
• Values from unsorted are checked and put in correct position
• continues throughout the list