linear arrays
linked lists
both of above
none of above
A. linear arrays
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
Array
Stack
Tree
queue
Sorting
Merging
Inserting
Traversal
Last in first out
First in last out
Last in last out
First in first out
Arrays
Records
Pointers
None
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjacent space in memory
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer
push, pop
insert, delete
pop, push
delete, insert
Arrays
Records
Pointers
Stacks
mn
max(m,n)
min(m,n)
m+n-1
Stacks linked list
Queue linked list
Both of them
Neither of them
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
O(n)
O(log n)
O(n2)
O(n log n)
O(n)
O(log )
O(n2)
O(n log n)
Traversal
Search
Sort
None of above
floor address
foundation address
first address
base address
linear arrays
linked lists
both of above
none of above
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
Arrays
Linked lists
Both of above
None of above
Operations
Algorithms
Storage Structures
None of above
Queue
Stack
List
None of the above
Tree
Graph
Priority
Dequeue
internal change
inter-module change
side effect
side-module update
underflow
overflow
housefull
saturated
Graph
Binary tree
Trees
Stack
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Application level
Abstract level
Implementation level
All of the above
FIFO lists
LIFO list
Piles
Push-down lists
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
Binary search
Insertion sort
Radix sort
Polynomial manipulation