Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
8th Edition
ISBN: 9781259676512
Author: Kenneth H Rosen
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 3, Problem 34SE
- Show that when woman do the proposing in the deferred acceptance algorithm, the matching produced is female optimal and male pessimal.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
On an assembly line, there are 3 "checkpoints" at which a widget is inspected for defects. Upon review of prior data, the following is noted:
The test for product integrity finds a problem 26% of the time
The test for product specifications finds a problem 19% of the time
The test for packaging consistency finds a problem 38% of the time
(It's not a particularly good assembly line!)
Assume for purposes of this problem, that all of the tests / checkpoint problems are independent of each other.
What is the probability that an error will be found by all of the tests?
What is the probability that an error will be found by any one of the tests? That is, a problem on the first, or second, or third test?
What is the probability that a problem will be found for the "packaging consistency" only?
What is the probability of finding an error of at least one of the tests? Hint: You can use your complement rule here.
Where is the decision tree and how do I fold it back?
Draw a decision tree that proves that
P(5,2) = (5) - P(2, 2).
How many anagrams are there of the word abracadabra?
Chapter 3 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Ch. 3.1 - List all the steps used by Algorithm 1 to find the...Ch. 3.1 - Determine which characteristics of an algorithm...Ch. 3.1 - Devise an algorithm that finds the sum of all the...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Apalindromeis a string that reads the same forward...Ch. 3.1 - Devise an algorithm to computexn, wherexis a real...
Ch. 3.1 - Describe an algorithm that interchanges the values...Ch. 3.1 - cribe an algorithm that uses only assignment...Ch. 3.1 - List all the steps used to search for 9 in the...Ch. 3.1 - List all the steps used to search for 7 in the...Ch. 3.1 - cribe an algorithm that inserts an integerxin the...Ch. 3.1 - Describe an algorithm for finding the smallest...Ch. 3.1 - Describe an algorithm that locates the first...Ch. 3.1 - Describe an algorithm that locates the last...Ch. 3.1 - Describe an algorithm that produces the maximum,...Ch. 3.1 - Describe an algorithm for finding both the largest...Ch. 3.1 - Describe an algorithm that puts the first three...Ch. 3.1 - Prob. 22ECh. 3.1 - Prob. 23ECh. 3.1 - Describe an algorithm that determines whether a...Ch. 3.1 - Describe an algorithm that will count the number...Ch. 3.1 - nge Algorithm 3 so that the binary search...Ch. 3.1 - Theternary search algorithmlocates an element in a...Ch. 3.1 - Specify the steps of an algorithm that locates an...Ch. 3.1 - Devise an algorithm that finds a mode in a list of...Ch. 3.1 - Devise an algorithm that finds all modes. (Recall...Ch. 3.1 - Two strings areanagramsif each can be formed from...Ch. 3.1 - ennreal numbersx1,x2,...,xn , find the two that...Ch. 3.1 - Devise an algorithm that finds the first term of a...Ch. 3.1 - Prob. 34ECh. 3.1 - Prob. 35ECh. 3.1 - Use the bubble sort to sort 6, 2, 3, 1, 5, 4,...Ch. 3.1 - Use the bubble sort to sort 3, 1, 5, 7, 4, showing...Ch. 3.1 - Use the bubble sort to sortd,f,k,m,a,b, showing...Ch. 3.1 - Adapt the bubble sort algorithm so that it stops...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Sort these lists using the selection sort....Ch. 3.1 - Write the selection sort algorithm in pseudocode.Ch. 3.1 - Describe an algorithm based on the linear search...Ch. 3.1 - Describe an algorithm based on the binary search...Ch. 3.1 - How many comparisons does the insertion sort use...Ch. 3.1 - How many comparisons does the insertion sort use...Ch. 3.1 - Show all the steps used by the binary insertion...Ch. 3.1 - Compare the number of comparisons used by the...Ch. 3.1 - Prob. 51ECh. 3.1 - Devise a variation of the insertion sort that uses...Ch. 3.1 - Prob. 53ECh. 3.1 - List all the steps the naive string matcher uses...Ch. 3.1 - List all the steps the naive string matcher uses...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Prob. 59ECh. 3.1 - Show that if there were a coin worth 12 cents, the...Ch. 3.1 - Prob. 61ECh. 3.1 - Prob. 62ECh. 3.1 - Devise a greedy algorithm that determines the...Ch. 3.1 - Suppose we have three menm1,m2, andm3and three...Ch. 3.1 - Write the deferred acceptance algorithm in...Ch. 3.1 - Prob. 66ECh. 3.1 - Prob. 67ECh. 3.1 - Prob. 68ECh. 3.1 - Prove that the Boyer-Moore majority vote algorithm...Ch. 3.1 - Show that the problem of determining whether a...Ch. 3.1 - Prob. 71ECh. 3.1 - Show that the problem of deciding whether a...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Prob. 11ECh. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - ermine whetherx3isO(g(x))for each of these...Ch. 3.2 - Explain what it means for a function to be 0(1)Ch. 3.2 - w that iff(x)isO(x)thenf(x)isO(x2).Ch. 3.2 - Suppose thatf(x),g(x), andh(x)are functions such...Ch. 3.2 - kbe a positive integer. Show...Ch. 3.2 - Prob. 19ECh. 3.2 - To simplify:(3a5)3 27a15 Given information:(3a5)3....Ch. 3.2 - ange the functionsn, 1000 logn,nlogn,2n!,2n,3n,...Ch. 3.2 - Arrange the...Ch. 3.2 - Suppose that you have two different algorithms for...Ch. 3.2 - Suppose that you have two different algorithms for...Ch. 3.2 - Give as good a big-Oestimate as possible for each...Ch. 3.2 - e a big-Oestimate for each of these functions. For...Ch. 3.2 - Give a big-Oestimate for each of these functions....Ch. 3.2 - each function in Exercise 1, determine whether...Ch. 3.2 - Prob. 29ECh. 3.2 - Show that each of these pairs of functions are of...Ch. 3.2 - Prob. 31ECh. 3.2 - w thatf(x)andg(x)are functions from the set of...Ch. 3.2 - Prob. 33ECh. 3.2 - Show that3x2+x+1is(3x2)by directly finding the...Ch. 3.2 - Prob. 35ECh. 3.2 - lain what it means for a function to be(1).Ch. 3.2 - Prob. 37ECh. 3.2 - Give a big-Oestimate of the product of the...Ch. 3.2 - Prob. 39ECh. 3.2 - Prob. 40ECh. 3.2 - Prob. 41ECh. 3.2 - pose thatf(x)isO(g(x)). Does it follow...Ch. 3.2 - Prob. 43ECh. 3.2 - pose thatf(x),g(x), andh(x)are functions such...Ch. 3.2 - Prob. 45ECh. 3.2 - Prob. 46ECh. 3.2 - Prob. 47ECh. 3.2 - ress the relationshipf(x)is(g(x))using a picture....Ch. 3.2 - Prob. 49ECh. 3.2 - w that iff(x)=anxn+an1xn1++a1x+a0,...Ch. 3.2 - Prob. 51ECh. 3.2 - Prob. 52ECh. 3.2 - Prob. 53ECh. 3.2 - w thatx5y3+x4y4+x3y5is(x3y3).Ch. 3.2 - w thatxyisO(xy).Ch. 3.2 - w thatxyis(xy).Ch. 3.2 - Prob. 57ECh. 3.2 - Prob. 58ECh. 3.2 - Prob. 59ECh. 3.2 - Prob. 60ECh. 3.2 - Prob. 61ECh. 3.2 - (Requires calculus) Prove or disprove that (2n)!...Ch. 3.2 - Prob. 63ECh. 3.2 - Prob. 64ECh. 3.2 - Prob. 65ECh. 3.2 - Prob. 66ECh. 3.2 - Prob. 67ECh. 3.2 - Prob. 68ECh. 3.2 - Prob. 69ECh. 3.2 - Prob. 70ECh. 3.2 - Prob. 71ECh. 3.2 - Prob. 72ECh. 3.2 - Show thatnlognisO(logn!).Ch. 3.2 - Prob. 74ECh. 3.2 - Prob. 75ECh. 3.2 - Prob. 76ECh. 3.2 - (Requires calculus) For each of these pairs of...Ch. 3.3 - Give a big-Oestimate for the number of operations...Ch. 3.3 - Give a big-Oestimate for the number additions used...Ch. 3.3 - Give a big-Oestimate for the number of operations,...Ch. 3.3 - Give a big-Oestimate for the number of operations,...Ch. 3.3 - Prob. 5ECh. 3.3 - Use pseudocode to describe the algorithm that puts...Ch. 3.3 - Suppose that an element is known to be among the...Ch. 3.3 - Prob. 8ECh. 3.3 - Give a big-Oestimate for the number of comparisons...Ch. 3.3 - Show that this algorithm determines the number of...Ch. 3.3 - pose we havensubsetsS1,S2, ...,Snof the set {1, 2,...Ch. 3.3 - Consider the following algorithm, which takes as...Ch. 3.3 - The conventional algorithm for evaluating a...Ch. 3.3 - re is a more efficient algorithm (in terms of the...Ch. 3.3 - t is the largestnfor which one can solve within...Ch. 3.3 - What is the largestnfor which one can solve within...Ch. 3.3 - What is the largestnfor which one can solve within...Ch. 3.3 - How much time does an algorithm take to solve a...Ch. 3.3 - Prob. 19ECh. 3.3 - What is the effect in the time required to solve a...Ch. 3.3 - Prob. 21ECh. 3.3 - Determine the least number of comparisons, or...Ch. 3.3 - Analyze the average-case performance of the linear...Ch. 3.3 - An algorithm is calledoptimalfor the solution of a...Ch. 3.3 - Describe the worst-case time complexity, measured...Ch. 3.3 - Prob. 26ECh. 3.3 - Prob. 27ECh. 3.3 - Prob. 28ECh. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Prob. 32ECh. 3.3 - Prob. 33ECh. 3.3 - Prob. 34ECh. 3.3 - Determine a big-O estimate for the worst-case...Ch. 3.3 - Determine the number of character comparisons used...Ch. 3.3 - Determine a big-Oestimate of the number of...Ch. 3.3 - Prob. 38ECh. 3.3 - Prob. 39ECh. 3.3 - Show that the greedy algorithm for making change...Ch. 3.3 - rcises 41 and 42 deal with the problem of...Ch. 3.3 - rcises 41 and 42 deal with the problem of...Ch. 3.3 - Prob. 43ECh. 3.3 - Prob. 44ECh. 3.3 - Prob. 45ECh. 3.3 - Prob. 46ECh. 3.3 - Prob. 47ECh. 3.3 - Prob. 48ECh. 3.3 - Prob. 49ECh. 3 - Define the termalgorithm. What are the different...Ch. 3 - Describe, using English, an algorithm for finding...Ch. 3 - Prob. 3RQCh. 3 - Prob. 4RQCh. 3 - Prob. 5RQCh. 3 - Define what the worst-case time complexity,...Ch. 3 - Prob. 7RQCh. 3 - Describe the bubble sort algorithm. Use the bubble...Ch. 3 - Describe the insertion sort algorithm. Use the...Ch. 3 - Explain the concept of a greedy algorithm. Provide...Ch. 3 - Prob. 11RQCh. 3 - Describe an algorithm for locating the last...Ch. 3 - Prob. 2SECh. 3 - Give an algorithm to determine whether a bit...Ch. 3 - Suppose that a list contains integers that are in...Ch. 3 - Prob. 5SECh. 3 - Prob. 6SECh. 3 - Prob. 7SECh. 3 - Prob. 8SECh. 3 - Prob. 9SECh. 3 - Prob. 10SECh. 3 - Show the steps used by the shaker sort to sort the...Ch. 3 - Express the shaker sort in pseudocode.Ch. 3 - Prob. 13SECh. 3 - Prob. 14SECh. 3 - Prob. 15SECh. 3 - w that8x3+12x+100logxisO(x3).Ch. 3 - Prob. 17SECh. 3 - Prob. 18SECh. 3 - Prob. 19SECh. 3 - w thatnnis notO(n!).Ch. 3 - Prob. 21SECh. 3 - Prob. 22SECh. 3 - Prob. 23SECh. 3 - Prob. 24SECh. 3 - Arrange the...Ch. 3 - Prob. 26SECh. 3 - Prob. 27SECh. 3 - Show that if the denominations of coins arec0,c1,...Ch. 3 - Prob. 29SECh. 3 - Prob. 30SECh. 3 - Prob. 31SECh. 3 - Show that the deferred acceptance algorithm given...Ch. 3 - Prob. 33SECh. 3 - Show that when woman do the proposing in the...Ch. 3 - Prob. 35SECh. 3 - Prob. 36SECh. 3 - Prob. 37SECh. 3 - Prob. 38SECh. 3 - Prob. 39SECh. 3 - Prob. 40SECh. 3 - Prob. 41SECh. 3 - Exercises 4246 we will study the problem of load...Ch. 3 - Prob. 43SECh. 3 - Prob. 44SECh. 3 - Prob. 45SECh. 3 - Prove that the algorithm from Exercise 44 is a...Ch. 3 - Prob. 1CPCh. 3 - Prob. 2CPCh. 3 - Prob. 3CPCh. 3 - Prob. 4CPCh. 3 - Prob. 5CPCh. 3 - Prob. 6CPCh. 3 - Prob. 7CPCh. 3 - Given an integern, use the cashier’s algorithm to...Ch. 3 - Prob. 9CPCh. 3 - Prob. 10CPCh. 3 - Prob. 11CPCh. 3 - Prob. 1CAECh. 3 - Prob. 2CAECh. 3 - Using a generator of random orderings of the...Ch. 3 - Prob. 4CAECh. 3 - Write a program that animates the progress of all...Ch. 3 - Examine the history of the wordalgorithmand...Ch. 3 - Prob. 2WPCh. 3 - Explain how sorting algorithms can be classified...Ch. 3 - Prob. 4WPCh. 3 - Prob. 5WPCh. 3 - Prob. 6WPCh. 3 - Describe the historic trends in how quickly...Ch. 3 - Develop a detailed list of algorithmic paradigms...Ch. 3 - Explain what the Turing Award is and describe the...Ch. 3 - Prob. 10WPCh. 3 - Prob. 11WPCh. 3 - Describe six different NP-complete problems.Ch. 3 - Prob. 13WP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- A survey of 1000 adult Internet users found that 55% of 18-to 24- year –olds, 60% of 25-to 34- year –olds, 64% of 35-to 49- year –olds, 78% of 50 – to- 64 year-olds, and 85% of 65 – to- 89-year-olds opposed online ads tailored to their individual interests. Supposed the survey was based on 200 respondents in each of the five age groups. Construct the contingency table based on the information given. Compute the expected frequencies for each cell. Compute. Is there evidence of a significance difference among the age groups with respect to the proportion who preferred to use media social as the medium of communication? (Use α=0.01)arrow_forwardSuppose we learned a tree on a dataset and learned a tree with the following decision boundary. The image also shows the training examples used to learn the tree with "+" indicating positive label while "-" indicating negative. For this question, we are interested in using the tree learned from this data to predict the probability a point has a positive label. Using this tree, what is the predicted probability that the label is positive for the input (x[1] = 4, x[2]=2)? Enter your answer as a number between 0 and 1 (rounded to two decimal places) x[2] 4 3 2 0.87 2 3 4 x[1]arrow_forwardThree biscuits making machines A, B and C are installed in a factory. Machine A makes 35% of the biscuits. Machine B makes 27% of the biscuits and the rest of the biscuits are made by machine C. It is found that 4 % of the biscuits made by machine A are broken, 1 % of the biscuits made by machine B are broken and 9 % of the biscuits made by machine C are broken. Draw a tree diagram to categorize all the possible outcomes and associated probabilities. If a biscuit is selected at random: 1. Calculate the probability that the biscuit is made by machine B is not broken. 2. Calculate the probability that the biscuit is broken 3. Given that the biscuit is broken, find the probability that it is not made by machine A.arrow_forward
- The National Football League (NFL) holds its annual draft of the nation's best college football players in April each year. Prior to the draft, various sporting news services project the players who will be drafted along with the order in which each vill be selected in what are called mock drafts. Players who are considered to have superior potential as profe football players are selected earlier in the draft. Suppose the following table shows projections by one mock draft service of what position in the first round players from the Atlantic Coast Conference, the Big Ten Conference, the PAC-12 Conference, and the Southeastern Conference will be selected. Big Ten ACC PAC-12 SEC College Attended Projected Draft College Attended Projected Draft College Attended Projected Draft College Attended Projected Draft Position Position Position Position Florida State 3 Iowa USC 1 Florida Clemson Michigan St 10 Oregon 7 Alabama 4 Miami 9 Nebraska 11 Oregon 15 Kentucky Georgia Tech 12 Minnesota 26…arrow_forwardAccording to the Max Markwell classifica- tion, there are three types of drivers on High- way 71 between Bastrop, Texas and Austin, Texas: Good, Bad, and Egregious. 12% of all drivers are Good ●68% of all drivers are Bad • All remaining drivers are Egregious Good drivers drive in the passing lane 28% of the time (e.g., only while actively passing or making a left turn within the next 1/2 mile) • Bad drivers drive in the passing lane 74% of the time Egregious drivers camp in the passing lane 100% of the time. You observe a driver in the passing lane. De- termine the probability that the driver is a Bad or Egregious driver. NOTE: Round to the nearest whole percent. Answer in units of percent.arrow_forwardAmong the workers in a factory only 50% receive bonus. Among those receiving the bonus 30% are skilled. What is the pre bability of a randomly selected worker who is skilled and receiving bonus.arrow_forward
- According to a recent survey of adults, approximately 62% carry cash on a regular basis. The adults were also asked if they have children. Of the 46% who have children, 85% carry cash on a regular basis. Is carrying cash independent from having children in this sample? No, P(carry cash) = P(carry cash|have children). No, P(carry cash) ≠ P(carry cash|have children). Yes, P(carry cash) = P(carry cash|have children). Yes, P(carry cash) ≠ P(carry cash|have children).arrow_forward10. The probability that Anya will be wearing her favourite shirt on a day of a test is 60%. She has figured out that if she wears her favourite shirt, the probability that she gets an A on a test is 70%. However, there is only a 25% chance she will get an A if she does NOT wear her favourite shirt. a) Construct a tree diagram that illustrates all the possible outcomes in the above scenarios. Be sure to define your variables, include all necessary values, and use proper set notation. b) Use the information in the tree diagram above to determine the probability that Anya will get an A on any given test. Be sure to use appropriate notation in your solution. L.arrow_forward5. One bag contains four green marbles (labeled G1, G2, G3, G4). A second bag contains two green marbles (labeled G5, Ge) and two red marbles (labeled R1, R2). An experiment is performed in which one of the two bags is chosen at random and then two marbles are randomly chosen, one after the other without replacement. (a) Construct a possibility tree showing all possible outcomes of this experiment. (b) What is the total number of outcomes of this experiment? (c) What is the probability that two green marbles are chosen? (d) What is the probability that two marbles of different colors are chosen? (e) What is the probability that two red marbles are chosen? Reality check: Check that your probabilities add up to 1.arrow_forward
- The U.S. Census Bureau conducts annual surveys to obtain information on the percentage of the voting-age population that is registered to vote. Suppose that578 employed persons and 492 unemployed persons are independently and randomly selected, and that261 of the employed persons and 194 of the unemployed persons have registered to vote. Can we conclude that the percentage of employed workers ( p1 ), who have registered to vote, exceeds the percentage of unemployed workers ( p2 ), who have registered to vote? Use a significance level of α=0.1 for the test. Step 5 of 6 : Determine the decision rule for rejecting the null hypothesis H0H0. Round the numerical portion of your answer to two decimal places.arrow_forwardA social and personality psychologist thinks that creativity differs by personality traits, rather than the traditional view that it is a cognitive process. Specifically, this psychologist thinks that introverts are more creative than extraverts. The researcher gives a personality test to a group of 16 university students and then separates them based on the assessment results into 2 groups: the extraverts and the introverts. The participants are then asked to write a short story which is rated on creativity by a well-known author. The creativity scores range from 0 to 20 on an interval scale, where higher scores indicate greater creativity. The results are shown in the table below. Using the 0.05 alpha level, are introverts more creative than extroverts? Use all of the steps of hypothesis testing. I am getting confused with the steps and how to know which direction to take when selecting my steps. Extroverts Introverts 8 18 7 17 11 10 3 14 5 16 8 15 7 19 4 12arrow_forwardA social and personality psychologist thinks that creativity differs by personality traits, rather than the traditional view that it is a cognitive process. Specifically, this psychologist thinks that introverts are more creative than extraverts. The researcher gives a personality test to a group of 16 university students and then separates them based on the assessment results into 2 groups: the extraverts and the introverts. The participants are then asked to write a short story which is rated on creativity by a well-known author. The creativity scores range from 0 to 20 on an interval scale, where higher scores indicate greater creativity. The results are shown in Table 2. Using the 0.05 alpha level, are introverts more creative than extroverts? Use all of the steps of hypothesis testing. extrovert introvert 8 18 7 17 11 10 3 14 5 16 8 15 7 19 4 12arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
12. Searching and Sorting; Author: MIT OpenCourseWare;https://www.youtube.com/watch?v=6LOwPhPDwVc;License: Standard YouTube License, CC-BY
Algorithms and Data Structures - Full Course for Beginners from Treehouse; Author: freeCodeCamp.org;https://www.youtube.com/watch?v=8hly31xKli0;License: Standard Youtube License