A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
Correct Answer :
D. Deque
Related Questions
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
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
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
The complexity of merge sort 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
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 is not a limitation of binary search algorithm?
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
The memory address of fifth element of an array can be calculated by the formula
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above
If the values of a variable in one module is indirectly changed by another module, this situation is called
internal change
inter-module change
side effect
side-module update
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
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
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
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
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Linked lists are best suited
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
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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 data structure is non linear type?
Lists
Strings
Graph
Stacks
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 not linear data structure?
Arrays
Linked lists
Both of above
None of above
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue