Discussion
A tree in a network has a
Answer: B
A tree is a connected subgraph of a network that contains all its nodes but has no closed path (loop), so the answer is option B. It has one branch fewer than the number of nodes, and the branches that are left out of the tree are the links, which are the ones that close the loops.
A closed path (A) would make it a loop, not a tree. A tree has to touch every node, so it cannot have no nodes (C), and it is made of branches, so it cannot have none (D).
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