______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Correct Answer :
A. Stack
Related Questions
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
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Which of the following is not the required condition for binary search algorithm?
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
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
Which of the following statement is false?
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
The term push and pop is related to the
array
lists
stacks
all of above
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
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
The difference between linear array and a record is
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
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
Which of the following data structure is not linear data structure?
Arrays
Linked lists
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
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
In linear search algorithm the Worst case occurs when
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
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Arrays are best data structures
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
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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