A team sport game has m players in a team and a tournament can have n competing teams. Team T1 ranks higher than team T2 if there is a way such that every member of T1 ranks higher than a corresponding member of T2 (note that the ranking is based on individual team members). (1) Design an efficient algorithm (pseudo code) to determine whether or not two teams T1 and T2 can be ranked. (2) Given n teams {T1, T2, ... , Tn}, abstract the team ranking problem as a graph. (3) Design an efficient algorithm (pseudo code) to find the longest sequence of teams such that Tij ranks higher than Tij + 1 for j = 1,2,..., k − 1. (4) Analyze the time complexity of your algorithm in terms of m and n

A team sport game has m players in a team and a tournament can have n competing teams. Team T1 ranks higher than team T2 if there is a way such that every member of T1 ranks higher than a corresponding member of T2 (note that the ranking is based on individual team members). (1) Design an efficient algorithm (pseudo code) to determine whether or not two teams T1 and T2 can be ranked. (2) Given n teams {T1, T2, ... , Tn}, abstract the team ranking problem as a graph. (3) Design an efficient algorithm (pseudo code) to find the longest sequence of teams such that Tij ranks higher than Tij + 1 for j = 1,2,..., k − 1. (4) Analyze the time complexity of your algorithm in terms of m and n

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

This problem exercises the basic concepts of game playing, using tic-tac-toe (noughtsand crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3 = 1 and −1 to any position with O3 = 1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval (s) = 3X2(s)+X1(s)−(3O2(s)+O1(s))."Mark on your tree the evaluations of all the positions at depth 2."
Consider the following bridge crossing problem where n people with speeds s1, ··· , sn wish to cross the bridge as quickly as possible. The rules remain: • It is nighttime and you only have one flashlight. • A maximum of two people can cross at any one time • Any party who crosses, either 1 or 2 people must have the flashlight with them. • The flashlight must be walked back and forth, it cannot be thrown, etc. • A pair must walk together at the rate of the slower person’s pace. Give an efficient algorithm to find the fastest way to get a group of people across the bridge. You must have a proof of correctness for your method.
Given an array of integers, find the longest non-decreasing subsequences (the subsequence does not need to be consecutive). For example, A = [8,5,2,10,3,6,9,7] contains the longest subsequences [2,3,6,9] and [2,3,6,7].a. Formulate the recursive relation of the optimal solution (do not miss the base case); b. Design a bottom-up (iterative) algorithm to calculate the length of the longest non-decreasing subsequences (pseudo code); c. Analyze the complexity of your algorithm.
There are n people who want to carpool during m days. On day i, some subset ???? of people want to carpool, and the driver di must be selected from si . Each person j has a limited number of days fj they are willing to drive. Give an algorithm to find a driver assignment di ∈ si each day i such that no person j has to drive more than their limit fj. (The algorithm should output “no” if there is no such assignment.) Hint: Use network flow. For example, for the following input with n = 3 and m = 3, the algorithm could assign Tom to Day 1 and Day 2, and Mark to Day 3. Person Day 1 Day 2 Day 3 Driving Limit 1 (Tom) x x x 2 2 (Mark) x x 1 3 (Fred) x x 0
Given an array of integers, find the longest non-decreasing subsequences (the subsequence doesnot need to be consecutive). For example, A = [8,5,2,10,3,6,9,7] contains the longest subsequences[2,3,6,9] and [2,3,6,7].(1) Formulate the recursive relation of the optimal solution (do not miss the base case);(2) Design a bottom-up (iterative) algorithm to calculate the length of the longest non-decreasingsubsequences (pseudo code);(3) Analyze the complexity of your algorithm
Correct answer will be upvoted else Multiple Downvoted. Computer science. Gildong has a square board comprising of n lines and n sections of square cells, each comprising of a solitary digit (from 0 to 9). The cell at the j-th section of the I-th line can be addressed as (i,j), and the length of the side of every cell is 1. Gildong prefers enormous things, so for every digit d, he needs to find a triangle with the end goal that: Every vertex of the triangle is in the focal point of a cell. The digit of each vertex of the triangle is d. Somewhere around one side of the triangle is corresponding to one of the sides of the board. You might expect that a side of length 0 is corresponding to the two sides of the board. The space of the triangle is boosted. Obviously, he can't simply be content with tracking down these triangles with no guarantees. Along these lines, for every digit d, he will change the digit of precisely one cell of the board to d, then, at that point, track…
Roses 1 2 3 4 5 Profit $5 $15 $24 $30 $35 For each positive integer n, let f(n) be the maximum profit that Flora can make with n roses.For example, if n = 10, Flora can make numerous bouquet combinations, including two 5-rose bouquets (total profit of $70), and a 4-rose bouquet with three 2-rose bouquets (total profit of $75). Provide two different algorithms for calculating f(n): one using Recursion, and one using Dynamic Programming. Explain why both algorithms are guaranteed to return the correct value of f(n).
Consider GCET’s central library where the librarian Mario is required to sort thebooks before closing each day. The library has long shelves, and the books arenumbered through 1 to N, the librarian wishes to arrange the books so that they appearin the sequence 1,2, …, N.He intends to do this by a sequence of moves. In each move Mario can pick up anybook and insert it at a different place. Let he has 5 books and they are initially arrangedin the order: 1 4 5 3 2Mario will rearrange this in ascending order by first moving book 2 to the beginningof the shelf to get : 1 2 4 5 3Then moving book 3 to position 3, he gets 1 2 3 4 5You are required to write a program for Mario that determines the minimum numberof moves that are necessary to sort the bookshelf. C programming, please solve with full answer and solve with Flowchart and Discription
Consider GCET’s central library where the librarian Mario is required to sort thebooks before closing each day. The library has long shelves, and the books arenumbered through 1 to N, the librarian wishes to arrange the books so that they appearin the sequence 1,2, …, N.He intends to do this by a sequence of moves. In each move Mario can pick up anybook and insert it at a different place. Let he has 5 books and they are initially arrangedin the order: 1 4 5 3 2Mario will rearrange this in ascending order by first moving book 2 to the beginningof the shelf to get : 1 2 4 5 3Then moving book 3 to position 3, he gets 1 2 3 4 5You are required to write a program for Mario that determines the minimum numberof moves that are necessary to sort the bookshelf. please solve with Flowchart and description
Using C++, code the following problem: In this problem, we are given a knapsack of fixed capacity C. We are also given a list of N objects, each having a weight W(I) and profit P(I). We can put any subset of the objects into the knapsack, as long as the total weight of our selection does not exceed C. The goal is to maximize the total profit, which is the sum of the profits of each object we put into the knapsack. Example: Input: C = 3 W: 1 2 3 P: 100 5 50 Selected Items: 1 2 Explanation: Possible selections that can be put in the knapsack are: 1 with profit 100 2 with profit 5 3 with profit 50 1 and 2 with profit 105 Note that in this problem, there is no need that the some of weights be exactly C. Hence, in this example, 1 is a valid solution but since the profit is lower than the maximum, is not the final answer. Input Format First line is C. Second line is the number of objects, N. The next N lines, each line contains two numbers: the first number is the weight of an…
Let A = {a1, … an} and B = {b1, ... bn} be two sets of numbers. Consider the problem of finding their union, i.e., the set C of all the numbers that are in A or B or both. a. Design a brute-force algorithm for solving this problem and determine its efficiency class. b. Design a presorting-based algorithm for solving this problem and determine its efficiency class.
You are given a collection of n bolts of different widths and n corresponding nuts. Youare allowed to try a nut and bolt together, from which you can determine whether thenut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However,there is no way to compare two nuts together or two bolts together. The problem isto match each bolt to each nut. Design an algorithm for this problem with Θ(n log n) average-case complexity (in terms of nut-bolt comparisons). Explain why your algorithm has Θ(n log n) average-case complexity. You may use any result given in class without explicitly solving recurrence equations. I know that one can use Quicksort to get nlogn but I just don't know how to implement it. Thank you so much.