SOFTWARE DEVELOPMENT EXAM LATEST 2025 ACTUAL
EXAM QUESTIONS AND CORRECT ANSWERS (VERIFIED
ANSWERS); AGRADE
Data Types - ANS-The different forms that data may take. Specify what type of data will be stored in a
given instance.
Data Structure - ANS-A method of organising data to allow particular operations to be performed on
them efficiently. e.g. arrays, dictionaries
Array - ANS-An indexed collection of elements of the same data type. Often a replacement in a situation
where multiple variables of the same data type are created.
Record - ANS-A user created, fixed-length group of fields of various data types that may be treated as a
single unit. Represents a set of information about a specific entity.
Associative Array - ANS-Consisting of key value pairs, the data structure houses information of different
data types, indexed by a unique, user defined key.
Hash Table - ANS-An associative array data structure that utilises a hash function to index large amounts
of data records.
Hash Function - ANS-A calculation applied to a key (of a key value pair) to transform it into a unique
index for use in a hash table.
Design Brief - ANS-A document for a design project developed during the analysis stage outlining the
scope, function, timing budget etc. of the project.
Type Check - ANS-Validation based on the datatype of input data. Prevents data from being input in the
wrong form.
Range Check - ANS-Validation that ensures inputs are within a certain range (between a two values).
Existence Check - ANS-Validation that ensures data is present upon input. Prevents blank values from
entering the program.
, Empirical Data - ANS-Fact based, objective, quantitative data derived from observation, measurements,
counts etc.
Data Dictionary - ANS-A design tool summarising what data the solution will require and the properties
of this data.
Object Description - ANS-A design tool listing objects and their various specifications.
Pseudocode - ANS-Halfway between English and code. Allows for rapid planning of algorithms without
the need for proper syntax.
Mockup - ANS-A design tool used to display the interface features of a solution, often including various
annotations.
Testing - ANS-Pushing an algorithm to its limits through the use of test data, aiming to locate potential
errors/crashes within the solution.
Trace Table - ANS-A technique used to identify any logic errors in algorithms by tracing the value of data
line by line. Each column represents a variable or output and each row a value of that variable
Test Data - ANS-The values that are input during the testing process to check all possible outcomes of
the solution. Such data must be comprehensive, cover error situations and test boundary values.
Control Structures - ANS-The structures used in programming languages to control the flow of the
program. includes sequence, selection and iteration.
Sequence - ANS-A control structure that refers to the execution of one processing step after another,
executing each instruction in the order that it appears.
Selection - ANS-A control structure referring to the presentation of a condition and the choice between
two actions. (e.g. case, if)
Iteration - ANS-A control structure referring to the repeated execution of instructions while a condition
is true or until a statement is true or a specific number of times (e.g. do while, do until).
Internal Documentation - ANS-A set of non-executable comments that are added to a solutions source
code to make it easier to understand. Good comments don't repeat the code or explain it, they clarify its
intent.
Hungarian Notation - ANS-The prefix of an element's name is used to indicate the type of element it is.
e.g. "txtName", "cboSubject".
Camel Case - ANS-The beginning of a new word is marked by a capital letter (without spaces). e.g.
"TaxRate", "ReadNextRecord()"
Linear Search - ANS-The simplest form of search algorithm in which an algorithm checks every element
in a list whilst searching for a particular value.
EXAM QUESTIONS AND CORRECT ANSWERS (VERIFIED
ANSWERS); AGRADE
Data Types - ANS-The different forms that data may take. Specify what type of data will be stored in a
given instance.
Data Structure - ANS-A method of organising data to allow particular operations to be performed on
them efficiently. e.g. arrays, dictionaries
Array - ANS-An indexed collection of elements of the same data type. Often a replacement in a situation
where multiple variables of the same data type are created.
Record - ANS-A user created, fixed-length group of fields of various data types that may be treated as a
single unit. Represents a set of information about a specific entity.
Associative Array - ANS-Consisting of key value pairs, the data structure houses information of different
data types, indexed by a unique, user defined key.
Hash Table - ANS-An associative array data structure that utilises a hash function to index large amounts
of data records.
Hash Function - ANS-A calculation applied to a key (of a key value pair) to transform it into a unique
index for use in a hash table.
Design Brief - ANS-A document for a design project developed during the analysis stage outlining the
scope, function, timing budget etc. of the project.
Type Check - ANS-Validation based on the datatype of input data. Prevents data from being input in the
wrong form.
Range Check - ANS-Validation that ensures inputs are within a certain range (between a two values).
Existence Check - ANS-Validation that ensures data is present upon input. Prevents blank values from
entering the program.
, Empirical Data - ANS-Fact based, objective, quantitative data derived from observation, measurements,
counts etc.
Data Dictionary - ANS-A design tool summarising what data the solution will require and the properties
of this data.
Object Description - ANS-A design tool listing objects and their various specifications.
Pseudocode - ANS-Halfway between English and code. Allows for rapid planning of algorithms without
the need for proper syntax.
Mockup - ANS-A design tool used to display the interface features of a solution, often including various
annotations.
Testing - ANS-Pushing an algorithm to its limits through the use of test data, aiming to locate potential
errors/crashes within the solution.
Trace Table - ANS-A technique used to identify any logic errors in algorithms by tracing the value of data
line by line. Each column represents a variable or output and each row a value of that variable
Test Data - ANS-The values that are input during the testing process to check all possible outcomes of
the solution. Such data must be comprehensive, cover error situations and test boundary values.
Control Structures - ANS-The structures used in programming languages to control the flow of the
program. includes sequence, selection and iteration.
Sequence - ANS-A control structure that refers to the execution of one processing step after another,
executing each instruction in the order that it appears.
Selection - ANS-A control structure referring to the presentation of a condition and the choice between
two actions. (e.g. case, if)
Iteration - ANS-A control structure referring to the repeated execution of instructions while a condition
is true or until a statement is true or a specific number of times (e.g. do while, do until).
Internal Documentation - ANS-A set of non-executable comments that are added to a solutions source
code to make it easier to understand. Good comments don't repeat the code or explain it, they clarify its
intent.
Hungarian Notation - ANS-The prefix of an element's name is used to indicate the type of element it is.
e.g. "txtName", "cboSubject".
Camel Case - ANS-The beginning of a new word is marked by a capital letter (without spaces). e.g.
"TaxRate", "ReadNextRecord()"
Linear Search - ANS-The simplest form of search algorithm in which an algorithm checks every element
in a list whilst searching for a particular value.
