Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Correct Answer :
A. Arrays
Related Questions
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 algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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 complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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 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.
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
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
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
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
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
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
A variable P is called pointer if
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
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
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The term push and pop is related to the
array
lists
stacks
all of above
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list