Flashcard library · Data Structures
Computer Science: Data Structures
This flashcard deck covers fundamental concepts in Computer Science Data Structures, including common linear and non-linear structures, algorithmic complexity analysis, and essential terms. It's designed to help students grasp the core principles required for understanding how data is organized and efficiently managed.
Want to actually learn these?
Save this deck to your NoteFren library and study it with spaced repetition — or turn your own notes into cards like these.
What is a data structure?
A way of organizing data so it can be accessed and changed efficiently.
Name four linear data structures.
Arrays, linked lists, stacks and queues.
Name two non-linear data structures.
Trees and graphs.
What does time complexity measure?
How an algorithm's running time grows with input size.
What does space complexity measure?
How an algorithm's memory use grows with input size.
What is an array?
Elements stored in contiguous memory and accessed directly by index.
What is a linked list?
A sequence of nodes, each holding data and a reference to the next node.
What principle does a stack follow?
Last in, first out (LIFO): push adds to the top and pop removes from it.
What principle does a queue follow?
First in, first out (FIFO): enqueue at the back, dequeue from the front.
What is a tree?
A hierarchy of nodes where every node except the root has one parent.
What is a binary tree?
A tree in which each node has at most two children.
What is a hash table?
A structure mapping keys to values via a hash function, with O(1) average lookup.
What is a graph?
A set of vertices connected by edges.
What is a heap mainly used for?
Implementing priority queues, with fast access to the minimum or maximum.
Why are B-trees used for disk-based storage?
Each node holds many keys and children, keeping the tree shallow and cutting disk reads.