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.

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.

Data Structures :: Searching & Sorting

Home > Data Structures > Searching & Sorting > General Questions

41. Let S and S1 be two stacks and Q be the additional Queue then what is the result puted:

while (S not empty)
{
Q.insert(pop(S));
}

while(Q not empty)
{
push(S1,Q.delete());
} ?

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

42. Assume that you have a very large array of elements. You are required to sort the space rather than time. Which among the following algorithm is not an ideal

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

43. 14 Merging 4 sorted files containing 50, 10, 25 and 15 records will take____time

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

44. Binary search algorithm cannot be applied to

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

45. Which of the following case does not exist in complexity theory

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

46. The Worst case occur in linear search algorithm when

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

47. The Average case occur in linear search algorithm

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

48. The operation of processing each element in the list is known as

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

49. Finding the location of the element with a given value is:

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

50. Finding the location of the element with a given value is called

| | | |