Arrays Time complexity Multiple Choice Questions | Objective Type Questions

Hello friends, in this article we are going to discuss about Time complexity Multiple Choice Questions | Time complexity Objective type Java Questions for Data Structure and Algorithms | DSA Multiple Choice Questions and Answers

Read Also : Java Arrays Multiple Choice Questions answers , Basic of Array Multiple Choice Questions | Objective Type Questions

Q1.What is Time Complexity of temp array method in java?

1. O(n * d) 
2. O(n)
3. O (1)
4. None of these

Ans : 2

Explain : Time Complexity of temp array is O(n) method in java.

Q2.What is Time Complexity of Rotate one by one array method in java?

1. O(n * d) 
2. O(n)
3. O (1)
4. None of these

Ans : 1

Explain : Time Complexity of Rotate one by one array is O(n * d)  method in java.

Q3.What is Time Complexity of A Juggling Algorithm of array method in java?

1. O(n * d) 
2. O(n)
3. O (1)
4. None of these

Ans : 2

Explain : Time Complexity of A Juggling Algorithm array is O(n) method in java.

Q4.What is Time Complexity of The Reversal Algorithm of array method in java?

1. O(n * d) 
2. O(n)
3. O (1)
4. None of these

Ans : 2

Explain : Time Complexity of The Reversal Algorithm is O(n) method in java.

Q5.What is Time Complexity of Block swap algorithm of array method in java?

1. O(n * d) 
2. O(n)
3. O (1)
4. None of these

Ans : 2

Explain : Time Complexity of Block swap algorithm is O(n) method in java.

Q.6An element in a sorted array can be found in _______ time via binary search.

1. O(n * d) 
2. O(n)
3. O (1)
4. O(log n)

Ans : 4

Explain : An element in a sorted array can be found in O(log n) time via binary search.

Q7.Naive Solution which takes how much amount of time?

1. O(n * d) 
2. O(n2)
3. O (1)
4. O(log n)

Ans : 2

Explain : Naive Solution which takes O(n2) amount of time.

Q8.Which distance between two arrays or strings of equal length is the number of positions at which the corresponding character(elements) are different.?

1. Hopsman 
2. Hamming
3. Overall
4. Logiing

Ans : 2

Explain : Hamming distance between two arrays or strings of equal length is the number of positions at which the corresponding character(elements) are different.

Q9.What STL stands for in array?

1. Standard Temporary Library
2. Standard Template Library
3. Storage Temporary Library
4. None of these

Ans : 2

Explain : STL stands for Standard Template Library.