Run an Algorithm: Difference between revisions
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
==== For example, here's a 'run' of the algorithm for slving for the forces at joint B in the Nodal Analysis key example: ==== | ==== For example, here's a 'run' of the algorithm for slving for the forces at joint B in the Nodal Analysis key example: ==== | ||
{| class="wikitable" | |||
|+ | |||
! colspan="2" |Isolate Joint B | |||
|- | |||
|{{#drawio:joint_B_diagram_1|type=png}} | |||
|{{#drawio:joint_B_diagram_2|type=png}} | |||
|- | |||
| | |||
| | |||
|- | |||
| | |||
| | |||
|} | |||
Revision as of 16:55, 23 December 2020
The term running an algorithm I use to mean doing a set of calculations:
What do you need to know to run an algorithm in an examination?
- You need to understand the meanings of all variables to an extent that you are able to assign correct values to them.
- You need to be able to write down the steps in the algorithm.
- You need to be able to run the algorithm.
For example, here's a 'run' of the algorithm for slving for the forces at joint B in the Nodal Analysis key example:
| Isolate Joint B | |
|---|---|
joint_B_diagram_1 empty app.diagrams.net chart |
joint_B_diagram_2 empty app.diagrams.net chart |
