Topic 2-Programming

Topic 2-Programming

1. Representing Algorithms

   • Algorithms can be represented in many different ways. They can be shown in written diagrams, pseudocode, and flowcharts.
     • Pseudocode is a middle ground between python and written description. Pseudocode is mainly used to plan out programs, which is then written in python.
     • Another way to represent Algorithms is through flowcharts. Flowcharts are a step of instructions that are shown in shapes. Flowcharts start and end with the oval 'start' and 'end' symbols. Inputs and outputs are shown as parallelograms and processes as rectangles.

2. Abstraction and Decomposition

   • Abstraction is the process of removing unnecessary details from the more important ones.
     • Decomposition is the process of breaking down problems into smaller sub-problems to make the task easier.
     • In the problem solving process, Abstraction comes first. This allows main problem to be prioritised and to then solve it.

3. Searches and Sorts

   • Searches
     • Linear search is a type of a search algorithm. It compares one part of data to the rest of the data. This is repeated until either a matching data type is found, or if it reaches the end without find a matching data type.
     • Binary search splits the data in half, then splits again and again until the matching data type is found
   • Sorts
     • A type of sorting algorithm is Bubble Sort.
       • Bubble Sort is a sorting algorithm that works by comparing a pair of adjacent items. Any items in the wrong order is exchanged, or passed. The algorithm is finished when they go through without having to exchange, or passed.
     • Another type of sorting algorithm is Merge Sorts.
       • Merge sorts breaks down large lists into smaller lists. It then sorts each of the smaller lists and eventually merges them back together into one large list.

4. What Are Algorithms?

   • Algorithms are a step by step process to solve a problem.
     • You have to be specific when laying out an algorithm for a computer as they have to know everything step by step.

5. Trace Tables

   • A trace table would show the results of every iteration of the loop, keeping track of the values of each of the variables. It would also leave space for comments, to help anyone who reads the table later.