Please enable JavaScript.
Coggle requires JavaScript to display documents.
Unit 4.1 Digital Analysis - Coggle Diagram
Unit 4.1 Digital Analysis
ALGORITHMS
A plan, or well-defined set of step-by-step instructions, to solve a problem. Supports problem solving
Advantages- Step by step representation of a solution to a given problem. Easy to understand
Disadvantages- Creating an algorithm can be time consuming.
CHARACTERISTICS OF A PROBLEM
Finiteness- The algorithm should solve the problem in a given number of steps.
Unambiguous- The steps must be clear and precise, with the steps clearly defined.
Inputs and outputs- Should be clearly defined. Each algorithm should have 0 or more inputs and at least 1 output.
The outputs should meet the defined purpose of the algorithm.
Logical sequencing of steps
Selection- Any input into the algorithm should lead to a specified step.
Feasibility- The algorithm should have step-by-step directions which should be independent of an programming code.
Applications of algorithms for digital analysis
To automate calculations to improve efficiency of a process
Design a step-by-step solution to solve a problem
Support machine learning for data analysis.
4.2 PROCESS OF COMPUTATIONAL THINKING
Decomposition helps clarify the stages required to complete a task
Abstraction- The filtering out of details that are not needed to complete a task.
Top-down approach is used to solve problems where the problem is broken down into smaller and smaller problems. Uses decomposition until no more decomposition can be carried out.
Bottom-up approach starts with the smallest part of the problem. These are then combined to move up a level and this then carries on until the complete problem is solved.
Advantages and disadvantages of decomposition
Different people can work on the different sub-tasks which can be intergrated to make the final solution.
If the initial problem is not fully understood, then it can be difficult to decompose.
Abstraction enables a general idea of what a problem is and how it can be solved.
Algorithms and actions, the actions that can be taken in algorithms include:
Sequence: The specific order in which instructions are performed in an algorithm.
Selection: A decision or question
Iteration: Repeating steps, or instructions, over and over again until a condition is met.
TOOLS FOR PROBLEM SOLVING AND ALGORITHM DESIGN
Decomposition diagram- Shows the tasks in the simplest form and how they link together.
Pseudo code- Informal programming description showing the flow through the process.
Enables the logic, including the sequence, selection and iteration of the pseudocode, to be the main focus.
It can be easy to follow and understand even if errors are prevent in the pseudo code.
Can act as a link between the algorithm and the final program.
But it can be time-consuming to write clear and well-structured pseudo code as it is to write the final programming code.
Flowchart- Makes use of a standardized set of symbols which are connected by lines showing the flow of the algorithm.