1.4
Data Types, Data Structures and Algorithms
Primitive types, abstract data types, and algorithm complexity
Data typesData structuresBoolean algebra
Primitive types: integer, real, boolean, character, string
Arrays are contiguous memory, fast access O(1), fixed size
Linked lists have dynamic size, O(n) access, O(1) insertion
Stacks are LIFO: push, pop, peek operations
Queues are FIFO: enqueue, dequeue operations
Trees have root, nodes, leaves; binary trees have max 2 children
Graphs represent relationships with nodes and edges
Hash tables provide O(1) average access using hash functions
Exam Tips
- •Always define key terms before explaining concepts
- •Use specific examples where possible to demonstrate understanding
- •Check mark allocation - one point per mark is a good guide