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. Which of the following is not the required condition for binary search algorithm ?A. There must be mechanism to delete and/or insert elements in list B. The list must be sorted C. None of aboveD. There should be the direct access to the middle element in any sub list Loading... 2. Which of the following is not a limitation of binary search algorithm ?A. Must use a sorted array B. There must be a mechanism to access middle element directly C. Requirement of sorted array is expensive when a lot of insertion and deletions are needed D. Binary search algorithm is not efficient when the data elements are more than 1000 Loading... 3. Which of the following data structure can't store the non-homogeneous data elements ?A. Arrays B. Pointers C. Records D. None Loading... 4. A variable P is called pointer if ?A. P can store only memory addresses B. P points to the address of first element in DATA C. P contain the DATA and the address of DATAD. P contains the address of an element in DATA. Loading... 5. Two dimensional arrays are also called ?A. Matrix arrays B. None of aboveC. Both of above D. Tables arrays Loading... 6. Which of the following data structure store the homogeneous data elements ?A. Arrays B. NoneC. Pointers D. Records Loading... 7. The memory address of the first element of an array is called ?A. Foundation address B. First address C. Base addressD. Floor address Loading... 8. Each data item in a record may be a group item composed of sub-items; those items which are inde-composable are called ?A. Scalars B. All of aboveC. Atoms D. Elementary items Loading... 9. Which of the following data structures are indexed structures ?A. None of aboveB. Linear arrays C. Linked lists D. Both of above Loading... 10. 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... Loading... Related NTS Results Post:Biology Mcqs Test 06 Online PreparationBiology Mcqs Test 08 Online PreparationBiology Mcqs Test 09 Online PreparationBiology Mcqs Test 10 Online PreparationBiology Mcqs Test 11 Online PreparationBiology Mcqs Test 07 Online PreparationChemistry MCQs Test 05 Online PreparationBiology Mcqs Test 14 Online Preparation
