Component 1.4: Data Types, Data Structures and Algorithms

AND (∧)

A logical operator that returns TRUE only if all inputs are TRUE

ASCII

A character set used to represent alphanumeric characters and symbols as a set of 8 bits

Binary

A number system that uses ones and zeros to represent numbers (base 2 system)

Bitwise Manipulation

Operations performed on a set of bits

Boolean

A data type that can only store one of two possible values: 1 or 0, TRUE or FALSE

Character

A data type for storing a letter, number, or special character

Denary

A number system that uses 10 characters (0 to 9) to represent numbers (base 10 system)

Floating Point Arithmetic

Performing arithmetic operations on floating point numbers in binary representation

Hexadecimal

A number system that uses 16 characters (0 to 9 and A to F) to represent numbers (base 16 system)

Integer

A data type for storing whole number values (positive or negative) without decimal parts

OR (∨)

A logical operator that returns TRUE if any one of the inputs is TRUE

Primitive Data Type

A basic built-in data type provided by a programming language

Real/Floating Point

A data type for storing numbers with decimal or fractional parts

Shifts

A bitwise manipulation where a set of bits is moved by one place in a given direction

String

A data type for storing a sequence of alphanumeric characters or symbols

Two's Complement

A method of storing negative numbers in binary by flipping all the bits of the positive number and adding 1

UNICODE

A character set used to represent alphanumeric characters or symbols as an integer code point

XOR

A logical operator that returns TRUE if exactly 1 of the inputs is TRUE

Arrays

A data structure for storing a finite, ordered set of data of the same data type within a single identifier

Binary Search Tree

A tree where each node has at most 2 children, with the right node and its descendants having greater values than the root node

Breadth First Traversal

A method of traversing an entire graph by visiting all the neighbors of the first node before repeating the same with each neighbor

Depth First Traversal

A method of traversing an entire graph by traveling as far as possible along one route before backtracking and trying alternative unexplored routes

Directed Graphs

A graph where the order of the vertices paired in an edge matters and the edges are one way

Graphs

A data structure consisting of a set of vertices/nodes connected by a set of edges/arcs

Hash Table

A data structure where a hashing algorithm calculates a value to determine where a data item is to be stored

Linked Lists

A data structure that stores an ordered sequence of data where each item is stored with a pointer to the next item

Lists

A data structure that stores a sequence of data values, each with a unique index

Queues

A first-in-first-out (FIFO) data structure

Records

A data structure that stores data in elements called fields, organized based on attributes

Stacks

A last-in-first-out (LIFO) data structure

Trees

A data structure that uses a set of linked nodes to form a hierarchical structure starting at a root node

Tuples

A data structure for storing an immutable, ordered set of data of different data types within a single identifier

Undirected Graphs

A graph where the order of the vertices paired in an edge does not matter and the edges are bidirectional

Association Laws

A set of logical laws: A ∧ (B∧C) = (A∧B) ∧ C, A ∨ (B∨C) = (A∨B) ∨ C

Boolean Expressions

Combinations of boolean variables and logical operators that evaluate to either TRUE or FALSE

Boolean Logic

A type of algebra with logical operators where all values and expressions ultimately reduce to TRUE or FALSE

Commutation Laws

A set of logical laws: A∧B = B∧A, A∨B = B∨A

De Morgan's First Law

A logical law: ¬(A∨B) = ¬A ∧ ¬B

De Morgan's Second Law

A logical law: ¬(A∧B) = ¬A ∨ ¬B

Distribution Laws

A set of logical laws: A∧(B∨C) = (A∧B) ∨ (A∧C), (A∨B) ∧ (C∨D) = (A∧C) ∨ (A∧D) ∨ (B∧C) ∨ (B∧D)

Double Negation Law

A logical law: A = ¬¬A

D-Type Flip Flops

Sequential logic circuits used to store a single bit with two stable states

Full Adders

Combination circuits that add two input bits and a carry bit to produce sum and carry output bits

Half Adders

Combinational arithmetic circuits that add two numbers and produce a sum bit and carry bit as output

Karnaugh Maps

A method of simplifying boolean expressions by redrawing the truth table and applying visual rules to obtain minimal logical operators

Logic Gate Diagrams

Graphical representations of boolean expressions using standard symbols for logic gates