CompSci 1.4:Data Structures and Algorithms

A comprehensive set of vocabulary flashcards covering data types, data structures, algorithms, and key concepts related to computer science.

AND (∧)

A logical operator which returns TRUE (or 1) if and only if all inputs are TRUE (or 1).

ASCII

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

Binary

A number system that only uses ones and zeros to represent numbers (a 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 etc.).

Character

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

Denary

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

Floating Point Arithmetic

Performing arithmetic operations on floating point numbers in binary.

Hexadecimal

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

Integer

A data type for storing whole number values (positive or negative) with no decimal parts.

OR (∨)

A logical operator which returns TRUE (or 1) if and only if any one of the inputs are TRUE (or 1).

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 are all moved by one place in a given direction.

String

A data type for storing a sequence of alphanumeric characters or symbols, typically within quotation marks.

Two’s Complement

A method of storing negative numbers in binary by flipping all bits and adding 1.

UNICODE

A character set that is a superset of ASCII, representing characters as integer code points.

XOR

A logical operator which returns TRUE (or 1) if and only if exactly 1 of the inputs are TRUE (or 1).

Arrays

A data structure for storing a finite, ordered set of data of the same data type.

Binary Search Tree

A tree where each node cannot have more than 2 children, ordered by value.

Breadth First Traversal

A method of traversing a graph by visiting all neighbours of the first node.

Depth First Traversal

A method of traversing a graph by travelling as far as possible along one route.

Directed Graphs

A graph where the order of the vertices paired in an edge matter.

Graphs

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

Hash Table

A data structure where a hashing algorithm determines where a data item is stored.

Linked Lists

A data structure that stores an ordered sequence of data with pointers 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, based on attributes.

Stacks

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

Trees

A hierarchical data structure consisting of linked nodes starting from a root node.

Tuples

A data structure for storing an immutable, ordered set of data of different types.

Undirected Graphs

A graph where the order of vertices in an edge does not matter.

Association Laws

Laws of boolean algebra: A ∧ (B∧C) = (A∧B) ∧ C.

Boolean Expressions

A combination of boolean variables and logical operators that evaluates to TRUE or FALSE.

Boolean Logic

Algebra with logical operators reducing all values to TRUE or FALSE.

Commutation Laws

Laws stating A∧B = B∧A and A∨B = B∨A.

De Morgan’s First Law

¬(A∨B) = ¬A ∧¬B.

De Morgan’s Second Law

¬(A∧B) = ¬A ∨¬B.

Distribution Laws

Laws relating to distribution in boolean algebra.

Double Negation Law

A law stating A = ¬¬A.

D-Type Flip Flops

A sequential logic circuit used to store a single bit.

Full Adders

A combination of two half adders that return sum and carry outputs.

Half Adders

An arithmetic circuit that adds two numbers and produces sum and carry as output.

Karnaugh Maps

A method for simplifying boolean expressions visually.

Logic Gate Diagrams

A graphical representation of boolean expressions using logic gate symbols.