Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
Enroll
651
✕Download
Deeper understanding on network logics
1,485 plays
More
With the help of a problem covering the difficult concepts of network related problems, this lesson emphasizes on the right approach to solve such problems. Finding the shortest, longest etc, routes would no longer be time consuming if approached in this manner.
Chaitanya K
Graduated from IIM A
U
Unacademy user
out of 200 , 57 is right and 43 wrong, total score 86
0
Reply
Can you provide with some practice qs on this topic
0
Reply
Thank you very much sir :-) very useful
1
Reply

  1. COURSE LOGICAL REASONING LESSON NETWORK Presented By : Chaitanya


  2. 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


  3. 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-?


  4. 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)


  5. 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)