When determining the efficiency of algorithm, the space factor is measured by
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
Correct Answer :
A. Counting the maximum memory needed by the algorithm
Related Questions
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
The elements of an array are stored successively in memory cells because
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
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
mn
max(m,n)
min(m,n)
m+n-1
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
The term push and pop is related to the
array
lists
stacks
all of above
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
elementary items
atoms
scalars
all of above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
The Average case occur in linear search algorithm
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
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
For an algorithm the complexity of the average case is
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
push, pop
insert, delete
pop, push
delete, insert
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
saturated
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above