DSA

D

19. The difference between linear array and a record is A. An array is suitable for homogeneous data but hte data items in a record may have different data type B. In a record, there may not be a natural ordering in opposed to linear array. C. A record form a hierarchical structure but a lienear array does not D. All of above

A

11. Which of the following data structures are indexed structures? A. linear arrays B. linked lists C.both of above D. none of above

C

12. 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

D

13. Which of the following is not a limitation of binary search algorithm? A. must use a sorted array B.requirement of sorted array is expensive when a lot of insertion and deletions are needed C.there must be a mechanism to access middle element directly D. binary search algorithm is not efficient when the data elements are more than 1000.

B

14. Two dimensional arrays are also called A. tables arrays B. matrix arrays C.both of above D. none of above

A

16. Which of the following data structure can't store the non-homogeneous data elements? A.Arrays B. Records C. Pointers D. None

B

17. Which of the following data structure store the non-homogeneous data elements? A.Arrays B. Records C.Pointers D.None

D

18. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called A.elementary items B.atoms C. scalars D. all of above

A

15. A variable P is called pointer if A. P contains the address of an element in DATA B P points to the address of first element in DATA C.P can store only memory addresses D. P contain the DATA and the address of DATA

C

2. Which of the following data structure is linear data structure? A.Trees B. Graphs C. Arrays D.none of the above

C

1. Which of the following data structure is non linear data structure? A.Arrays B. Linked lists C.Trees D.None of above

A

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. 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 abo

C

20. Which of the following statement is false? A.Arrays are dense lists and static data structure B.data elements in linked list need not be stored in adjecent space in memory C. pointers store the next data element of a list D. linked lists are collection of the nodes that contain information part and next pointe

D

3. The operation of processing each element in the list is known as A.Sorting B. Merging C. Inserting D.Traversal

B

4. Finding the location of the element with a given value is: A. Traversal B. Search C. Sort D.None of above

A

5. Arrays are best data structures A. for relatively permanent collections of data B.for the size of the structure and the data in the structure are constantly changing C. for both of above situation D. for none of above situation

B

6. Linked lists are best suited A. for relatively permanent collections of data B.for the size of the structure and the data in the structure are constantly changing C. for both of above situation D. for none of above situation

C

7. Each array declaration need not give, implicitly or explicitly, the information about A. the name of array B.the data type of array C. the first data from the set to be stored D. the index set of the array

A

8. The elements of an array are stored successively in memory cells because A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated B. the architecture of computer memory does not allow arrays to store other than serially C. both of above D.none of above

D

9. The memory address of the first element of an array is called A. floor address B.foundation address C. first address D. base addres