Note 1
##### Take Note:

Take a note while surfing.

##### Note With Ink

Give your Note a Colorful Tag.

##### Easy to Access

Stay on same information and in Sync wherever you are.

Note 2
##### Take Note:

Organize your information,It may take Shape.

##### Think With Ink

Differ your Content by Color.

##### Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3
##### Take Note:

Don't Let information to miss,Because it take shape

##### Note With Ink

Simple an Easy Way to take a note.

##### Easy to Access

Get the same in next visit.

Please wait...

# Data Structures :: Complexity

Home > Data Structures > Complexity > General Questions

#### Co. Cloud

1. The complexity of searching an element from a set of n elements using Binary search algorithm is

| | | |

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

2. Two main measures for the efficiency of an algorithm are

| | | |

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

3. If the array is already sorted, then the running time for merge sort is: ?

| | | |

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

4. Which is the best data structure for round robin algorithm for CPU scheduling?

| | | |

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

5. Which algorithm is having highest space complexity?

| | | |

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

6. quicksort algorithm is used to sort an array of N elements. If all the N values w
complexity of quicksort that uses first element as the pivot. ?

| | | |

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

7. Algorithms A and B solve the same problem. Time complexity of A is in O(n^2) and that of B is in O(n). Which among the following can you guarantee?

| | | |

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

8. The complexity of merge sort algorithm is

| | | |

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

9. The complexity of linear search algorithm is

| | | |

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

10. The complexity of Binary search algorithm is

| | | |

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!