Chapter 7 Flashcards
Algorithm
A series of steps to solve a problem. Can be expressed in structured English, pseudocode or as a flowchart (also called flow diagram).
Flowchart/Flow Diagram
A diagram using commonly defi ned symbols to express an algorithm.
Structured English
A way of writing an algorithm in natural language using some basic programmingconstructs such as IF…THEN…ELSE and loops. More structured than just natural language/prose.
Pseudocode
A way of writing an algorithm that is close to actual programming language, usingcoding-style constructs such as IF…THEN…ELSE, loops and array notation as appropriate.
Hungarian Notation
The convention of prefi xing identifiers to indicate what type of object they are.Commonly used with forms where, for example the prefix txt might indicate a textbox and lst might prefix a list box. The prefix is conventionally in lowercase.
camelCase
The use of capital letters in an identifier to make them more readable. With camelCase the first word is not capitalised:txtCustomer, lstCounty, frmAddCustomer, btnSubmit
PascalCase
The use of capital letters in an identifier to make it more readable. For example,variable and procedure identifiers: StudentNumber, ProductID, StartPoint, CalcTotal
(programming) Sequence
Where instructions are executed one after another in series.
(programming) Selection
Where the program will execute certain instructions based on conditions. Selectionstatements include: IF…THEN…ELSE and CASE…OF to select which commands to execute.
(programming) Iteration
Where a program will execute a group of instructions zero or more times based on a condition. FOR loops will execute instructions a specific number of times, REPEAT…UNTIL loops one or more times and WHILE…DO loops zero or more times.
(programming) Condition
A boolean expression that controls an iteration or selection statement. Forexample, REPEAT…UNTIL X=10, where X=10 is the condition.
(programming) Boolean Expression
An expression that is true or false. For example: continue=”Y”Expressions can be more complex, containing several parts: ((continue=”Y”) or (continue=”y”)) and (tries
High Level Programming Language
A programming language where programming constructs are written in a waythat is close to natural language instead of in mnemonics or machine code. For example, Delphi, Pascal, Visual Basic, Java, C++.
Imperative Language
Programming language such as Python or Delphi which uses a sequence of statements to determine how to reach a certain goal or solve a problem.
Assembly Language
Second generation programming language where instructions are in the form ofmnemonics.
Mnemonics
Abbreviations representing commands used in assembly language programming.For example, LDA, STO, ADX.