click below
click below
Normal Size Small Size show me how
DT Unit 4 Definition
Digital Technology. Unit 4 Definitions
Term | Definition |
---|---|
Refinement | The process of reviewing the solution and making necessary changes so it meets user requirements accurately |
Conditional or unbounded repetition | The loop will run until a particular condition is true or false |
Execution errors (runtime errors) | Detected during execution and cause it to crash. This can be caused by division by zero. |
Insertion sort | A simple algorithm that builds a sorted sub-list one item at a time. The sub-list becomes the new sorted list. Each comparison examines two adjacent elements, and when a data item is swapped it's added to the sorted sub-list in the right order. |
Variable | A data value stored in memory that can change during program execution |
Arithmetic Operator | Enables arithmetic operations to be carried out on variables, (including +, -, *, /). |
Input Statement | A statement used to capture data which is to be used in the program. |
Assignment Statement | Assigns a value to a variable/constant/other data structure. |
Sequence | The order instructions are carried out. |
Data validation | Ensures that input data is complete, within specified boundaries and is sensible, which reduces the erroneous data in the system. |
Debugging | The process of detecting and correcting errors, possibly involving debug features, creating breakpoints, or going through code line by line. |
Error handling | The process of a program's attempt to deal with an error generated when running so it doesn't crash. When the error occurs an exception is raised that calls code to handle the error, or else it will crash. |
Test case | A document that contains a set of tests to help the programmer verify that the code works as expected. This includes expected results and actual outcomes. |
Program | A set of instructions that tells a computer how to solve a problem |
ASCII | American Standard Code for Information Interchange |
Decomposition | Breaking a complex problem down into smaller, more manageable sub-problems. These can be brought together to find an overall solution to a complex problem. |
Pattern recognition | Observing key characteristics, trends and patterns in data. |
Abstraction | Removing specific details from a problem that are not required to solve it. |
Algorithm | A step-by-step set of instructions that specifies how a problem is solved. The order is important, for example, flowcharts and pseudocode. |
Bubble sort | A simple method that repeatedly steps through a list of data items. Adjacent items are compared and swapped if they're in the wrong order. Data items bubble through the list until they're in order. Inefficient for large amounts of data. |
User Interface | Any part of the system that the user can interact with |
A dry run | A paper-based exercise that lets the programmer go step-by-step through code to highlight errors. It can be used at the design or coding stages, and involves creating a trace table with a list of variables after each line of code has been executed |
Boolean Operator | An operator that allows conditions to be combined and then evaluated, the outcome is a Boolean Variable. |
Output Statement | A statement used to output data and information. |
Selection | Only some lines of code need to be run if conditions are met. |
IF statement | Code is only executed if the IF |
Iteration | Repetition, used in loops to carry out code more than once. |
Unconditional repetition | There is a start value and a stop value for the loop |
Syntax errors | Occur when the program is written, and detected when it is compiled. |
Logic errors | Happen in programs that compile and run without error. The output produced is not the expected output, and can be detected during testing. |
White Box Testing | Tests the underlying structure of code to identify errors in syntax, logic, and data flow. A coder completes this because they have to know how coding works. |
Black Box Testing | The tester is unaware of the internal structure of the code so it focuses on inputs and outputs (interface problems). |
Robustness | A measure of the system's ability to continue to run when high volumes of valid or invalid data are entered. If a system doesn't crash when processing high volumes of data it is robust. |
Constant | A named location in computer memory used to hold data when a program is running. The value of the constant remains the same while the program is running. When declaring a constant it must be given a name and a data type. |
Array | A data structure that holds a set of data items of the same data type, (integer, string, etc). The array is assigned a name, a size (representing the number of data items to be stored) and a data type by the programmer. Arrays always start at position 0! |