Question
On which floor and in which flat does G
lives? Study the following information carefully to answer the given questions: There are ten persons i.e A, B, C, D, E, F, G, H, I and J, who lives in a building having five floors such that ground floor is numbered as 1 and above it is 2 and so on up to top floor numbered as 5. Each of the floor consist of 2 flats as flat-A, flat-B. Flat-A of floor-2 is immediately above flat-A of floor-1 and immediately below flat-A of floor-3 and in the same way flat-B of floor-2 is immediately above flat-B of floor-1 and immediately below flat-B of floor-3 and so on. Flat-B is in east of flat-A. Note: If A lives above (or below) B, then there are living in same flat unless stated otherwise. G lives to the East of the one who lives immediately above of A. I and F don’t live in same floor. A lives in an odd numbered floor. D lives west of J, who lives second to above the flat of B. C lives two flats below of H who lives on Floor-4 and in flat-A. I lives north-west of E.Solution
G lives to the East of the one who lives immediately above of A. A lives in an odd numbered floor. As per these lines two Cases will Arrive: 
C lives two flats below of H who lives on Floor-4 and in flat-A. 
D lives west of J, who lives second to above the flat of B Note: Here we get one more sub case from case-1 
I lives north-west of E Note: Case-2 rejected since I lives north-west of E is not possible. 
I and F don’t live in same floor. Note: Case-2 rejected since I and F don’t live in same floor is not possible. The final table arrangement is: 
Which deadlock prevention scheme allows older transactions to preempt younger ones?
Bitmap indexes are most efficient when:
Which OOP concept directly influences control flow by allowing different implementations of a method to be called based on the type of the object at run...
If every non-key attribute is functionally dependent on the primary key, the relation will be in
Which of the following concurrency control methods avoids deadlocks entirely but can reduce concurrency by blocking transactions at start?
Which constraint ensures that no duplicate values exist in a column?
In a relational schema, which normal form eliminates transitive dependencies (i.e., non-prime attribute depends on another non-prime attribute)?
Which SQL command is used to retrieve data from a table?
Which normal form ensures no partial dependency of non-prime attributes on a candidate key?
What does normalization in DBMS achieve?
Relevant for Exams:
