3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
A. 3,4,5,2,1
sorted linked list
sorted binary trees
sorted linear array
pointer array
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
11
12
13
14
Arrays
Records
Pointers
None
Lists
Strings
Graph
Stacks
Stack
Queue
List
Link list
O(n)
O(log n)
O(n2)
O(n log n)
Last in first out
First in last out
Last in last out
First in first out
AVL tree
Red-black tree
Lemma tree
None of the above
array
lists
stacks
all of above
internal change
inter-module change
side effect
side-module update
Abstract level
Implementation level
Application level
All of the above
elementary items
atoms
scalars
all of above
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
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of above
Tree
Graph
Priority
Dequeue
FIFO lists
LIFO list
Piles
Push-down lists
Linked lists
Stacks
Queues
Deque
tables arrays
matrix arrays
both of above
none of above
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above
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)
grounded header list
circular header list
linked list with header and trailer nodes
none of above
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
Sorting
Merging
Inserting
Traversal
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
Data
Operations
Both of the above
None of the above
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
floor address
foundation address
first address
base address
Dynamic programming
Greedy method
Divide and conquer
Backtracking