Algorithms
4 important questions on Algorithms
What is a 'Dry run'?
What is a 'Trace table'?
What are the steps to correcting an algorithm?
1. Read what the algorithm needs to do (read at least twice).
2. Work out what it should to in note form (draft the steps that should take place).
3. Trace, or read through each step of the algorithm.
4. Compare what the algorithm does to your notes about what it needs to do.
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
What is a 'NOT' gate?
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding