_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Correct Answer :
D. None of above
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
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
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
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 if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
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 case does not exist in complexity theory
Best case
Null case
Worst case
Average case
The term push and pop is related to the
array
lists
stacks
all of above
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
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
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
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the 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
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
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
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
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
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 situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
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
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists