This section contains more frequently asked Data Structure Fundamentals MCQs in the various University level and competitive examinations.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. The space factor when determining the efficiency of algorithm is measured by
- Counting the maximum memory needed by the algorithm
- Counting the minimum memory needed by the algorithm
- Counting the average memory needed by the algorithm
- Counting the maximum disk space needed by the algorithm
A. Counting the maximum memory needed by the algorithm
2. Which of the following case does not exist in complexity theory
- Best case
- Average case
- Worst case
- Null case
D. Null case
3. The Worst case occur in linear search algorithm when
- Item is somewhere in the middle of array
- Item is the last element in the array the array
- Item is the last element in the array
- Item is not in the array at all or is not there at all
D. Item is not in the array at all or is not there at all
4. The Average case occur in linear search algorithm
- When Item is somewhere in the middle of the array
- When Item is the last element in the middle of the array array
- WhenItem is not in the array at all
- When Item is the last element in the array or is not there at all
A. When Item is somewhere in the middle of the array
5. The complexity of the average case of an algorithm is
- Much more complicated to analyze
- Sometimes more complicated and than that of worst case some other times simpler than that of
- Much more simpler to analyze than worst case that of worst case
- None or above
C. Much more simpler to analyze than worst case
that of worst case
6. The complexity of linear search algorithm is
- O(n)
- O(n^2)
- O(log n)
- O(n log n)
A. O(n)
7. The complexity of Binary search algorithm is
- O(n)
- O(n^2)
- O(log n)
- O(n log n)
C. O(log n)
8. The complexity of Bubble sort algorithm is
- O(n)
- O(n^2)
- O(log n)
- O(n log n)
B. O(n^2)
9. The complexity of merge sort algorithm is
- O(n)
- O(n^2)
- O(log n)
- O(n log n)
D. O(n log n)
10. The time factor when determining the efficiency of algorithm is measured by
- Counting microseconds
- Counting the number of statements
- Counting the number of key operations
- Counting the kilobytes of algorithm operations
C. Counting the number of key operations
