Discussion
Home ‣ Verbal Reasoning ‣ Games and Tournament Comments
- Question
- If seed 9 won the tournament then what is the minimum points scored by him in stage 1 given that minimum number of upsets in the tournament?
Options- A. 5
- B. 3
- C. 6
- D. None of these
- Correct Answer
- 5
ExplanationSeed 9 will play with seed, 1, 3, 5, 7, 11, 13, and 15 without an upset seed 9 can with seed 11, 13, and 15, for minimum number of upset let seed 1 won all the matches and seed 9 won against seed 3 and 5, in that case number of wins of seed 3 and 9 is 5 but with tie breaker rule seed 9 will advance to the next stage.
- 1. What is the total number of matches in the tournament?
Options- A. 59
- B. 60
- C. 61
- D. None of these Discuss
- 2. If in semifinal round top scorer of one group played with 2 nd scorer of another group and vice versa then which one of the following statement is correct?
Options- A. If F played with B in semifinal round then B lost only one match against H in stage 1
- B. If G played with B in semifinal round then H lost both the matches against B in the stage 1
- C. If F played with H in semifinal round then H lost 2 matches in stage 1
- D. None of these Discuss
- 3. A lost both the matches to which team.
Options- A. B
- B. H
- C. B and H
- D. None of these Discuss
- 4. Which team won the least number of matches?
Options- A. C
- B. D
- C. E
- D. A Discuss
- 5. Which team won the 2nd highest number of matches in the 1st stage?
Options- A. B
- B. H
- C. G
- D. Cant be determined Discuss
- 6. If more than 75% of the matches are upset then which highest seed can win the tournament?
Options- A. 4
- B. 8
- C. 7
- D. None of these Discuss
- 7. If upset caused by a winner is 3 then which lowest seed can win the tournament?
Options- A. 14
- B. 13
- C. 8
- D. None of these Discuss
- 8. Who own highest number of match?
Options- A. Ahaskar
- B. Bhanu
- C. Chandan
- D. None of these Discuss
- 9. Result of minimum how many matches has to change in order to make Faisal a highest scorer keeping all the rules of the tournament valid?
Options- A. 6
- B. 4
- C. 3
- D. None of these Discuss
- 10. Dripto lost how many matches
Options- A. 2
- B. 4
- C. 3
- D. None of these Discuss
Games and Tournament problems
Search Results
Correct Answer: 60
Explanation:
Number of matches in stage 1 is 2(7 x 8/2) = 56, at semifinal stage we have 3 matches (2 semifinal and 1 match for 3rd place) and 1 final match, hence total number of matches is 56 + 3 + 1 = 60
Correct Answer: If G played with B in semifinal round then H lost both the matches against B in the stage 1
Explanation:
If G played with B in semifinal round then H lost both the matches against B in the stage 1
Correct Answer: None of these
Explanation:
A lost both the matches to B or H not B and H hence option C is incorrect.
Correct Answer: E
Explanation:
E lost the maximum number of matches.
Correct Answer: Cant be determined
Explanation:
2nd Highest is either B or H so cant determine.
Correct Answer: None of these
Explanation:
Total number of matches is 60 and out of those more than 45 matches are upset. But seed 1 need only 9 matches to win the tournament hence seed 1 may win the tournament.
Correct Answer: 13
Explanation:
Total number of matches in the 1st stage is 4 x 7 = 28, lets consider group 1 here if seed 1 won all the matches then remaining 21 matches or points can be equally distributed to 7 player (3 points each) and the lowest possible player would advance to next stage with tie breaker rule. In this stage seed 13 can get 3 points after 2 upsets caused by him. So from this group seed 1 and 13 would advance to the next stage. Similarly from 2nd group seed 2 and 14 would advance to the next stage.
Now as per the rule seed 1 will play with seed 14 and seed 2 will play with seed 13,
If seed 13 and 4 meet in the tournament then seed 13 will win with 3 upset.
Correct Answer: Bhanu
Explanation:
Bhanu
Correct Answer: 6
Explanation:
he needs 6 wins
Correct Answer: None of these
Explanation:
it can be 3 and 4
Comments
There are no comments.More in Verbal Reasoning:
Programming
Copyright ©CuriousTab. All rights reserved.