Cambridge IGCSE Computer Science: Data Representation and Software Development

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/40

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering software development life cycle stages, binary and hexadecimal arithmetic, binary shifts, two's complement, ASCII, Unicode, digital sound sampling, bitmap image representation, and data compression techniques.

41 Terms

1
New cards

Waterfall development

A linear software development methodology where progress flows sequentially through distinct stages: Analysis, Design, Coding, and Testing.

2
New cards

Analysis stage

The initial stage of the software life cycle that involves examining the problem computationally, employing abstraction and decomposition to identify the core problem and establish user requirements.

3
New cards

Requirements specification

A formal document created after decomposing a problem that outlines the necessary features, inputs, outputs, and constraints the software must fulfill.

4
New cards

Problem decomposition

The process of breaking down a complex problem into smaller, solvable parts from the client's perspective, identifying each part that needs solving rather than how it will be coded.

5
New cards

Abstraction

The computational thinking technique of removing unnecessary details from a problem to concentrate solely on the essential components needed to solve it.

6
New cards

Design stage

The life cycle stage that takes the requirements from the analysis stage and determines how the software will be constructed, including the overall program structure, algorithms, inputs, processes, outputs, and storage.

7
New cards

Structure diagram

A hierarchical design diagram using boxes and branches to graphically show how a system is repeatedly decomposed into smaller, manageable sub-systems.

8
New cards

Pseudocode

A language-independent method of writing out algorithms that resembles programming code and is easy for programmers to read regardless of the programming language they use.

9
New cards

Iterative testing

Testing conducted continuously throughout the coding stage, where the program is checked and verified after each iteration when a new feature is added or an error is fixed.

10
New cards

Testing stage

The final stage of the development life cycle where a completed program is executed with planned test data to verify that the actual output matches expected results.

11
New cards

Hexadecimal

A base-1616 numbering system that utilizes the digits 0–90\text{--}9 and letters A–F\text{A}\text{--}\text{F} to represent binary data in a compact, human-readable format.

12
New cards

Nibble

A group of 4 bits4\,\text{bits} of binary data, equivalent to exactly one hexadecimal digit.

13
New cards

Overflow error

An error that occurs when the numerical result of a binary addition is too large to be stored within the fixed register size or number of bits allocated by the computer architecture (e.g., exceeding 255255 in an 8 bit8\,\text{bit} register).

14
New cards

Logical left shift

A bitwise operation that shifts all bits in a binary number to the left and inserts zeros into the vacated least significant bits, effectively multiplying the number by 22 for each place shifted.

15
New cards

Logical right shift

A bitwise operation that shifts all bits in a binary number to the right and inserts zeros into the vacated most significant bits, effectively dividing the number by 22 and discarding any fractional remainder.

16
New cards

Loss of precision

The permanent loss of fractional data that occurs during a logical right shift when 1 bits1\,\text{bits} are shifted out beyond the least significant bit.

17
New cards

Two's complement

A method used to represent positive and negative binary integers where the most significant bit carries a negative weight (such as −128-128 in an 8 bit8\,\text{bit} number); negative values are derived by inverting all bits of the positive equivalent and adding 11.

18
New cards

Character set

A defined collection of characters, digits, symbols, and control codes that can be recognized, processed, and represented in binary by a computer system.

19
New cards

ASCII

American Standard Code for Information Interchange; a 7-bit character encoding system that represents 128128 characters, including uppercase and lowercase English letters, numbers 0–90\text{--}9, punctuation symbols, and control codes.

20
New cards

Extended ASCII

An 8-bit character encoding system that expands the standard character set to encode up to 256256 characters (282^8), accommodating additional symbols, accents, and non-English characters.

21
New cards

Unicode

A universal character encoding standard using 16-bit (65,53665{,}536 characters) or 32-bit (over 4 billion4\,\text{billion} characters) representations to support global alphabets, diverse scripts, and emojis.

22
New cards

Concatenation

The programming operation of linking two or more strings together end-to-end, commonly executed using the ++ operator.

23
New cards

Analogue sound

Continuous acoustic sound signals characterized by smooth, unbroken waves.

24
New cards

Digital sound

Discrete, non-continuous sound data created by repeatedly measuring, recording, and storing the amplitude values of an analogue wave as binary numbers.

25
New cards

Analogue to Digital Convertor (ADC)

A hardware device that converts continuous analogue audio signals into discrete digital binary data for processing and storage by a computer.

26
New cards

Digital to Audio Convertor (DAC)

A hardware device that converts discrete digital binary audio data back into continuous analogue sound waves for output through speakers or headphones.

27
New cards

Sample rate

The frequency at which amplitude measurements of an analogue sound wave are taken per second, measured in hertz (Hz\text{Hz}).

28
New cards

Sample resolution

Also called audio bit depth; the number of bits allocated to store each individual amplitude measurement of a sound sample.

29
New cards

Bitmap image

A digital graphic format (also called a raster image) composed of a two-dimensional grid of picture elements called pixels.

30
New cards

Pixel

Short for picture element; the smallest identifiable, single-coloured unit in a bitmap graphic, represented by a binary value.

31
New cards

Image resolution

The total number of pixels comprising a digital image, calculated by multiplying the image width by its height in pixels.

32
New cards

Colour depth

The number of bits (nn) allocated per pixel in an image, determining the total variety of available colours (2n2^n) that can be represented.

33
New cards

RGB colour model

An additive colour system where each pixel's colour is defined by varying intensities of red, green, and blue light, typically requiring 8 bits8\,\text{bits} per colour channel (0–2550\text{--}255) and 24 bits24\,\text{bits} per pixel (16.7 million16.7\,\text{million} colours).

34
New cards

PBM (Portable Bitmap)

A simple monochrome image file format that records image dimensions and represents black and white pixels directly with 1 s1\,\text{s} and 0 s0\,\text{s}.

35
New cards

Data compression

The application of algorithms to reduce the total number of bits required to represent data, decreasing storage requirements, reducing bandwidth consumption, and speeding up network transmission.

36
New cards

Decompression

The process of restoring compressed data back into its original or usable format for display, playback, or execution.

37
New cards

Lossy compression

A compression technique that permanently removes unnecessary or less perceptible data from files (e.g., JPEG, MP3, MP4), reducing file size significantly at the expense of original quality.

38
New cards

Lossless compression

A compression technique that reduces file size without discarding any data (e.g., PNG, ZIP, GIF, FLAC), allowing the original file to be reconstructed perfectly upon decompression.

39
New cards

Digital artefacts

Unintended visual imperfections, noise, or pixel blocks appearing in images and videos as a result of permanent data loss caused by lossy compression.

40
New cards

Run Length Encoding (RLE)

A lossless compression algorithm that identifies consecutive sequences of identical data values and encodes them as frequency/data pairs.

41
New cards

Buffering

The process of preloading a segment of streaming audio or video data into temporary memory before playback begins to prevent pauses or playback interruptions caused by network latency.