ISI2014-PCB-CS-3b

+1 vote

227 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$.

descriptive
isi2014-pcb-cs
algorithms
spanning-tree
graph-algorithms

asked May 31, 2016 in Algorithms by jothee Veteran (105k points) | 227 views

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

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

answered Oct 15, 2016 by Ml_Nlp (385 points)

Please log in or register to add a comment.

← Prev. Qn. in Sub. Next Qn. in Sub. →

← Prev. Next →

Related questions

+1 vote

0 answers

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.

asked May 31, 2016 in Algorithms by jothee Veteran (105k points) | 93 views

isi2014-pcb-cs
descriptive
algorithms
algorithm-design

+10 votes

1 answer

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

asked May 31, 2016 in DS by jothee Veteran (105k points) | 487 views

descriptive
isi2014-pcb-cs
algorithms
binary-tree
heap

+1 vote

1 answer

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.

asked May 31, 2016 in Algorithms by jothee Veteran (105k points) | 119 views

isi2014-pcb-cs
algorithms
algorithm-design

+1 vote

0 answers

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?

asked May 31, 2016 in Computer Networks by jothee Veteran (105k points) | 172 views

descriptive
isi2014-pcb-cs
token-ring

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

Recent Blog Comments

100 percent
I am getting 151 marks excluding question not...
everyone will be surprised seeing the cutoff this...
There is no point of any debate/discourse here....
absolutely right

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Recent Posts

Recent Blog Comments