ENGG1003 Lecture 2: ENGG1003 W01L02

• School: University of Newcastle
• Department: Engineering and Related Technologies
• Course: ENGG1003
• Professor: Brenton

Document Summary

Algorythms are a series of steps which accomplish a task: have a strict order, be unambiguous, be executable (the target platform is capable of performing the task) Psudocode is used to communicate algorithms to other people. Instructions in an algorithm that execute in an ordered list: flow control changes the order of execution from the default top-to-bottom. If statements and loops: almost always require a condition. Computers require an absolute true or false: boolean statement. A set of instructions which are for any reason grouped together. An operand is a value on which a mathematical operation takes place. Or true if either operand is true. And true when both operands are true: x = a + b, x = a*b. Or and and are binary operator: operate on two operands. Not operator is unary: operates on one operand.