DISCRETE MATHEMATICS-CONNECT ACCESS ONLY
8th Edition
ISBN: 9781264309696
Author: ROSEN
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Question
Chapter 11, Problem 3CP
To determine
Find the parent, children, ancestor, descendants and level of vertex
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Q4
3 Points
1
Let A =
2
3 7
5 11
Give one nontrivial solution X of the homogeneous system Ax = 0. (Your
vector x should have explicit numbers as its entries, as opposed to variables/parameters). Show
your work for how you found it.
Please select file(s) Select file(s)
Save Answer
To compare two elementary schools regarding teaching of reading skills, 12 sets of identical twins were used. In each case, one child was selected at random and sent to school A, and his or her twin was sent to school B. Near the end of fifth grade, an achievement test was given to each child. The results follow:
Twin Pair
1
2
3
4
5
6
School A
169
157
115
99
119
113
School B
123
157
112
99
121
122
Twin Pair
7
8
9
10
11
12
School A
120
121
124
145
138
117
School B
153
90
124
140
142
102
Suppose a sign test for matched pairs with a 1% level of significance is used to test the hypothesis that the schools have the same effectiveness in teaching reading skills against the alternate hypothesis that the schools have different levels of effectiveness in teaching reading skills. Let p denote portion of positive signs when the scores of school B are subtracted from the corresponding scores of school…
A horse trainer teaches horses to jump by using two methods of instruction. Horses being taught by method A have a lead horse that accompanies each jump. Horses being taught by method B have no lead horse. The table shows the number of training sessions required before each horse performed the jumps properly.
Method A
25
23
39
29
37
20
Method B
41
21
46
42
24
44
Method A
45
35
27
31
34
49
Method B
26
43
47
32
40
Use a rank-sum test with a5% level of significance to test the claim that there is no difference between the training sessions distributions. If the value of the sample test statistic R, the rank-sum, is 150, calculate the P-value. Round your answer to four decimal places.
Chapter 11 Solutions
DISCRETE MATHEMATICS-CONNECT ACCESS ONLY
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
- A data processing company has a training program for new salespeople. After completing the training program, each trainee is ranked by his or her instructor. After a year of sales, the same class of trainees is again ranked by a company supervisor according to net value of the contracts they have acquired for the company. The results for a random sample of 11 salespeople trained in the last year follow, where x is rank in training class and y is rank in sales after 1 year. Lower ranks mean higher standing in class and higher net sales. Person 1 2 3 4 5 6 x rank 8 11 2 4 5 3 y rank 7 10 1 3 2 4 Person 7 8 9 10 11 x rank 7 9 10 1 6 y rank 8 11 9 6 5 Using a 1% level of significance, test the claim that the relation between x and y is monotone (either increasing or decreasing). Verify that the Spearman rank correlation coefficient . This implies that the P-value lies between 0.002 and 0.01. State…arrow_forwardSand and clay studies were conducted at a site in California. Twelve consecutive depths, each about 15 cm deep, were studied and the following percentages of sand in the soil were recorded. 34.4 27.1 30.8 28.0 32.2 27.6 32.8 25.2 31.4 33.5 24.7 28.4 Converting this sequence of numbers to a sequence of symbols A and B, where A indicates a value above the median and B denotes a value below the median gives ABABABABAABB. Test the sequence for randomness about the median with a 5% level of significance. Verify that the number of runs is 10. What is the upper critical value c2? arrow_forwardSand and clay studies were conducted at a site in California. Twelve consecutive depths, each about 15 cm deep, were studied and the following percentages of sand in the soil were recorded. 34.4 27.1 30.8 28.0 32.2 27.6 32.8 25.2 31.4 33.5 24.7 28.4 Converting this sequence of numbers to a sequence of symbols A and B, where A indicates a value above the median and B denotes a value below the median gives ABABABABAABB. Test the sequence for randomness about the median with a 5% level of significance. Verify that the number of runs is 10. What is the upper critical value c2?arrow_forward
- 29% of all college students major in STEM (Science, Technology, Engineering, and Math). If 46 college students are randomly selected, find the probability thata. Exactly 11 of them major in STEM. b. At most 12 of them major in STEM. c. At least 11 of them major in STEM. d. Between 11 and 15 (including 11 and 15) of them major in STEM.arrow_forwardSand and clay studies were conducted at a site in California. Twelve consecutive depths, each about 15 cm deep, were studied and the following percentages of sand in the soil were recorded. 27.3 34.6 30.6 27.8 33.4 31.5 27.3 31.2 32.0 24.7 24.4 28.2 Test this sequence for randomness about the median. Converting this sequence of numbers to a sequence of symbols A and B, where A indicates a value above the median and B denotes a value below the median gives BAABAABAABBB. Verify that the number of runs is 7, the lower critical number is 3, and the upper critical number is 11. Use a 5% level of significance. State the conclusion of the test and interpret your results.arrow_forward29% of all college students major in STEM (Science, Technology, Engineering, and Math). If 46 college students are randomly selected, find the probability thata. Exactly 11 of them major in STEM. b. At most 12 of them major in STEM. c. At least 11 of them major in STEM. d. Between 11 and 15 (including 11 and 15) of them major in STEM.arrow_forward
- 4. Assume that a risk-free money market account is added to the market described in Q3. The continuously compounded rate of return on the money market account is log (1.1). (i) For each given μ, use Lagrange multipliers to determine the proportions (as a function of μ) of wealth invested in the three assets available for the minimum variance portfolio with expected return μ. (ii) Determine the market portfolio in this market and calculate its Sharp ratio.arrow_forward3. A market consists of two risky assets with rates of return R₁ and R2 and no risk-free asset. From market data the following have been estimated: ER₁ = 0.25, ER2 = 0.05, Var R₁ = 0.01, Var R2 = 0.04 and the correlation between R1 and R2 is p = -0.75. (i) Given that an investor is targeting a total expected return of μ = 0.2. What portfolio weights should they choose to meet this goal with minimum portfolio variance? Correct all your calculations up to 4 decimal points. (ii) Determine the global minimum-variance portfolio and the expected return and variance of return of this portfolio (4 d.p.). (iii) Sketch the minimum-variance frontier in the μ-σ² plane and indicate the efficient frontier. (iv) Without further calculation, explain how the minimum variance of the investor's portfolio return will change if the two risky assets were independent.arrow_forward2. A landlord is about to write a rental contract for a tenant which lasts T months. The landlord first decides the length T > 0 (need not be an integer) of the contract, the tenant then signs it and pays an initial handling fee of £100 before moving in. The landlord collects the total amount of rent erT at the end of the contract at a continuously compounded rate r> 0, but the contract stipulates that the tenant may leave before T, in which case the landlord only collects the total rent up until the tenant's departure time 7. Assume that 7 is exponentially distributed with rate > 0, λ‡r. (i) Calculate the expected total payment EW the landlord will receive in terms of T. (ii) Assume that the landlord has logarithmic utility U(w) = log(w - 100) and decides that the rental rate r should depend on the contract length T by r(T) = λ √T 1 For each given λ, what T (as a function of X) should the landlord choose so as to maximise their expected utility? Justify your answer. Hint. It might be…arrow_forward
- Please solving problem2 Problem1 We consider a two-period binomial model with the following properties: each period lastsone (1) year and the current stock price is S0 = 4. On each period, the stock price doubleswhen it moves up and is reduced by half when it moves down. The annual interest rateon the money market is 25%. (This model is the same as in Prob. 1 of HW#2).We consider four options on this market: A European call option with maturity T = 2 years and strike price K = 5; A European put option with maturity T = 2 years and strike price K = 5; An American call option with maturity T = 2 years and strike price K = 5; An American put option with maturity T = 2 years and strike price K = 5.(a) Find the price at time 0 of both European options.(b) Find the price at time 0 of both American options. Compare your results with (a)and comment.(c) For each of the American options, describe the optimal exercising strategy.arrow_forwardPlease ensure that all parts of the question are answered thoroughly and clearly. Include a diagram to help explain answers. Make sure the explanation is easy to follow. Would appreciate work done written on paper. Thank you.arrow_forwardThis question builds on an earlier problem. The randomized numbers may have changed, but have your work for the previous problem available to help with this one. A 4-centimeter rod is attached at one end to a point A rotating counterclockwise on a wheel of radius 2 cm. The other end B is free to move back and forth along a horizontal bar that goes through the center of the wheel. At time t=0 the rod is situated as in the diagram at the left below. The wheel rotates counterclockwise at 1.5 rev/sec. At some point, the rod will be tangent to the circle as shown in the third picture. A B A B at some instant, the piston will be tangent to the circle (a) Express the x and y coordinates of point A as functions of t: x= 2 cos(3πt) and y= 2 sin(3t) (b) Write a formula for the slope of the tangent line to the circle at the point A at time t seconds: -cot(3πt) sin(3лt) (c) Express the x-coordinate of the right end of the rod at point B as a function of t: 2 cos(3πt) +411- 4 -2 sin (3лt) (d)…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell