Question
Who among the following person sits extreme left end of
the row? Study the following information carefully and answer the below questions. Seven persons- H, I, J, K, L, M, and N are sitting in the linear row facing south. They have different number of pens. L sits third to the left of the one who has 22 pens, neither of them sits on the end of the row. Only one person sits between L and H. I sits second to the right of H. Only two persons are sitting between I and the one who has 15 pens. J sits second to the left of N, both have an odd number of pens. K sits immediate right of the one who has 13 pens. H has an even number of pens. H has 10 pens less than M. L has two pens less than J and one more than K. J has one less than M.Solution
We have, L sits third to the left of the one who has 22 pens, neither of them sits on the end of the row. Only one person sits between L and H. From the above condition, there are three possibilities. Case-1 Again we have, I sits second to the right of H. From the above condition, Case-2a gets eliminated. Case-1
Again we have, Only two persons are sitting between I and the one who has 15 pens. J sits second to the left of N, both have an odd number of pens. Case-1
Again we have, H has 10 pens less than M. L has two pens less than J and one more than K. J has one less than M. From the above condition, case1 shows the final arrangement. Case-1
What does Section 66A of IT Act define?
A data analysis task requires repeatedly extracting the element with the highest priority from a collection. Which heap operation is used for this, and ...
Consider the following Java code snippet:
import java.util.PriorityQueue;
public class HeapQuestion9 {
publ...
The latency of a network is
The Knuth-Morris-Pratt (KMP) algorithm improves upon the Naive approach by avoiding unnecessary re-comparisons. It achieves this by:
Round robin scheduling is essentially the preemptive version of
Which of the following programming language most of “Wireshark” is implemented in?
Which is not an IoT OS?
What are the 3v’s of Big Data?
Consider the in-order traversal of a Binary Search Tree. What characteristic does the sequence of visited nodes possess?