Logical Reasoning - Logical Problems - Discussion
Discussion Forum : Logical Problems - Type 1 (Q.No. 5)
Directions to Solve
Each problem consists of three statements. Based on the first two statements, the third statement may be true, false, or uncertain.
5.
Apartments in the Riverdale Manor cost less than apartments in The Gaslight Commons.
Apartments in the Livingston Gate cost more than apartments in the The Gaslight Commons.
Of the three apartment buildings, the Livingston Gate costs the most.
If the first two statements are true, the third statement is
Apartments in the Livingston Gate cost more than apartments in the The Gaslight Commons.
Of the three apartment buildings, the Livingston Gate costs the most.
If the first two statements are true, the third statement is
Answer: Option
Explanation:
Since the Gaslight Commons costs more than the Riverdale Manor and the Livingston Gate costs more than the Gaslight Commons, it is true that the Livingston Gate costs the most.
Discussion:
11 comments Page 1 of 2.
Camelia Avery said:
11 months ago
Can someone please explain in detail?
(3)
YAKESH said:
1 decade ago
1) GC > RM
2) LG > GC
So LG > GC > RM.
2) LG > GC
So LG > GC > RM.
(1)
Asha said:
7 years ago
Take some numbers for reference it can be easy to solve,
Apartments in the Riverdale Manor cost less than apartments in The Gaslight Commons, RM=5, GC=10,
Apartments in the Livingston Gate cost more than apartments in the Gaslight Commons. LG=15, GC=10.
Of the three apartment buildings, the Livingston Gate costs the most. ----> then this is true.
Apartments in the Riverdale Manor cost less than apartments in The Gaslight Commons, RM=5, GC=10,
Apartments in the Livingston Gate cost more than apartments in the Gaslight Commons. LG=15, GC=10.
Of the three apartment buildings, the Livingston Gate costs the most. ----> then this is true.
(1)
Mike said:
3 years ago
Agree, The right answer is True.
(1)
Noush said:
1 decade ago
Thanks yakesh..
Abhijeet krishna said:
1 decade ago
HC is related to KQ in a certain way. Similarly, OG is related to AB in the same way. To which of the following is RK related, following the same pattern? TJ SI TI HD IM.
Alexander said:
1 decade ago
Yes, but they did not take in account that the question states: which 'building' costs the most? They never specified the amount of apartments in each building, so the answer is uncertain.
Tasneem said:
10 years ago
Give a system with four page frames ,the following table indicate page, load time, last reference time, dirty bit and reference bit.
Page Load time Last Reference Dirty Bit Reference Bit
0 167 374 1 1
1 321 321 0 0
2 254 306 1 0
3 154 331 0 1
1- Which page will FIFO replace?
2- Which page will LRU replace?
3- Which page will Second-chance replace?
4- Which page will Enhanced-second-chance replace?
A system using demand-paged segments has a 16-bit virtual address space with 2 segments per process and page size of 2^12. The content of segment and page tables is specified below(all values binary). Segment length is in increment of the page size.
Segment Table Length
Pointer to page Table 0 111
Pointer to page Table 1 110
Page table 1
Fram In
010100 0
110101 1
110100 0
011001 0
110011 1
001001 0
000101 1
100010 1
Page table 0
Fram In
101011 1
001010 0
001011 1
100110 1
001100 0
110110 1
111010 0
011101 0
Page Load time Last Reference Dirty Bit Reference Bit
0 167 374 1 1
1 321 321 0 0
2 254 306 1 0
3 154 331 0 1
1- Which page will FIFO replace?
2- Which page will LRU replace?
3- Which page will Second-chance replace?
4- Which page will Enhanced-second-chance replace?
A system using demand-paged segments has a 16-bit virtual address space with 2 segments per process and page size of 2^12. The content of segment and page tables is specified below(all values binary). Segment length is in increment of the page size.
Segment Table Length
Pointer to page Table 0 111
Pointer to page Table 1 110
Page table 1
Fram In
010100 0
110101 1
110100 0
011001 0
110011 1
001001 0
000101 1
100010 1
Page table 0
Fram In
101011 1
001010 0
001011 1
100110 1
001100 0
110110 1
111010 0
011101 0
Tasneem said:
10 years ago
I want to solve problem can you help?
Sakshi said:
8 years ago
RM<GC.
LG>GC.
LG>GC.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers