Data structure mcq

The memory address of the first element of an array is called a. floor address b. foundation address c. first address d. base address The memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above Which of the following data structure can't store the non-homogeneous data elements? a. Arrays b. Records c. Pointers d. None Which of the following data structure store the homogeneous data elements? a. Arrays b. Records c. Pointers d. None Which of the following is not the required condition for binary search algorithm? a. The list must be sorted b. there should be the direct access to the middle element in any sublist c. There must be mechanism to delete and/or insert elements in list d. none of above When new data are to be inserted into a data structure, but there is no available space; this situation is usually called a. underflow b. overflow c. housefull d. saturated The situation when in a linked list START=NULL is a. underflow b. overflow c. housefull d. saturated Two dimensional arrays are also called a. tables arrays b. matrix arrays c. both of above d. none of above Which of the following is two way list? a. grounded header list b. circular header list c. linked list with header and trailer nodes d. none of above Which of the following name does not relate to stacks? a. FIFO lists b. LIFO list c. Piles d. Push-down lists The term "push" and "pop" is related to the a. array b. lists c. stacks d. all of above A data structure where elements can be added or removed at either end but not in the middle a. Linked lists b. Stacks c. Queues d. Deque When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return a. FAEKCDBHG b. FAEKCDHGB c. EAFKHDCBG d. FEAKDCHBG What is the worst case time complexity of linear search algorithm? A - Ο(1) B - Ο(n) C - Ο(log n) D - Ο(n2) Two main measures for the efficiency of an algorithm are • A. Processor and memory • B. Complexity and capacity • C. Time and space • D. Data and space The complexity of Bubble sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n) Which of the following data structure is not linear data structure? a. Arrays b. Linked lists c. Both of above d. None of above Which of the following case does not exist in complexity theory a. Best case b. Worst case c. Average case d. Null case The complexity of Binary search algorithm is a. O(n) b. O(log ) c. O(n2) d. O(n log n)