CA Foundation Exam > CA Foundation Questions > Seven cities - A, B, C, D, E, F and G are con...
Start Learning for Free
Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.
If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?
If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?
- a)C
- b)D
- c)A
- d)E
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Seven cities - A, B, C, D, E, F and G are connected as follows. The ci...
Most Upvoted Answer
Seven cities - A, B, C, D, E, F and G are connected as follows. The ci...
Given information
- Cities A, B, C, D, E, F, and G are connected with one way or two way routes
- One way routes: A to D, C to B, G to C, F to E, E to B, A to F, D to C, and A to G
- Two way routes: C and E, G and F, D and G
To reach city B from city F touching the maximum possible number of cities exactly once, we need to find the most optimal path.
Solution
Starting from city F, we can move in two directions, either towards city E or towards city A. Let's consider both cases.
Case 1: Moving towards city E
The possible path in this case is F → E → B. We have touched 3 cities (F, E, and B) and cannot touch any other city as there are no other connections from E to any other city.
Case 2: Moving towards city A
The possible path in this case is F → A → D → C → B → E → G. We have touched 7 cities (F, A, D, C, B, E, and G). To touch city B, we need to pass through city C. But city C can only be reached from city D, and once we reach city D, we cannot go back to city A as it is a one way route from A to D. Therefore, we cannot touch city A and the answer is option C.
Hence, the city that cannot be touched while going from city F to city B touching the maximum possible number of cities exactly once is city C.
- Cities A, B, C, D, E, F, and G are connected with one way or two way routes
- One way routes: A to D, C to B, G to C, F to E, E to B, A to F, D to C, and A to G
- Two way routes: C and E, G and F, D and G
To reach city B from city F touching the maximum possible number of cities exactly once, we need to find the most optimal path.
Solution
Starting from city F, we can move in two directions, either towards city E or towards city A. Let's consider both cases.
Case 1: Moving towards city E
The possible path in this case is F → E → B. We have touched 3 cities (F, E, and B) and cannot touch any other city as there are no other connections from E to any other city.
Case 2: Moving towards city A
The possible path in this case is F → A → D → C → B → E → G. We have touched 7 cities (F, A, D, C, B, E, and G). To touch city B, we need to pass through city C. But city C can only be reached from city D, and once we reach city D, we cannot go back to city A as it is a one way route from A to D. Therefore, we cannot touch city A and the answer is option C.
Hence, the city that cannot be touched while going from city F to city B touching the maximum possible number of cities exactly once is city C.
Attention CA Foundation Students!
To make sure you are not studying endlessly, EduRev has designed CA Foundation study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in CA Foundation.
|
Explore Courses for CA Foundation exam
|
|
Similar CA Foundation Doubts
Top Courses for CA FoundationView all
Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer?
Question Description
Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? for CA Foundation 2024 is part of CA Foundation preparation. The Question and answers have been prepared according to the CA Foundation exam syllabus. Information about Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for CA Foundation 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer?.
Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? for CA Foundation 2024 is part of CA Foundation preparation. The Question and answers have been prepared according to the CA Foundation exam syllabus. Information about Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for CA Foundation 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer?.
Solutions for Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for CA Foundation.
Download more important topics, notes, lectures and mock test series for CA Foundation Exam by signing up for free.
Here you can find the meaning of Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer?, a detailed solution for Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? has been provided alongside types of Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Seven cities - A, B, C, D, E, F and G are connected as follows. The cities which are connected by one way route are as follows. A to D, C to B, G to C, F to E, E to B, A to F , D to C and A to G. The cities which are connected by two way routes are as follows. C and E; G and F; D and G.If a person, who has to reach city B, stared his Journey from city F touching the maximum possible number of cities exactly once, then which city he cannot touch?a)Cb)Dc)Ad)ECorrect answer is option 'C'. Can you explain this answer? tests, examples and also practice CA Foundation tests.
|
|
Explore Courses for CA Foundation exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup