Array
Stack
Tree
queue
D. queue
Processor and memory
Complexity and capacity
Time and space
Data and space
16
12
6
10
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
sorted linked list
sorted binary trees
sorted linear array
pointer array
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Last in first out
First in last out
Last in last out
First in first out
Traversal
Search
Sort
None of above
Lists
Strings
Graph
Stacks
Binary search
Insertion sort
Radix sort
Polynomial manipulation
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Abstract level
Implementation level
Application level
All of the above
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
List
Stacks
Trees
Strings
mn
max(m,n)
min(m,n)
m+n-1
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
Stack
Queue
List
Link list
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
Tree
Graph
Priority
Dequeue
O(n)
O(log )
O(n2)
O(n log n)
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
Arrays
Records
Pointers
None
Queue
Stack
List
None of the above
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
internal change
inter-module change
side effect
side-module update
underflow
overflow
housefull
saturated
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
Graph
Binary tree
Trees
Stack
Arrays
Linked lists
Both of above
None of above
Best case
Null case
Worst case
Average case