COURSE LOGICAL REASONING LESSON NETWORK Presented By : Chaitanya
About Me MBA from IIM A Electronics and Communication Engineer Software Engineer -2 Years Teaching Experience : 3 Years Course Fees: CONTRIBUTE Follow me on Unacademy: https://unacademy.in/user/chaitanyaunacademy httpslunacademy.inuserchaitanyaunacademy
7 towns- A,B,C,D,E.F,G are connected by 3 paths - path 1,2 and 3 Path 1 connects E and G and passes through F only Path 2 starts and ends at A but passes through E and B Path 3 connects G and D and passes only through C 2 towns are directly connected if one can travel directly between the 2 towns without passing through any other town Which town has the maximum number connections? Which towns has the least number of connections? If a new path is formed that directly connects B and C, then which of the following pairs do not exist on the shortest route connecting E and D? F and G, A and B, G and A, C and M If a new path is formed between A and D, then the maximum number of paths connecting E and C that do not touch any other town more than once are-?
7 towns- A,B,C,D,E.F,G are connected by 3 paths - path 1,2 and 3 Path 1 connects E and G and passes through F only Path 2 starts and ends at A but passes through E and B Path 3 connects G and D and passes only through C Which town has the maximum number connections? E Which towns has the least number of connections? C If a new path is formed that directly connects B and C, then which of the following pairs do not exist on the shortest route connecting E and D? Fand G ,A and B, G and B, C and M Shortest route connecting E and D is EBCD A)
If a new path is formed between A and D, then the maximum number of paths connecting E and C that do not touch any other town more than once are-? EBADC, EFGC, EADC (3 paths)
11 lessons,
1h 30m
Enroll
663
✕Download
Chaitanya K
Graduated from IIM A
U
Unacademy user
Suneel Kumar Verma
a year ago
plZ Continue sir
1
Reply
Shruti Sindhi
a year ago
Can you provide with some practice qs on this topic
0
Reply
Shubham Tripathi
3 years ago
Thank you very much sir :-) very useful
1
Reply