Question
Who among the following likes
Montblanc? Study the following information carefully to answer the given questions: Seven Persons – A, B, C, D, E, F, and G – live on separate floors of a seven storey building, but not in the same order. The ground floor of the building is numbered 1, the floor above it 2 and so on until the topmost floor is numbered 7. Each person likes different pens – Pilot, Parker, Montblanc, Reynolds, Linc, Pelikan and Classmate, but not necessarily in the same order. Each person like different pencil namely viz – Apsara, Nataraj, Camlin, Doms, Pentonic, Faber castell and Staedtler. (i) Two persons live between the persons who like Staedtler and Nataraj. The person who likes Reynolds lives on floor numbered four. A does not live on the lowermost floor. A lives on any odd numbered floor below the one who likes Reynolds. (ii) Only two persons live between A and the person who likes Classmate. Two persons live between the persons who like Apsara and Camlin. Only one person lives between B and F. F lives on an even numbered floor and does not like Reynolds. (iii) Only three persons live between the persons who like Pilot and Montblanc respectively. The person who likes Pilot live on any floor above the B’s floor. There are two persons live between the persons who like Nataraj and Pentonic. (iv) The person who likes Pilot does not live on the topmost floor. G does not like Doms. G lives on an even numbered floor but neither immediately above nor immediately below the floor of A. C does not like Pilot or Montblanc. (V) Only two persons live between D and the one who likes Reynolds. The person who likes Staedtler lives on one of the floors above the floor numbered 5. The person who likes Linc lives on the floor immediately above the floor of the person who likes Pelikan. (vi) The person who likes Nataraj lives on one of the floors above the floor numbered 3. The person who likes Apsara lives immediately above the one who likes Nataraj. There are two persons live between the one who likes Faber castell and the one who likes Doms.Solution
From (i), (ii) and (iv), we will get the basic information as shown below:
From (i), A lives on floor no. 3. From (iv), G cannot live on floor no. 4 and 2. So, G lives on floor no. 6. From (v), we will have two cases: D lives either on floor no. 1 or 7. From (ii), F lives on floor no. 2 and B lives on floor no. 4. The one who likes Classmate lives on floor no. 6. From (iii), The one who likes Pilot and Montblanc live on floor no. 5 and 1 respectively. From (iv), C lives on floor no. 7. Case 2 will get discarded as C does not like neither Pilot nor Montblanc.Â
From (iii) and (vi), the persons who like Nataraj lives on floor no. 4. The person who likes Apsara lives on floor no. 5. From (i), the person who likes Staedtler lives on floor no. 7. From (v), the one who likes Faber castell and Doms live on floor no. 6 and 3 respectively.  Only pencil left for floor no. 2 is Camlin. From (v), The person who likes Linc and Pelikan lives on floor no. 3 and 2 respectively. Only pen left for floor no. 7 is Parker. Final arrangement as shown below: 
Huffman Coding uses a greedy approach to achieve what?
In ___ each address field determines two address fields i.e. either a memory word or the processor register.
Ignoring quantization noise and considering only channel noise in pulse coded modulation system, if signal-to-noise ratio is 10 dB, noise power is 2 dB,...
What is the primary purpose of virtual memory in an operating system?Â
Which of the following is a primary reason for using threads instead of multiple processes for concurrent execution within a single application?
Which of one the below options are the two different types of bus topology ?
Consider the following code:
  let data = [1, 2, 3];
  function modifyArray(arr) {
    arr.push(4);
   ...
What does "optimal substructure" mean in the context of Dynamic Programming?
What were the early operating systems commonly known as, and what was their primary function?
Which heuristic function property ensures A* algorithm finds an optimal path?