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 :: Searching & Sorting

Home > Data Structures > Searching & Sorting > General Questions

51. The following sorting algorithm is of divide and conquer type

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

52. A sort which uses the binary tree concept such that any number is larger than all the numbers in the subtree below it is called

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

54. If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Wipro

55. The in-order traversal of tree will yield a sorted listing of elements of tree in ________________.

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Wipro

56. A step by step instruction used to solve a problem is know as

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Virtusa

57. Which of the following sorting algorithem has average sorting behavior

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Cisco

58. The number of swappings needed to short the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order using bubble sort is

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Cisco

59. In binary search tree which traversal is used for getting ascending order values

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Cisco

60. What is the efficiency of merge sort

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Cisco



Most Popular Qs.

Latest MCQ Qs.