QUIZ SECTION
Q1. The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Q2. Which of the following data structures are indexed structures?
linear arrays
linked lists
Both a and b
None of the above
Q3. 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 sublistr
There must be mechanism to delete and/or insert elements in list
None of the above
Q4. 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.
Q5. Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Q6. 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
Q7. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Q8. Two main measures for the efficiency of an algorithm are?
Processor and memory
Complexity and capacity
Time and space
Data and space
Q9. The Worst case occur in linear search algorithm when
Item is somewhere in the middle of the array
Item is not in the array at all
Item is the last element in the array
Item is the last element in the array or is not there at all
Q 10. The complexity of merge sort algorithm is
O(n)
O(log n)
O(n^2)
O(n log n)
Your Score :