Data Structures and Algorithms MCQs Test 5 Online For Preparation

1. Which of the following data structure can't store the non-homogeneous data elements ?

A. None

B. Records

C. Arrays

D. Pointers

2. 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 DATA

D. P contains the address of an element in DATA.

3. Each data item in a record may be a group item composed of sub-items; those items which are inde-composable are called ?

A. Atoms

B. Scalars

C. Elementary items

D. All of above

4. Which of the following is not a limitation of binary search algorithm ?

A. Binary search algorithm is not efficient when the data elements are more than 1000

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. Must use a sorted array

5. Which of the following is not the required condition for binary search algorithm ?

A. None of above

B. There must be mechanism to delete and/or insert elements in list

C. There should be the direct access to the middle element in any sub list

D. The list must be sorted

6. Two dimensional arrays are also called ?

A. None of above

B. Both of above

C. Tables arrays

D. Matrix arrays

7. The memory address of the first element of an array is called ?

A. Base address

B. Foundation address

C. Floor address

D. First address

8. Which of the following data structures are indexed structures ?

A. Both of above

B. Linear arrays

C. Linked lists

D. None of above

9. Which of the following data structure store the homogeneous data elements ?

A. None

B. Records

C. Arrays

D. Pointers

10. 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. None of above

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[5])+(5-lower bound), where w is the number of words per memory cell for the array

Data Structures and Algorithms MCQs Test 5 Online For Preparation

Leave a Reply Cancel reply