Question
Who among the following is
youngest? Answer the questions based on the information given below. There are 7 persons A, B, C, D, E, F and G sitting around square table, where four of them were sitting in the middle of the edges and three are sitting at the corners. Each of them is of different ages among- 2, 3, 5, 8, 9, 10 and 12. Each of them is facing towards the center of the table. E, who is sitting at the edge, is sitting second to the right of C, who is 8 years old. F, who is the oldest person, is sitting three places away from E and is sitting at the corner. G, who is 1 year elder than D, is sitting opposite to D. A is 2 years elder than B, and both of them are either sitting at the corner or at the edge. A and G are not immediate neighbors.Solution
E is sitting at the edge and 2nd to the right of C. C is 8 years old. F, who is the oldest person, is sitting three places away from E and is sitting at the corner. So, E is sitting at the edge which means we have four possible places for E. Case-1 
G, who is 1 year elder than D, is sitting opposite to D. A is 2 years elder than B, and both of them are either sitting at the corner or at the edge. A and G are not immediate neighbors. Now, G is sitting opposite to D which is not possible in case I and III so, these cases are rejected. Also, in case IV, if we place G and D opposite then we can’t place A and B on the same side of the table so, case IV is also rejected. A must be 5 years old and B must be 3 years old also, D must be 9 years old which means G is 10 years old. Then final arrangement is shown below: 
The following Java code attempts to define an abstract class and use it. Identify the best way to correct the error to allow instantiation of a concrete...
Recurrence relations are commonly used to analyze the time complexity of Divide and Conquer algorithms. The Master Theorem is a tool for solving these. ...
Consider the following Python code:
class Vehicle:
  def __init__(self, brand):
    self.brand = brand
  def...
In datawarehouse , a fact table consist of
Which of the following algorithm uses Darwinian based algorithm to find the best solutions to solve complicated problems with a greater number of variab...
A queue initially empty undergoes the following sequence of operations:
1. enqueue(10)
2. enqueue(20)
3. dequeue()
4.�...
A software developer is designing a banking application where each bank account object should restrict direct access to its balance variable to prevent ...
In a Binary Search Tree (BST), which traversal technique results in nodes being visited in ascending order?Â
The kelvin double bridge is used for______
The "load factor" of a hash table is a critical metric. What does it represent?
Relevant for Exams:
