From a list of network switches within a company and the length of wired network cable length from one network switch to another, find the minimum total cable length so that all network switches are connected and the list of the connections. Output explanation: the total network length to connect A, B, C, D switches are 33 and the network connections are: B to C 10, A to B 11 and B to D 12 A. Design your algorithm in a pseudocode! (PS: use greedy algorithm) B. Do analysis for your algorithm resulting in an asymptotic notation (use E for the connections and V for the switch, e.g. O(E x V), O(E log V), O(E x E), etc.)! C. Prove that your algorithm is correct and create your own Input / Output with minimum of 6 switches and 12 network connections!
From a list of network switches within a company and the length of wired network cable length from one network switch to another, find the minimum total cable length so that all network switches are connected and the list of the connections.
Output explanation: the total network length to connect A, B, C, D switches are 33 and the network connections are: B to C 10, A to B 11 and B to D 12
A. Design your
B. Do analysis for your algorithm resulting in an asymptotic notation (use E for the connections and V for the switch, e.g. O(E x V), O(E log V), O(E x E), etc.)!
C. Prove that your algorithm is correct and create your own Input / Output with minimum of 6 switches and 12 network connections!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images