Discussion
Home ‣ Verbal Reasoning ‣ Logical Connectives Comments
- Question
- (i) Whenever there is a fire, the fire alarm goes off
(ii) If the sprinklers do not start, the fire alarm does not go off.
(iii) If the sprinklers start, an automatic alarm is set off at the fire department.
Options- A. If an automatic alarm is set off at the fire department,that means there must be a fire.
- B. If the sprinklers do not start, the automatic alai-in at the fire department is not set off.
- C. Whenever there is a fire, an automatic alarm is set off in the fire department.
- D. If there is no fire, no automatic alarm is set off in the fire department.
- Correct Answer
- Whenever there is a fire, an automatic alarm is set off in the fire department.
ExplanationLets eliminate options one by one-
Option A: Cannot be true since we cannot infer anything if we know that an automatic alarm is set off at the fire department.
Option B: If sprinklers do not start then the fire alarm doesn't go off. Further we cannot say anything about the automatic alarm at the fire department.
Option C: When there is a fire the fire alarm goes off so sprinklers start. Hence an automatic alarm is set off at the fire department.
Option (D) is similarly ruled out. - 1. (i) Doing well in CAT implies doing well in JMET.
(ii) Good JMET results ensure that you get into one of the IITs or IISc.
(iii) Poor CAT results do not get you an admission into any of the IIMs.
Options- A. Doing poorly in CAT always implies doing poorly in JMET.
- B. Good CAT result ensures that one gets an admission into the IIMs.
- C. Admission to the IITs or IISc may mean that one has done well in CAT.
- D. Anyone getting admission in one of the IIMs is guaranteed to get admission in one of the IITs or IISc. Discuss
- 2. In all family photos, if Geeta is present, her two sisters are also present. A certain photo features five members of his family. Among the people in that photo are Geeta's parents with their son. Which of these statements is necessarily true?
Options- A. Geeta is present in the photo
- B. Geeta is absent from the photo
- C. Geeta many or many not be present in the photo
- D. The two sisters of Geeta are present in the photo Discuss
- 3. If a student sees a teacher in the class he would not sleep in the class, One day, a student does not see a teacher in the class. Which of the following statements is true?
Options- A. The student will sleep in the class.
- B. The student will not sleep in the class.
- C. Cannot conclude anything.
- D. None of these Discuss
- 4. Only if it is a national holiday, Pioneer career is not open and employee enjoy together.
Options- A. Today is not a national holiday it implies that Pioneer is not open and employee enjoy together.
- B. Employees are not enjoying together and Pioneer Career is open that implies it is not a national holiday.
- C. Today is not a national holiday it implies that Pioneer career is open or employee enjoy together.
- D. None of these. Discuss
- 5. If it is not raining then I will not walk slow but I will walk at least 4 km.
Options- A. If it is raining then I will walk slow but I will not walk 4 km.
- B. If it is raining then I will not walk slow but I will not walk 4 km.
- C. If I am walking slow or not walking for 4 kms then it is raining.
- D. None of these Discuss
- 6. (i) Whenever milk is kept in front of a child, he/she starts crying.
(ii) Children cry if they are hungry.
(iii) Unhappy children are hungry.
Options- A. When hungry, a child likes milk.
- B. A child crying means he/she is unhappy.
- C. A happy child does not cry.
- D. An unhappy child usually cries. Discuss
- 7. How many stages are in the tournament?
Options- A. 5
- B. 6
- C. 7
- D. None of these Discuss
- 8. What is the total number of matches in the tournament?
Options- A. 63
- B. 36
- C. 127
- D. None of these Discuss
- 9. If seed 9 reached final then which one of the following could play with him in final?
Options- A. 56
- B. 24
- C. 11
- D. None of these Discuss
- 10. Which lowest seeded player can win the tournament without causing an upset by him?
Options- A. 32
- B. 33
- C. 34
- D. None of these Discuss
Logical Connectives problems
Search Results
Correct Answer: Anyone getting admission in one of the IIMs is guaranteed to get admission in one of the IITs or IISc.
Explanation:
Admission in one of the IIM's ensures good performance in CAT. This implies doing well in JMET. This ensures that you get into one of the IITS or IISC So option D is true.
Correct Answer: Geeta is absent from the photo
Explanation:
Let X be the event that Geeta is present in the photo and event Y that her sister are present. Given that X ? Y.
As per the given information in the photo already has three people (Geeta's parents with their son 3 persons so remaining can be only 2 persons). Thus, Geeta cannot be in the photo.
Correct Answer: Cannot conclude anything.
Explanation:
Here let X be the event that the student sees a teacher. And event Y be the event that he is sleeping. We have been given that X ? ~ Y. However, we do not know anything about ~ X, and the question asks us what Y will be if ~ X.
? We cannot conclude anything.
Correct Answer: Today is not a national holiday it implies that Pioneer career is open or employee enjoy together.
Explanation:
This is the situation of "Only if X then Y and Z" it implies that:
(i) (Y and Z ? X)
(ii) (~ X ? ~ Y or/and ~ Z) given in option (C)
Correct Answer: If I am walking slow or not walking for 4 kms then it is raining.
Explanation:
This is the situation of "If X then Y and Z" it implies that:
(i) (X ? Y and Z)
(ii) (~ Y or/and ~ Z ? ~ X ) given in option (C)
Correct Answer: An unhappy child usually cries.
Explanation:
Lets eliminate options one by one-
Option A: Child is hungry, So, from (ii) child is crying, but we cannot say anything about the child liking milk or not.
Option B: A child is crying, but from this we cannot say anything regarding the child being hungry or unhappy.
Option C: The statements are not speaking about the happy child.
Option D: Unhappy children are hungry and hungry children cry. So choice (D) is most logically supported.
Correct Answer: 6
Explanation:
Since 64 = 26 hence we will have total 7th stages in the tournament with last 7th stage is the final match.
Correct Answer: 63
Explanation:
Total number of matches is 32 + 16 + 8 + 4 +2 + 1 = 63
Or else since total number of players is 64 hence number of matches must be 64 - 1 = 63
Correct Answer: 11
Explanation:
Seed 9 played with seed 56 in stage 1, with seed 24 in stage 2, But seed 11 can reach the final if he beats seeds 6, 3 and 2 in stage 3 4 and 5 respectively.
Correct Answer: 32
Explanation:
If all the matches in stage 1 is an upset except the last match where seed 32 won, then in stage 2 seed 32 is the highest seeded player who can win the tournament without causing an upset.
Comments
There are no comments.More in Verbal Reasoning:
Programming
Copyright ©CuriousTab. All rights reserved.