Skip to content

Tag Archives: Algorithms-Misc

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A)… Read More
A set X can be represented by an array x[n] as follows: Consider the following algorithm in which x,y and z are Boolean arrays of… Read More
Which of the following is not an in-place algorithm? (A) Insertion sort (B) Selection sort (C) Merge sort (D) Heap sort Answer: (C) Explanation: An… Read More
In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of… Read More
Given 8 identical coins out of which one coin is heavy and a pan balance. How many minimum number of measurements are needed to find… Read More
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:… Read More

Start Your Coding Journey Now!