Discussion
A group of 2m - 1 routers are interconnected in a centralized binary tree. With router at each tree node. Router I communicates with router J by sending a message to the root of the tree. If root then sends the message back down J, the mean path length will be
Answer: A
Correct answer: 2 (m - 2)
In a binary tree of \( 2^{m}-1 \) nodes the path from a leaf to the root has \( m-1 \) hops, so a message going up and back down again traverses about \( 2(m-2) \) links on average once the shared part of the two paths is discounted.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development