Unformatted text preview: Each call to the oracle takes linear time in terms of the argument; that is quality( S ) takes O (  S  ) . Using the given oracle, give an algorithm that takes a string Y and computes a segmentation of maximum total quality. 2. Give a polynomial time algorithm which given two strings A and B returns the longest sequence S that is a subsequence of A and B . 3. Consider a rooted tree T . Assume the root has a message to send to all nodes. At the beginning only the root has the message. If a node has the message, it can forward it to one of its children at each time step. Design an algorithm to ﬁnd the minimum number of time steps required for the message to be delivered to all nodes. 1...
View
Full
Document
This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
 Fall '08
 Chekuri,C
 Algorithms, C Programming

Click to edit the document details