……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Correct Answer :
A. Queue
Related Questions
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
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
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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 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
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False
Which of the following statement is true ?
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.
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None 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
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
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
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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 algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
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 Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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 complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
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
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
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