DISCRETE MATHEMATICS+ITS APPL. (LL)-W/A
8th Edition
ISBN: 9781260521337
Author: ROSEN
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Question
Chapter 11, Problem 18WP
To determine
To describe:
Algorithms to generate random trees.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Yue Bing is a new intern at Linkedln. She has designed a new recommendation algorithm for
connecting LinkedIn users to other users, and wants to see if it will cause an increase the
average number of messages sent by Linkedln users. She will randomly sample one group of
users from the LinkedIn network and set up their accounts so that they use the new
recommendation algorithm. She will then randomly sample another group of users, who will
operate on the regular recommendation algorithm. She determines how many messages are
sent by users over the course of year.
She ends up assigning 23 users to the new algorithm, and 38 users to the old algorithm. She
provides you with some of her data, though it is incomplete.
Sample Size Sample Mean Standard Deviation
New23
34.4
??
Old 38
27.3
3.1
She insists all assumptions necessary for a confidence interval for a difference between two
appropriate means have been verified. What distribution would we use to determine the critical
value of a 95%…
Google is testing 3 different search algorithms, A, B, and C. Ideally, a good algorithm would show the user a link they want to click on right away. An algorithm where the user needs to try many searches before they find something they want is not as good.
One way Google judges a search algorithm is to see how many searches a user does until the user clicks on a link. The fewer the searches, the better the algorithm.
After collecting sample data from random users running the three algorithms, Google conducts an ANOVA (analysis of variance) test for the mean number of searches before clicking on a link.
Suppose the p-value is 0.024.
(a) Write the null and hypotheses. Define all parameters.
(b) Write the conclusion verbally and in context.
Find the median, first quartile (Q1) and the third quartile (Q3) for the data shown, which is already sorted. The number of data is n= 11. Katye Kozak's algorithm: Sort the data and compute the median. When n is an odd number, the median is the center value. When n is an even number, the median is the center value. After computing the median, Q1 is the median of the 1st half of the data, not including the median value. Q3 is the median of the 2nd half of the data, not including the median value. Do not round your answers.
x2.66.88.51515.821.221.721.922.128.829.8MedianMedian= Q1Q1= Q3Q3=
Chapter 11 Solutions
DISCRETE MATHEMATICS+ITS APPL. (LL)-W/A
Ch. 11.1 - Prob. 1ECh. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3ECh. 11.1 - Prob. 4ECh. 11.1 - Prob. 5ECh. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Prob. 8ECh. 11.1 - Prob. 9ECh. 11.1 - Prob. 10E
Ch. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.1 - Prob. 13ECh. 11.1 - Prob. 14ECh. 11.1 - Let G he a simple graph with n vertices. Show that...Ch. 11.1 - Prob. 16ECh. 11.1 - Prob. 17ECh. 11.1 - Prob. 18ECh. 11.1 - Prob. 19ECh. 11.1 - Prob. 20ECh. 11.1 - Prob. 21ECh. 11.1 - A chain letter starts when a person sends a letter...Ch. 11.1 - A chain letter starts with a person sending a...Ch. 11.1 - Prob. 24ECh. 11.1 - Prob. 25ECh. 11.1 - Prob. 26ECh. 11.1 - Prob. 27ECh. 11.1 - Prob. 28ECh. 11.1 - Prob. 29ECh. 11.1 - Prob. 30ECh. 11.1 - Prob. 31ECh. 11.1 - Prob. 32ECh. 11.1 - Prob. 33ECh. 11.1 - Prob. 34ECh. 11.1 - Prob. 35ECh. 11.1 - Prob. 36ECh. 11.1 - Letnbe a power of 2. Show thatnnumbers can be...Ch. 11.1 - Prob. 38ECh. 11.1 - Prob. 39ECh. 11.1 - Prob. 40ECh. 11.1 - Prob. 41ECh. 11.1 - Prob. 42ECh. 11.1 - Prob. 43ECh. 11.1 - Prob. 44ECh. 11.1 - Draw the first seven rooted Fibonacci trees.Ch. 11.1 - Prob. 46ECh. 11.1 - Prob. 47ECh. 11.1 - Show that the average depth of a leaf in a binary...Ch. 11.2 - Build a binary search tree for the...Ch. 11.2 - Build a binary search tree for the words oenology,...Ch. 11.2 - How many comparisons are needed to locate or to...Ch. 11.2 - How many comparisons are needed to locate or to...Ch. 11.2 - Using alphabetical order, construct a binary...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - One of four coins may be counterfeit. If it is...Ch. 11.2 - Find the least number of comparisons needed to...Ch. 11.2 - Prob. 12ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 15ECh. 11.2 - Prob. 16ECh. 11.2 - Prob. 17ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 21ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 23ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 25ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - Suppose thatmis a positive integer with m>2An...Ch. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Suppose that m is a positive integer withm= 2. An...Ch. 11.2 - Suppose thatmis a positive integer withm= 2....Ch. 11.2 - Prob. 33ECh. 11.2 - Prob. 34ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 36ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 39ECh. 11.2 - Suppose that m is a positive integer withm= 2. An...Ch. 11.2 - Prob. 41ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 43ECh. 11.2 - Prob. 44ECh. 11.3 - Prob. 1ECh. 11.3 - Prob. 2ECh. 11.3 - Prob. 3ECh. 11.3 - Prob. 4ECh. 11.3 - Suppose that the vertex with the largest address...Ch. 11.3 - Prob. 6ECh. 11.3 - Prob. 7ECh. 11.3 - Prob. 8ECh. 11.3 - Prob. 9ECh. 11.3 - Prob. 10ECh. 11.3 - Prob. 11ECh. 11.3 - Prob. 12ECh. 11.3 - Prob. 13ECh. 11.3 - Prob. 14ECh. 11.3 - Prob. 15ECh. 11.3 - Prob. 16ECh. 11.3 - Prob. 17ECh. 11.3 - a) Represent the compound propositionsandusing...Ch. 11.3 - a) Represent(AB)(A(BA))using an ordered rooted...Ch. 11.3 - In how many ways can the stringbe fully...Ch. 11.3 - In how many ways can the stringbe fully...Ch. 11.3 - Draw the ordered rooted tree corresponding to each...Ch. 11.3 - What is the value of each of these prefix...Ch. 11.3 - What is the value of each of these postfix...Ch. 11.3 - Prob. 25ECh. 11.3 - Prob. 26ECh. 11.3 - Prob. 27ECh. 11.3 - Prob. 28ECh. 11.3 - Prob. 29ECh. 11.3 - Prob. 30ECh. 11.3 - Show that any well-formed formula in prefix...Ch. 11.3 - Prob. 32ECh. 11.3 - Prob. 33ECh. 11.3 - Prob. 34ECh. 11.4 - How many edges must be removed from a connected...Ch. 11.4 - Prob. 2ECh. 11.4 - Prob. 3ECh. 11.4 - Prob. 4ECh. 11.4 - Prob. 5ECh. 11.4 - Prob. 6ECh. 11.4 - Prob. 7ECh. 11.4 - Prob. 8ECh. 11.4 - Prob. 9ECh. 11.4 - Prob. 10ECh. 11.4 - Prob. 11ECh. 11.4 - Prob. 12ECh. 11.4 - Prob. 13ECh. 11.4 - Prob. 14ECh. 11.4 - Prob. 15ECh. 11.4 - Prob. 16ECh. 11.4 - Prob. 17ECh. 11.4 - Prob. 18ECh. 11.4 - Prob. 19ECh. 11.4 - Prob. 20ECh. 11.4 - Prob. 21ECh. 11.4 - Describe the tree produced by breadth-first search...Ch. 11.4 - Prob. 23ECh. 11.4 - Explain how breadth-first search or depth-first...Ch. 11.4 - Prob. 25ECh. 11.4 - Prob. 26ECh. 11.4 - Prob. 27ECh. 11.4 - Use backtracking to find a subset, if it exists,...Ch. 11.4 - Explain how backtracking can be used to find a...Ch. 11.4 - Prob. 30ECh. 11.4 - Prob. 31ECh. 11.4 - A spanning forest of a graphGis a forest that...Ch. 11.4 - Prob. 33ECh. 11.4 - Prob. 34ECh. 11.4 - Prob. 35ECh. 11.4 - A spanning forest of a graphGis a forest that...Ch. 11.4 - Prob. 37ECh. 11.4 - Prob. 38ECh. 11.4 - Prob. 39ECh. 11.4 - Prob. 40ECh. 11.4 - Prob. 41ECh. 11.4 - Prob. 42ECh. 11.4 - Prob. 43ECh. 11.4 - Prob. 44ECh. 11.4 - Prob. 45ECh. 11.4 - Prob. 46ECh. 11.4 - Prob. 47ECh. 11.4 - Prob. 48ECh. 11.4 - Prob. 49ECh. 11.4 - Prob. 50ECh. 11.4 - Prob. 51ECh. 11.4 - Prob. 52ECh. 11.4 - Prob. 53ECh. 11.4 - Prob. 54ECh. 11.4 - Prob. 55ECh. 11.4 - Prob. 56ECh. 11.4 - Prob. 57ECh. 11.4 - Prob. 58ECh. 11.4 - Prob. 59ECh. 11.4 - Prob. 60ECh. 11.4 - Prob. 61ECh. 11.5 - The roads represented by this graph are all...Ch. 11.5 - Prob. 2ECh. 11.5 - Prob. 3ECh. 11.5 - Prob. 4ECh. 11.5 - Prob. 5ECh. 11.5 - Prob. 6ECh. 11.5 - Prob. 7ECh. 11.5 - Prob. 8ECh. 11.5 - Prob. 9ECh. 11.5 - Prob. 10ECh. 11.5 - Prob. 11ECh. 11.5 - Prob. 12ECh. 11.5 - Prob. 13ECh. 11.5 - Prob. 14ECh. 11.5 - Prob. 15ECh. 11.5 - Prob. 16ECh. 11.5 - Prob. 17ECh. 11.5 - Prob. 18ECh. 11.5 - Prob. 19ECh. 11.5 - Prob. 20ECh. 11.5 - Prob. 21ECh. 11.5 - Prob. 22ECh. 11.5 - Express the algorithm devised in Exercise 22 in...Ch. 11.5 - Prob. 24ECh. 11.5 - Prob. 25ECh. 11.5 - Prob. 26ECh. 11.5 - Prob. 27ECh. 11.5 - Prob. 28ECh. 11.5 - Prob. 29ECh. 11.5 - Prob. 30ECh. 11.5 - Prob. 31ECh. 11.5 - Prob. 32ECh. 11.5 - Prob. 33ECh. 11.5 - Prob. 34ECh. 11.5 - Prob. 35ECh. 11 - Prob. 1RQCh. 11 - Prob. 2RQCh. 11 - Prob. 3RQCh. 11 - Prob. 4RQCh. 11 - Prob. 5RQCh. 11 - Prob. 6RQCh. 11 - Prob. 7RQCh. 11 - a) What is a binary search tree? b) Describe an...Ch. 11 - Prob. 9RQCh. 11 - Prob. 10RQCh. 11 - a) Explain how to use preorder, inorder, and...Ch. 11 - Show that the number of comparisons used by a...Ch. 11 - a) Describe the Huffman coding algorithm for...Ch. 11 - Draw the game tree for nim if the starting...Ch. 11 - Prob. 15RQCh. 11 - Prob. 16RQCh. 11 - a) Explain how backtracking can be used to...Ch. 11 - Prob. 18RQCh. 11 - Prob. 19RQCh. 11 - Show that a simple graph is a tree if and Only if...Ch. 11 - Prob. 2SECh. 11 - Prob. 3SECh. 11 - Prob. 4SECh. 11 - Prob. 5SECh. 11 - Prob. 6SECh. 11 - Prob. 7SECh. 11 - Prob. 8SECh. 11 - Prob. 9SECh. 11 - Prob. 10SECh. 11 - Prob. 11SECh. 11 - Prob. 12SECh. 11 - Prob. 13SECh. 11 - Prob. 14SECh. 11 - Prob. 15SECh. 11 - Prob. 16SECh. 11 - Prob. 17SECh. 11 - Prob. 18SECh. 11 - Prob. 19SECh. 11 - Prob. 20SECh. 11 - Prob. 21SECh. 11 - Prob. 22SECh. 11 - Prob. 23SECh. 11 - The listing of the vertices of an ordered rooted...Ch. 11 - The listing of the vertices of an ordered rooted...Ch. 11 - Prob. 26SECh. 11 - Prob. 27SECh. 11 - Prob. 28SECh. 11 - Prob. 29SECh. 11 - Show that if every circuit not passing through any...Ch. 11 - Prob. 31SECh. 11 - Prob. 32SECh. 11 - Prob. 33SECh. 11 - Prob. 34SECh. 11 - Prob. 35SECh. 11 - Prob. 36SECh. 11 - Prob. 37SECh. 11 - Prob. 38SECh. 11 - Prob. 39SECh. 11 - Prob. 40SECh. 11 - Prob. 41SECh. 11 - Prob. 42SECh. 11 - Prob. 43SECh. 11 - Prob. 44SECh. 11 - Prob. 45SECh. 11 - Show that a directed graphG= (V,E) has an...Ch. 11 - In this exercise we will develop an algorithm to...Ch. 11 - Prob. 1CPCh. 11 - Prob. 2CPCh. 11 - Prob. 3CPCh. 11 - Prob. 4CPCh. 11 - Prob. 5CPCh. 11 - Prob. 6CPCh. 11 - Prob. 7CPCh. 11 - Given an arithmetic expression in prefix form,...Ch. 11 - Prob. 9CPCh. 11 - Given the frequency of symbols, use Huffman coding...Ch. 11 - Given an initial position in the game of nim,...Ch. 11 - Prob. 12CPCh. 11 - Prob. 13CPCh. 11 - Prob. 14CPCh. 11 - Prob. 15CPCh. 11 - Prob. 16CPCh. 11 - Prob. 17CPCh. 11 - Prob. 18CPCh. 11 - Prob. 1CAECh. 11 - Prob. 2CAECh. 11 - Prob. 3CAECh. 11 - Prob. 4CAECh. 11 - Prob. 5CAECh. 11 - Prob. 6CAECh. 11 - Prob. 7CAECh. 11 - Prob. 8CAECh. 11 - Prob. 1WPCh. 11 - Prob. 2WPCh. 11 - Prob. 3WPCh. 11 - DefineAVL-trees(sometimes also known...Ch. 11 - Prob. 5WPCh. 11 - Prob. 6WPCh. 11 - Prob. 7WPCh. 11 - Prob. 8WPCh. 11 - Prob. 9WPCh. 11 - Prob. 10WPCh. 11 - Discuss the algorithms used in IP multicasting to...Ch. 11 - Prob. 12WPCh. 11 - Describe an algorithm based on depth-first search...Ch. 11 - Prob. 14WPCh. 11 - Prob. 15WPCh. 11 - Prob. 16WPCh. 11 - Prob. 17WPCh. 11 - Prob. 18WP
Knowledge Booster
Similar questions
- Find the median, first quartile (Q1) and the third quartile (Q3) for the data shown, which is already sorted. The number of data is n= 11. Katye Kozak's algorithm: Sort the data and compute the median. When n is an odd number, the median is the center value. When n is an even number, the median is the center value. After computing the median, Q1 is the median of the 1st half of the data, not including the median value. Q3 is the median of the 2nd half of the data, not including the median value. Do not round your answers. x 1.2 2.6 7.7 9.5 14 16.3 17.6 19.9 22.2 25.2 26.3 Median= Q1 = Q3 =arrow_forwardFind the median, first quartile (Q1) and the third quartile (Q3) for the data shown, which is already sorted. The number of data is n= 11. Katye Kozak's algorithm: Sort the data and compute the median. When n is an odd number, the median is the center value. When n is an even number, the median is the center value. After computing the median, Q1 is the median of the 1st half of the data, not including the median value. Q3 is the median of the 2nd half of the data, not including the median value. Do not round your answers. 6.3 6.8 8.3 8.9 11.5 13.1 15.9 21.8 21.9 26.2 28.8 Median = Q1 = Q3 =arrow_forwardrch A computer manufacturer is interested in comparing assembly times for two keyboard assembly processes. Assembly times can vary considerably from worker to worker, and the company decides to eliminate this effect by selecting 12 workers at random and timing each worker on each assembly process. Half of the workers are chosen at random to use Process 1 first, and the rest use Process 2 first. For each worker and each process, the assembly time (in minutes) is recorded, as shown in the table below. Worker Process 1 Process 2 Difference (Process 1 - Process 2) Send data to calculator 1 81 67 Explanation Type of test statistic: O 14 Check 2 80 78 2 3 84 65 19 89 72 17 5 81 78 (a) State the null hypothesis Ho and the alternative hypothesis H₁. Ho H₁ :0 (b) Determine the type of test statistic to use. 3 6 35 53 7 50 30 -18 20 8 32 34 LG -2 9 45 48 (Choose one) (c) Find the value of the test statistic. (Round to three or more decimal places.) 0 (d) Find the two critical values at the 0.05…arrow_forward
- A source emits four colours {Red, Blue, Green, Yellow} with probabilities as 0.1, 0.2, 0.3, 0.4, respectively. Calculate the Entropy of the source. Find the Huffman code with minimum variance (i.e., average length) Draw the Greedy Algorithm showing fundamentals of creating a hierarchical node structure (Check details in Lecture saved as PowerPoint Slide show)arrow_forwardPlease answer only the highlighted question.arrow_forwardMany cement companies have research and development teams that continuously formulate and experiment different composition of chemicals to fully optimize the cement that they produce. Suppose a research team formulates 5 different mixtures every month. Two mixtures are selected at random from each batch for testing. The possible outcomes of the selection process are represented by pairs. For example, the pair (1, 2) represents the selection of mixtures 1 and 2 for testing. a. List all the different possible outcomes of the selection process. b. Suppose that mixtures 4 and 5 do not meet the requirements of the test. Two mixtures are to be chosen at random. Define ? to be the number of mixtures that does not meet the requirements among those tested. Find the probability distribution of ?. c. Find the cumulative distribution function of ?. Please answer this step by step and justify your answer.arrow_forward
- A private lake sells boating memberships and currently has 600 members. During the application process the potential members are asked which recreational activity they do the most. Their choices are fishing, skiing, boarding, swimming, or tubing. The lake manager chooses clients according to their interests to maximize the use of all areas of the lake. Every month, the lake rangers randomly sample the boats on the lake and categorize them according to the activity they are doing. The lake manager performs a chi-square goodness-of-fit test using the following null hypothesis to see whether their samples differ significantly from what the original applications claim. Ho Pfish =0.26, p,ki = 0.21, proard 0.21, Phoard 0.30, Psuim 0.12, Prube 0.11 In order to meet the conditions for independence and large counts for a chi-square goodness-of-fit test, which of the following represents all possible sizes of the monthly samples? A n> 30 B. 30 n< 50 46arrow_forwardA private lake sells boating memberships and currently has 600 members. During the application process the potential members are asked which recreational activity they do the most. Their choices are fishing, skiing, boarding, swimming, or tubing. The lake manager chooses clients according to their interests to maximize the use of all areas of the lake. Every month, the lake rangers randomly sample the boats on the lake and categorize them according to the activity they are doing. The lake manager performs a chi-square goodness-of-fit test using the following null hypothesis to see whether their samples differ significantly from what the original applications claim. H0:pfish=0.26,pski=0.21,pboard=0.30,pswim=0.12,ptube=0.11 In order to meet the conditions for independence and large counts for a chi-square goodness-of-fit test, which of the following represents all possible sizes of the monthly samples? n≥30 lowercase n is greater than or equal to 30 A 30≤n≤50 30 is less than…arrow_forwardPeople are classified as hypertensive if their systolic blood pressure (SBP) is higher than a specified level for their age group, according to the algorithm in the table below. Assume SBP is normally distributed with mean, and standard given in the table for age groups 1 – 14 and 15 – 44, respectively. Define a family as a group of two people in age group 1 – 14 and two people in age group 15 – 44. A family is classified as hypertensive if at least one adult and at least one child are hypertensive. i. What proportion of 1 – 14-year-olds are hypertensive? ii. What proportion of 15 – 44-year-olds are hypertensive?arrow_forwardDon't copy from any source.arrow_forwardIn a regression problem with 2 input variables, we construct a classification tree with 4 terminal nodes. This means（multiple choices) There was either four splits in only one of the input variables or one split in each of the input variable. There was a split in one of the input variables and no splits in the other. There was a split in each input variable. There was either a split in each input variable or three splits in only one of the input variables. There were 2 splits in each of the input variables.arrow_forwardA computer manufacturer is interested in comparing assembly times for two keyboard assembly processes. Assembly times can vary considerably from worker to worker, and the company decides to eliminate this effect by selecting 12 workers at random and timing each worker on each assembly process. Half of the workers are chosen at random to use Process 1 first, and the rest use Process 2 first. For each worker and each process, the assembly time (in minutes) is recorded, as shown in the table below. Worker Process 1 Process 2 Difference (Process 1 - Process 2) Send data to calculator 1 43 35 00 8 2 83 74 78 3 5 66 8 4 51 30 in 5 60 47 21 13 6 75 7 48 76 61 8 81 9 10 11 1 12 88 44 49 54 H₁ : 0 (b) Determine the type of test statistic to use. Type of test statistic: (Choose one) (c) Find the value of the test statistic. (Round to three or more decimal places.) 0 61 93 41 -1 -13 20 -5 3 Based on these data, can the company conclude, at the 0.05 level of significance, that the mean assembly…arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,