1
Q
Difference between static and dynamic data structure
A
Static has a fixed size
While dynamic can change
2
Q
How do stacks behave
A
On a First In Last Out (FILO)
3
Q
What are the 5 operations of a stack
A
Peek
Pop
Push
IsEmpty
IsFull
4
Q
What does Peek do
A
Returns the top item without removing it
5
Q
What does Pop do
A
Returns the top item and removes it
6
Q
What does Push do
A
Adds a new item on top
7
Q
What does IsEmpty do
A
Checks if the stack is empty
8
Q
What does IsFull do
A
Check if the list is full.
*In python would be better to check the length as lists in python are dynamic
9
Q
A
Computer Science: Paper 1
flashcards
Decks in class (23)
# Cards
-
Programming (Python)27
-
List methods (Python)9
-
File Object methods (Python)7
-
OOP (Python)11
-
Stacks9
-
Call Stack (Heap)7
-
Queues15
-
Hash tables9
-
Dictionaries2
-
Graphs9
-
Trees7
-
Vectors3
-
Graph traversal algorithm6
-
Searching algorithms2
-
Optimisation algorithms2
-
Sorting algorithms3
-
Reverse Polish Notation4
-
Big O notation8
-
Finite State machines8
-
Turing machine8
-
Maths for Regular expression (Regex)13
-
Regular expression (Regex)7
-
Backaus-Naur Form9
