Engineering Questions with Answers - Multiple Choice Questions

Home » MCQs » Engineering MCQs » Database MCQ – Sorting

# Database MCQ – Sorting

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

**
View Answer**

Answer: c

Explanation: Depending on the time and space complexity only the algorithm for sorting will be chosen.

The time factor when determining the efficiency of an 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

**
View Answer**

Answer: b

Explanation: The operations taking place with the time and space is counted.

The space factor when determining the efficiency of an 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

**
View Answer**

Answer: a

Explanation: Time complexity maintains the maximum time needed.

Which of the following case does not exist in complexity theory

a) Best case

b) Worst case

c) Average case

d) Null case

**
View Answer**

Answer: d

Explanation: Null case cannot be counted as the factor for complexity.

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

**
View Answer**

Answer: d

Explanation: Algorithmic complexity is concerned about how fast or slow particular algorithm performs.

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

**
View Answer**

Answer: a

Explanation: Algorithmic complexity is concerned about how fast or slow particular algorithm performs.

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 of the mentioned

**
View Answer**

Answer: a

Explanation: Algorithmic complexity is concerned about how fast or slow particular algorithm performs.

The complexity of a linear search algorithm is

a) O(n)

b) O(log n)

c) O(n2)

d) O(n log n)

**
View Answer**

Answer: a

Explanation: It refers to n values complexity in the algorithm which can be reduced by choosing the other algorithms.

The complexity of Binary search algorithm is

a) O(n)

b) O(log )

c) O(n2)

d) O(n log n)

**
View Answer**

Answer: b

Explanation: This shows that it has a standard complexity in addressing.

The complexity of Bubble sort algorithm is

a) O(n)

b) O(log n)

c) O(n2)

d) O(n log n)

**
View Answer**

Answer: c

Explanation: Bubble sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order.