The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
Correct Answer :
A. underflow
Related Questions
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
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
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
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
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
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the 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
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
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
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
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
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
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
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14