Flashcards
Fundamentals of Programming Wk1 Algorithms
Cards in this deck (11)
- 1Algorithm (formal define)well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time.
- 2Things an algorithm can doSequence
Selection
Iteration - 3What is "structure theorem"?The combination of the 3 "structures" of an algorithm (Sequence, Selection, Iteration)
- 4Define "sequence"Steps that are executed in a set order
- 5Types of steps in a sequential algorithm1. Computational (e.g. making a calculation)
2. Input/output (input data e.g. user types on keyboard; output data, e.g. to screen) - 6Selection in an algorithm (define)Making a choice based on true/false result of an expression
(..if this, do this, else, do that, noting that these are then sequential steps) - 7IterationRepetition of steps based on true/false expression
- 8Algorithm (me summary)Sequential selection and iteration based on truth/falsity of expressions
- 9Two types of language for algorithmic representation1. Structured English (formal, with indents)
2. Pseudocode (abbrev. English phrases) - 10name for checking an algorithm works!Desk checking
- 11Steps in algorithm designhigh-level
Decompose
write algorithms (struct. Eng/pseudocode)
Desk checking (practise run)
Test set (full check)
Implement
syntax (of computer language)
Information
- Description
- - Computing Flashcards on Fundamentals of Programming Wk1 Algorithms, created by jeremy parry on 24/02/2018.
- Created by
- jeremy parry
- Views
- 1
- Rating
More on Algorithms and Flowcharts