Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure store the homogeneous data elements?
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
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
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
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.
Two dimensional arrays are also called
tables arrays
matrix arrays
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
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque