Notes From Section up to Midterm Flashcards
1
Q
Calculating amortized aggragate analysis of Dynamic Array Insert
A
2
Q
Dynamic Array Operations
A
Get, Set, Insert, Remove
3
Q
What to track for Dynamic Array
A
Data, Size, capacity
4
Q
Bag ADT operations
A
5
Q
What is encapsulation
A
6
Q
What are iterators?
A
7
Q
What are the required operations for linked lists?
A
As well as remove.
8
Q
What is a doubly linked list?
A
A linked list that keeps track of the previous and next nodes
9
Q
What is another name for a linked list sentinel?
A
headers
10
Q
What are the required operations for stacks?
A
11
Q
What are the required operations for queue?
A
12
Q
What are the required operations for a deque?
A
