2.1 Algorithms

Question 1

How can algorithms be written -

Answer 1

As flowcharts, pseudocode or python

Question 1

Algorithms

Answer 1

a step-by-step set of instructions to solve a problem.

Question 2

What is pseudocode?

Answer 2

Code written in English. The idea is that programmers can plan an algorithm before they actually start programming it.

Question 3

Flowcharts -

Answer 3

Another way to design algorithms that all programmers will be able to understand and implement in their own programming language.

Question 4

Linear search

Answer 4

Just looks through each item in the list until it finds it.

Question 5

Binary search

Answer 5

Finds the middle value of the list. Breaks the list in two, sees if it is above or below the middle. If it is above, it will then discard the bottom half of the list. It will then break the top half in two. Again, it checks if it is above or below, if it is below, it will discard the top half and so on until it finds the item.

Question 6

Bubble sort

Answer 6

Swaps values in to order with each iteration until they are in order.

Question 7

Merge sort -

Answer 7

Breaks the lists into smaller lists and rearranges and merges them into the correct order.

Question 8

Insertion sort -

Answer 8

Takes the list values out and inserts them into the correct order.

Question 9

Abstraction -

Answer 9

Removing unnecessary details. Focusing only on the details you want.

Question 10

Decomposition -

Answer 10

Breaking a problem down into smaller solvable sub-problems.

Question 11

Algorithmic Thinking -

Answer 11

Creating step-by-step instructions to solve a problem using computers.

Question 12

Syntax Errors -

Answer 12

Will cause an error. Your code will not run.

Question 13

Logic Errors -

Answer 13

Will not cause an error. Your code will run, but not as intended.

Question 14

Structure Diagrams -

Answer 14

Can be used to show how a program can be DECOMPOSED into separate SUB- ROUTINES.