Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer
Q. The indirect change of the values of a vari- able in one module by another module is called
a. internal change
b. inter-module change
c. side effect
d. all the above
Q. Two main measures for the efficiency of an algorithm are
a. Time and space
b. Processor and memory
c. Complexity and capacity
d. Data and space
Q. The time factor when determining the effi- ciency of algorithm is measured by
a. Counting the number of key operations
b. Counting the number of statements
c. Counting the kilobytes of algorithm
d. None of the above
Q. The space factor when determining the effi- ciency of algorithm is measured by
a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm
Q. All the above* Which of the following data structures are indexed structures
a. linear arrays
b. linked lists
c. both of above
d. none of above
Q. 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. there should be the direct access to the middle element in any sublist
d. none of the above
Q. Which of the following is not a limitation ofbinary search algorithm ?
a. binary search algorithm is not efficient when the data elements are more than 1000.
b. must use a sorted array
c. requirement of sorted array is expen- sive when a lot of insertion and dele- tions are needed
d. there must be a mechanism to access middle element directly
Q. Two dimensional arrays are also called
a. tables arrays
b. matrix arrays
c. both of the above
d. none of the above
Q. A data structure where elements can be added or removed at either end but not in the middle is referred as
a. Linked lists
b. Stacks
c. Queues
d. Deque
Q. The following sorting algorithm is of divide- and-conquer type
a. Bubble sort
b. Insertion sort
c. Quick sort
d. None of the above
Q. An algorithm that calls itself directly or indi- rectly is known as
a. Recursion
b. Polish notation
c. Traversal algorithm
d. None of the above
Q. The elements of an array are stored suc- cessively 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. A and B both false
d. A and B both true
Q. The memory address of the first element of an array is called
a. base address
b. floor address
c. foundation address
d. first address
Q. The memory address of fifth element of anarray can be calculated by the formula
a. LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array
b. LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array
c. LOC(Array[5]=Base(Array)+w(5-lower bou
d. , where w is the number of words per memory cell for the array