Data structures & Algorithms - Multiple Choice
Questions (MCQs) - Objective Set 1
1. Two main measures for the efficiency of an
algorithm are
a. Processor and memory
b. Complexity and capacity
c. Time and space
d. Data and space
Answer (C)
b. Complexity and capacity
c. Time and space
d. Data and space
Answer (C)
2. The time factor when determining the efficiency
of algorithm is measured by
a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm
Answer (B)
3. The space factor when determining the efficiency
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
Answer (A)
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
Answer (A)
4. Which of the following case does not exist in
complexity theory
a. Best case
b. Worst case
c. Average case
d. Null case
Answer (D)
b. Worst case
c. Average case
d. Null case
Answer (D)
5. The Worst case occur in linear search
algorithm when
a. Item is somewhere in the middle of the
array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all
Answer (D)
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all
Answer (D)
6. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of
the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
Answer (A)
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
Answer (A)
7. The complexity of the average case of an
algorithm is
a. Much more complicated to analyze than that of worst
case
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None or above
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None or above
Answer (A)
8. The complexity of linear search algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer (A)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer (A)
9. The complexity of Binary search algorithm is
a. O(n)
b. O(log n )
c. O(n2)
d. O(n log n)
Answer (B)
b. O(log n )
c. O(n2)
d. O(n log n)
Answer (B)
10. The complexity of Bubble sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer (C)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer (C)
11. The complexity of merge sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer (D)
b. O(log n)
c. O(n2)
d. O(n log n)
Answer (D)
12. The indirect change of the values of a variable
in one module by another module is called
a. internal change
b. inter-module change
c. side effect
d. side-module update
Answer (C)
b. inter-module change
c. side effect
d. side-module update
Answer (C)
13. Which of the following data structure is not
linear data structure?
a. Arrays
b. Linked lists
c. Both of above
d. None of above
Answer (D)
b. Linked lists
c. Both of above
d. None of above
Answer (D)
14. Which of the following data structure is linear
data structure?
a. Trees
b. Graphs
c. Arrays
d. None of above
b. Graphs
c. Arrays
d. None of above
Answer (C)
15. The operation of processing each element in the
list is known as
a. Sorting
b. Merging
c. Inserting
d. Traversal
Answer (D)
b. Merging
c. Inserting
d. Traversal
Answer (D)
16. Finding the location of the element with a given
value is:
a. Traversal
b. Search
c. Sort
d. None of above
Answer (B)
b. Search
c. Sort
d. None of above
Answer (B)
17. 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
Answer (A)
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
Answer (A)
18. 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
Answer (B)
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
Answer (B)
19. 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
Answer (C)
b. the data type of array
c. the first data from the set to be stored
d. the index set of the array
Answer (C)
20. 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
b. the architecture of computer memory does not allow arrays to store other than serially
c. both of above
d. none of above
Answer (A)
Q 21 - Which of the following usees FIFO method
A - Queue
B - Stack
C - Hash Table
D - Binary Search Tree
Answer (A)
Q 22 - Queue data structure works on
A - LIFO
B - FIFO
C - FILO
D - none of the above
Answer (A)
Q 23 - Minimum number of moves required to solve a
Tower of Hanoi puzzle is
A - 2n2
B - 2n-1
C - 2n - 1
D - 2n - 1
Answer(C)
Q 24 - What is not true about insertion sort?
A - Exhibits the worst case performance when the
initial array is sorted in reverse order.
B - Worst case and average case performance is Ο(n2)
C - Can be compared to the way a card player
arranges his card from a card deck.
D - None of the above!
Answer(D)
All given options are true about insertion sort.
Q 25 - Which of the following is example of in-place
algorithm?
A - Bubble Sort
B - Merge Sort
C - Insertion Sort
D - All of the above
Answer(B)
Only Merge sort requires extra space
Q 26 - Which of the below mentioned sorting
algorithms are not stable?
A - Selection Sort
B - Bubble Sort
C - Merge Sort
D - Insertion Sort
Answer(A)
Except selection sort, all other soring algorithms
are stable.
Q 27 - Which of these algorithmic approach tries to
achieve localized optimum solution −
A - Greedy approach
B - Divide and conquer approach
C - Dynamic approach
D - All of the above
Answer(A)
Q 28 - If there's no base criteria in a recursive
program, the program will
A - not be executed.
B - execute until all conditions match.
C - execute infinitely.
D - obtain progressive approach.
Answer(C)
Q 29 - A balance factor in AVL tree is used to check
A - what rotation to make.
B - if all child nodes are at same level.
C - when the last rotation occured.
D - if the tree is unbalanced.
Answer(D)
The balance factor (BalanceFactor =
height(left-sutree) − height(right-sutree)) is used to check if the tree is
balanced or unbalanced.
Q 30 - If the data collection is in sorted form and
equally distributed then the run time complexity of interpolation search is −
A - Ο(n)
B - Ο(1)
C - Ο(log n)
D - Ο(log (log n))
Answer(D)
Runtime complexity of interpolation search algorithm is
Ο(log (log n)) as compared to Ο(log n) of BST in favourable situations.
No comments:
Post a Comment