Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
expand_more
expand_more
format_list_bulleted
Question
Chapter 14, Problem 2P
(a)
Program Plan Intro
To describe an
(b)
Program Plan Intro
To describe an
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
There are 2016 passengers about to board a plane, numbered 1 through 2016 in that order. Each passenger is assigned to a seat equal to his or her own number. However, the first passenger disregards instructions and instead of sitting in seat number 1, chooses and sits down in a randomly chosen seat. Each subsequent passenger acts according to the following scheme: if their assigned seat is available, they will sit there; otherwise, they will pick at random from the remaining available seats and sit there. What is the probability that the 1512th passenger ends up sitting in their assigned seat?
A. 1/2016
B. 1/2
C. 5/8
D. 3/4
E. None of the above
There are n students who studied at a late-night study for final exam. The time has come to order pizzas. Each student has his own list of required toppings (e.g. mushroom, pepperoni, onions, garlic, sausage, etc). Everyone wants to eat at least half a pizza, and the topping of that pizza must be in his reqired list. A pizza may have only one topping. How to compute the minimum number of pizzas to order to make everyone happy?
True or False
1. Matrices are often represented by single small letters a, b, c... etc.2. Two m x n matrices A and B are equal if aij=bij for each i & j. (i.e., the two matrices havesame size, and all the corresponding elements are equal).3. Matrices A & B are said to be conformable in the order AB if, and only if, the number ofrows in A is equal to the number of columns in B.4. Suppose Matrix A is having 4 rows and 3 columns, and Matrix B is having 3 rows and 2columns. The product size of AB is a 4 x 2 matrix.5. Suppose B is the matrix obtained from an n x n matrix A by multiplying the entries in arow/column by a non-zero constant and adding the result to the corresponding entries inanother row/column. Then, det(B) = det(A).
Knowledge Booster
Similar questions
- A magic square is a square array of non-negative integers where the sums of the numbers on each row,each column, and both main diagonals are the same. An N × N occult square is a magic square with Nrows and N columns with additional constraints:• The integers in the square are between 0 and N, inclusive.• For all 1 ≤ i ≤ N, the number i appears at most i times in the square.• There are at least two distinct positive integers in the square.For example, the following is a 5 × 5 occult square, where the sums of the numbers on each row, eachcolumn, and both main diagonals are 7:0 0 0 3 42 4 0 0 10 0 3 4 05 0 0 0 20 3 4 0 0For a given prime number P, you are asked to construct a P × P occult square, or determine whether nosuch occult square exists.InputInput contains a prime number: P (2 ≤ P ≤ 1000) representing the number of rows and columns in theoccult square.OutputIf there is no P × P occult square, simply output -1 in a line. Otherwise, output P lines, each contains Pintegers…arrow_forwardImagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.arrow_forwardDingyu is playing a game defined on an n X n board. Each cell (i, j) of the board (1 2, he may only go to (2, n).) The reward he earns for a move from cell C to cell D is |value of cell C – value of cell D|. The game ends when he reaches (n, n). The total reward - is the sum of the rewards for each move he makes. For example, if n = 1 2 and A = 3 the answer is 4 since he can visit (1, 1) → (1, 2) → (2, 2), and no other solution will get a higher reward. A. Write a recurrence relation to express the maximum possible reward Dingyu can achieve in traveling from cell (1, 1) to cell (n, n). Be sure to include any necessary base cases. B. State the asymptotic (big-O) running time, as a function of n, of a bottom-up dynamic programming algorithm based on your answer from the previous part. Briefly justify your answer. (You do not need to write down the algorithm itself.)arrow_forward
- Correct answer will be upvoted else downvoted. Computer science. Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors; contrast between any two divisors of an is essentially d. Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains a solitary integer d (1≤d≤10000). Output For each experiment print one integer a — the response for this experiment.arrow_forwardConsider an n by n matrix, where each of the n2 entries is a positive integer. If the entries in this matrix are unsorted, then determining whether a target number t appears in the matrix can only be done by searching through each of the n2 entries. Thus, any search algorithm has a running time of O(n²). However, suppose you know that this n by n matrix satisfies the following properties: • Integers in each row increase from left to right. • Integers in each column increase from top to bottom. An example of such a matrix is presented below, for n=5. 4 7 11 15 2 5 8 12 19 3 6 9 16 22 10 13 14 17 24 1 18 21 23 | 26 | 30 Here is a bold claim: if the n by n matrix satisfies these two properties, then there exists an O(n) algorithm to determine whether a target number t appears in this matrix. Determine whether this statement is TRUE or FALSE. If the statement is TRUE, describe your algorithm and explain why your algorithm runs in O(n) time. If the statement is FALSE, clearly explain why no…arrow_forwardThis problem is taken from the delightful book "Problems for Mathematicians, Young and Old" by Paul R. Halmos. Suppose that 931 tennis players want to play an elimination tournament. That means: they pair up, at random, for each round; if the number of players before the round begins is odd, one of them, chosen at random, sits out that round. The winners of each round, and the odd one who sat it out (if there was an odd one), play in the next round, till, finally, there is only one winner, the champion. What is the total number of matches to be played altogether, in all the rounds of the tournament? Your answer: Hint: This is much simpler than you think. When you see the answer you will say "of course".arrow_forward
- 1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive integers X elements of P is equal to 21. For example, if N=5 and the set X = {12, 17, 3, 24, 6}, the set P = {12, 3, 6} is a valid solution for the subset21 problem in this example. {x1, x2, ..., xm}. Find a subset P of the set X such that the sum of the Formulate the subset21 problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if are solving the above example (i.e. X you {12, 17, 3, 24, 6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subset21 problem if possible without…arrow_forwardIf A = {1, 2, 6} and B = {2, 3, 5}, then the union of A and B isarrow_forwardGiven a deck of 52 playing cards, we place all cards in random order face up next to each other. Then we put a chip on each card that has at least one neighbour with the same face value (e.g., on that has another queen next to it), we put a chip. Finally, we collect all chips that were each queen placed on the cards. For example, for the sequence of cards A♡, 54, A4, 10O, 10♡, 104, 94, 30, 3♡, Q4, 34 we receive 5 chips: One chip gets placed on each of the cards 100, 10♡, 104, 30, 3♡. (a) Let p5 be the probability that we receive a chip for the 5th card (i.e., the face value of the 5th card matches the face value of one of its two neighbours). Determine p5 (rounded to 2 decimal places). (b) Determine the expected number of chips we receive in total (rounded to 2 decimal places). (c) For the purpose of this question, you can assume that the expectation of part (b) is 6 or smaller. Assume that each chip is worth v dollars. Further, assume that as a result of this game we receive at least…arrow_forward
- Single Point based Search: Fair share problem: Given a set of N positive integers S={x1, x2, x3,…, xk,… xN}, decide whether S can be partitioned into two sets S0 and S1 such that the sum of numbers in S0 equals to the sum of numbers in S1. This problem can be formulated as a minimisation problem using the objective function which takes the absolute value of the difference between the sum of elements in S0 and the sum of elements in S1. Assuming that such a partition is possible, then the minimum for a given problem instance would have an objective value of 0. A candidate solution can be represented using a binary array r=[b1, b2, b3,…, bk,… bN], where bk is a binary variable indicating which set the k-th number in S is partitioned into, that is, if bk =0, then the k-th number is partitioned in to S0, otherwise (which means bk =1) the k-th number is partitioned in to S1. For example, given the set with five integers S={4, 1, 2, 2, 1}, the solution [0,1,0,1,1] indicates that S is…arrow_forward7. For n 2 1, in how many out of the n! permutations T = (T(1), 7(2),..., 7 (n)) of the numbers {1, 2, ..., n} the value of 7(i) is either i – 1, or i, or i +1 for all 1 < i < n? Example: The permutation (21354) follows the rules while the permutation (21534) does not because 7(3) = 5. Hint: Find the answer for small n by checking all the permutations and then find the recursive formula depending on the possible values for 1(n).arrow_forward业 In the 8 queens problem, you are to place 8 queens on the chessboard in such a way that no two queens attack each other. That is, there are no two queens on the same row, column, or diagonal. The picture above shows a near solution--the top left and bottom right queens attack each other. We want to solve this problem using the techniques of symbolic Al. First, we need states. What would the best choice be for states? Each queen and its position x Michigan, Illinois, Indiana, etc. How many queens we have placed so far A board with the positions of all the queens that have been placed so far 00 What would the start state be? A single queen's position Crouched, with fingers on the starting line Placing the first queen x An empty board What would the goal state be? CA board with 8 queens placed Ball in the back of the net The positions of all 8 queens A board with 8 queens placed, none attacking each otherv What would the best choice for "edges" or "moves" be? Tiktok Moving a queen from…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education