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