Computing Revision mind map

Computing Revision mind map

1. What is a Algorithm?

   • An algorithm is a step by step procedure for solving problems.

2. What is decomposition?

   • Decomposition is breaking down a problem into easier to solve parts

3. What is the difference between an Algorithm and a computer program?

   • An algorithm is a self-contained step-by-step set of operations to be performed to solve a specific problem or a class of problems. A computer program is a sequence of instructions that comply the rules of a specific programming language , written to perform a specified task with a computer.

4. What is a linear search?

   • A linear search starts at the beginning of a list of values, and checks 1 by 1 in order for the result you are looking for.

5. What is abstraction?

   • Abstraction happens once we have recognised patterns in problems, we use abstraction to gather the general characteristics and to filter out of the details we do not need in order to solve our problem.

6. What is a binary search?

   • A binary search starts in the middle of a sorted array, and determines which side (if any) the value you are looking for is on.

7. Difference between Binary and Linear search

   • A linear search starts at the beginning of a list of values, and checks 1 by 1 in order for the result you are looking for. A binary search starts in the middle of a sorted array, and determines which side (if any) the value you are looking for is on.

8. What is merge sort?

   • Merge sort is a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms. Merge sort first divides the array into equal halves and then combines them in a sorted manner.

9. What is bubble sort?

   • Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.