Data Structures and Algorithms MCQs Test 5 Online For Preparation Malik Asghar — April 20, 2018 in Mathematics Test • add comment Data Structures and Algorithms MCQs Test 5 Online For Preparation 1. Two dimensional arrays are also called ?A. Matrix arrays B. None of aboveC. Both of above D. Tables arrays Loading... 2. A variable P is called pointer if ?A. P contains the address of an element in DATA. B. P contain the DATA and the address of DATAC. P points to the address of first element in DATA D. P can store only memory addresses Loading... 3. The memory address of fifth element of an array can be calculated by the formula ?A. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array B. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array C. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array D. None of above Loading... 4. Which of the following is not the required condition for binary search algorithm ?A. There should be the direct access to the middle element in any sub list B. There must be mechanism to delete and/or insert elements in list C. None of aboveD. The list must be sorted Loading... 5. Each data item in a record may be a group item composed of sub-items; those items which are inde-composable are called ?A. All of aboveB. Scalars C. Elementary items D. Atoms Loading... 6. Which of the following data structure store the homogeneous data elements ?A. Arrays B. Pointers C. NoneD. Records Loading... 7. Which of the following data structure can't store the non-homogeneous data elements ?A. NoneB. Records C. Arrays D. Pointers Loading... 8. Which of the following data structures are indexed structures ?A. Both of above B. Linear arrays C. Linked lists D. None of above Loading... 9. The memory address of the first element of an array is called ?A. Base addressB. Floor address C. Foundation address D. First address Loading... 10. Which of the following is not a limitation of binary search algorithm ?A. There must be a mechanism to access middle element directly B. Binary search algorithm is not efficient when the data elements are more than 1000C. Requirement of sorted array is expensive when a lot of insertion and deletions are needed D. Must use a sorted array Loading... Loading... Related NTS Results Post:Biology Mcqs Test 08 Online PreparationBiology Mcqs Test 07 Online PreparationBiology Mcqs Test 06 Online PreparationBiology Mcqs Test 09 Online PreparationChemistry MCQs Test 07 Online PreparationChemistry MCQs Test 05 Online PreparationChemistry MCQs Test 06 Online PreparationIslamiat Mcqs Test 03 Online Preparation
