Software Engineering, Algorithm Design and Analysis Level 6 Diploma

Vocabulary flashcards covering key concepts from the Level 6 Diploma in Computing and Information Systems, specifically focusing on Software Engineering, Algorithm Design, and Analysis.

Formal Logic Paradigms

Techniques applied to help define and verify requirements for software.

Asymptotic Behaviour

The performance of an algorithm as the input size increases, which is described and analyzed both informally and formally.

Run-time Complexity

A measure of the time an algorithm takes to complete as a function of the input, especially significant in the design of sorting algorithms.

Memory Complexity

A measure of the storage or memory space required by an algorithm during execution.

Source-code Compilation Process

A procedure involving internal hardware components and low-level software components to convert code into a machine-readable format.

Low-level Software Components

Functional elements that, along with internal hardware, play a role in the compilation of source code.

Pseudo-code

A high-level description of an algorithm that targets qualities of being sophisticated and maintainable.

Sorting Algorithms

Algorithms whose run-time and memory complexities have specific implications for program design.