Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
1 does either prims or kruskals algorithm work if there are negative edge weights2 consider the collection of edges
1 write an algorithm to find a maximum cost spanning tree that is the spanning tree with highest possible cost2 when
1 write an algorithm to determine whether an undirected graph of v vertices contains a cycle your algorithm should run
revise the bst class of section 54 to use the splay tree rotations your new implementation should not modify the
implement the memmanager adt shown at the beginning of section 123 do not use separate memory for the free list but
1 a show the result of building a pr quadtree from the following points inserted in the order given assume the tree is
when performing a region search on a pr quadtree we need only search those subtrees of an internal node whose
revise the bst class of section 54 to use the avl tree rotations your new implementation should not modify the original
a chocolate company decides to promote its chocolate bars by including a coupon with each bar a bar costs a dollar and
use the pr quadtree to implement an efficient solution to problem 65 that is store the set of points in a pr quadtree
implement a city database using the bintree each database record contains the name of the city a string of arbitrary
1 state the greatest possible lower bound that you can for the all-pairs shortest paths problem and justify your
1 what is the expected average number of pointers for a skip list node2 write a function to remove a node with given
implement both a standard thetan 3 matrix multiplication algorithm and strassens matrix multiplication algorithm see
consider the so-called algorithm for algorithms in section 151 is this really an algorithm review the definition of an
single-elimination tournaments are notorious for their scheduling difficulties imagine that you are organizing a
1 show that any comparison-based algorithm for finding the median must use at least n - 1 comparisons2 show that any
1 a write an equation to describe the average cost for finding the medianb solve your equation from part a2 a write an
suppose that you have n objects that have identical weight except for one that is a bit heavier than the others you
1 write the complete algorithm for the merge insert sort sketched out in section 1572 here is a suggestion for what
1 explain why the cost of splitting a list of six into two lists of three to find the minimum and maximum elements
imagine that you have a problem p that you know is n p-complete for this problem you have two algorithms to solve it
implement vertex cover that is given graph g and integer k answer the question of whether or not there is a vertex
1 implement knapsack see section 162 measure its running time on a number of inputs what is the largest practical input
1 prove using a reduction argument such as given in section 1732 that the problem of determining whether an arbitrary