Data Structures and Algorithms MCQs Test 2 Online For Preparation

1. The indirect change of the values of a variable in one module by another module is called ?

A. side effect

B. internal change

C. inter-module change

D. side-module update

2. Which of the following data structure is not linear data structure?

A. Linked lists

B. Arrays

C. Both of above

D. None of above

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

4. Each array declaration need not give, implicitly or explicitly, the information about ?

A. the first data from the set to be stored

B. the data type of array

C. the name of array

D. the index set of the array

5. The operation of processing each element in the list is known as ?

A. Sorting

B. Traversal

C. Merging

D. Inserting

6. Linked lists are best suited ?

A. for relatively permanent collections of data

B. for none of above situation

C. for both of above situation

D. for the size of the structure and the data in the structure are constantly changing

7. Which of the following data structure is linear data structure?

A. Graphs

B. None of above

C. Trees

D. Arrays

8. Finding the location of the element with a given value is ?

A. Traversal

B. Search

C. None of above

D. Sort

9. The complexity of merge sort algorithm is ?

A. O(n log n)

B. O(n)

C. O(n2)

D. O(log n)

10. Arrays are best data structures ?

A. for the size of the structure and the data in the structure are constantly changing

B. for relatively permanent collections of data

C. for none of above situation

D. for both of above situation

Data Structures and Algorithms MCQs Test 2 Online For Preparation

Leave a Reply Cancel reply