menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

ISI2014-PCB-CS-3b

1 vote
337 views
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
in Algorithms 337 views

1 Answer

3 votes

Sorry, I'm not able to upload the protrait version of the image .

It is just some changes in the Minimum spanning tree algo.Correct me if I'm wrong.

0
It’s greedy right?
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
189 views
ISI2014-PCB-CS-1
Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job is to split the bar into small squares by breaking along the lines between the squares. We obviously want to do it with the minimum ... m as inputs and print the line numbers along the length and the breadth according to your strategy of breaking the chocolate.
Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job is to split the bar into small squares by breaking along the lines between the squares. We obviously want to do it with the minimum number of ... n, m as inputs and print the line numbers along the length and the breadth according to your strategy of breaking the chocolate.
asked May 31, 2016 in Algorithms jothee 189 views
11 votes
1 answer
2
751 views
ISI2014-PCB-CS-2b
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm to merge $H_1$ and $H_2$ to a new max-heap $H$ of size $2n$.
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm to merge $H_1$ and $H_2$ to a new max-heap $H$ of size $2n$.
asked May 31, 2016 in DS jothee 751 views
1 vote
1 answer
3
214 views
ISI2014-PCB-CS-3a
Let $A$ and $B$ be two arrays, each containing $n$ distinct integers. Each of them is sorted in increasing order. Let $C = A \cup B$. Design an algorithm for computing the median of $C$ as efficiently as you can.
Let $A$ and $B$ be two arrays, each containing $n$ distinct integers. Each of them is sorted in increasing order. Let $C = A \cup B$. Design an algorithm for computing the median of $C$ as efficiently as you can.
asked May 31, 2016 in Algorithms jothee 214 views
1 vote
0 answers
4
310 views
ISI2014-PCB-CS-7b
A heavily loaded $1$ km long, $10$ Mbps token ring network has a propagation speed of $200$ meter per micro-second. Fifty stations are uniformly spaced around the ring. Each data packet is $256$ bits long, including $32$ bits of header. The token is of $8$ bits. What is the effective data rate of the network assuming the stations always have packets to transmit?
A heavily loaded $1$ km long, $10$ Mbps token ring network has a propagation speed of $200$ meter per micro-second. Fifty stations are uniformly spaced around the ring. Each data packet is $256$ bits long, including $32$ bits of header. The token is of $8$ bits. What is the effective data rate of the network assuming the stations always have packets to transmit?
asked May 31, 2016 in Computer Networks jothee 310 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...