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
Question
Chapter 11.1, Problem 35E
To determine
(a)
What does the parent of a vertex represent in a computer file system?
To determine
(b)
What does a child of a vertex represent in a computer file system?
To determine
(c)
What does a sibling of a vertex represent in a computer file system?
To determine
(d)
What does the ancestors of a vertex represent in a computer file system?
To determine
(e)
What does the descendants of a vertex represent in a computer file system?
To determine
(f)
What does the level of a vertex represent in a computer file system?
To determine
(g)
What does the height of the tree represent in a computer file system?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Given the sample space:
ΩΞ
= {a,b,c,d,e,f}
and events:
{a,b,e,f}
A = {a, b, c, d}, B = {c, d, e, f}, and C = {a, b, e, f}
For parts a-c: determine the outcomes in each of the provided sets. Use proper set
notation.
a.
(ACB)
C
(AN (BUC) C) U (AN (BUC))
AC UBC UCC
b.
C.
d.
If the outcomes in 2 are equally likely, calculate P(AN BNC).
H-/ test the Series
1.12
7√2
by ratio best
2n
2-12-
nz
by vitio test
en
In Exercises 1-14, state whether each statement is true or
false. If false, give a reason.
1. The set of stores located in the state of Wyoming is a well-
defined set.
2. The set of the three best songs is a well-defined set.
3. maple = {oak, elm, maple, sycamore}
4{} cơ
5. {3, 6, 9, 12,...} and {2, 4, 6, 8, ...} are disjoint sets.
6. {Mercury, Venus, Earth, Mars} is an example of a set in
roster form.
7. {candle, picture, lamp} = {picture, chair, lamp }
8. {apple, orange, banana, pear} is equivalent to
{tomato, corn, spinach, radish}.
Chapter 11 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
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
- Consider a single-server queueing system that can hold a maximum of two customers excluding those being served. The server serves customers only in batches of two, and the service time (for a batch) has an exponential distribution with a mean of 1 unit of time. Thus if the server is idle and there is only one customer in the system, then the server must wait for another arrival before beginning service. The customers arrive according to a Poisson process at a mean rate of 1 per unit of time. (1). Draw the rate diagram. (Hint: think about how the state will change after one service completion.) (2). Set up the rate balance equations. (Hint: use the rate balance equations 1.) (3). Compute pn and L. (4). Compute the actual mean arrival rate Ā.arrow_forwardSuppose a sample of O-rings was obtained and the wall thickness (in inches) of each was recorded. Use a normal probability plot to assess whether the sample data could have come from a population that is normally distributed. Click here to view the table of critical values for normal probability plots. Click here to view page 1 of the standard normal distribution table. Click here to view page 2 of the standard normal distribution table. 0.191 0.186 0.201 0.2005 0.203 0.210 0.234 0.248 0.260 0.273 0.281 0.290 0.305 0.310 0.308 0.311 Using the correlation coefficient of the normal probability plot, is it reasonable to conclude that the population is normally distributed? Select the correct choice below and fill in the answer boxes within your choice. (Round to three decimal places as needed.) ○ A. Yes. The correlation between the expected z-scores and the observed data, , exceeds the critical value, . Therefore, it is reasonable to conclude that the data come from a normal population. ○…arrow_forwardHale / test the Series 1.12 7√2 2n by ratio best 2-12- nz by vico tio test en - プ n2 rook 31() by mood fest 4- E (^)" by root test Inn 5-E 3' b. E n n³ 2n by ratio test ٤ by Comera beon Test (n+2)!arrow_forward
- ding question ypothesis at a=0.01 and at a = 37. Consider the following hypotheses: 20 Ho: μ=12 HA: μ12 Find the p-value for this hypothesis test based on the following sample information. a. x=11; s= 3.2; n = 36 b. x = 13; s=3.2; n = 36 C. c. d. x = 11; s= 2.8; n=36 x = 11; s= 2.8; n = 49arrow_forward13. A pharmaceutical company has developed a new drug for depression. There is a concern, however, that the drug also raises the blood pressure of its users. A researcher wants to conduct a test to validate this claim. Would the manager of the pharmaceutical company be more concerned about a Type I error or a Type II error? Explain.arrow_forwardFind the z score that corresponds to the given area 30% below z.arrow_forward
- Find the following probability P(z<-.24)arrow_forwardExercises Evaluate the following limits. 1. lim cot x/ln x +01x 2. lim x² In x +014 3. lim x* x0+ 4. lim (cos√√x)1/x +014 5. lim x2/(1-cos x) x10 6. lim e*/* 818 7. lim (secx - tan x) x-x/2- 8. lim [1+(3/x)]* x→∞0arrow_forwardIn Exercises 1 through 3, let xo = O and calculate P7(x) and R7(x). 1. f(x)=sin x, x in R. 2. f(x) = cos x, x in R. 3. f(x) = In(1+x), x≥0. 4. In Exercises 1, 2, and 3, for |x| 1, calculate a value of n such that P(x) approximates f(x) to within 10-6. 5. Let (an)neN be a sequence of positive real numbers such that L = lim (an+1/an) exists in R. If L < 1, show that an → 0. [Hint: Let 1111 Larrow_forwardiation 7. Let f be continuous on [a, b] and differentiable on (a, b). If lim f'(x) xia exists in R, show that f is differentiable at a and f'(a) = lim f'(x). A similar result holds for b. x-a 8. In reference to Corollary 5.4, give an example of a uniformly continuous function on [0, 1] that is differentiable on (0, 1] but whose derivative is not bounded there. 9. Recall that a fixed point of a function f is a point c such that f(c) = c. (a) Show that if f is differentiable on R and f'(x)| x if x 1 and hence In(1+x) 0. 12. For 0 л/2. (Thus, as x л/2 from the left, cos x is never large enough for x+cosx to be greater than л/2 and cot x is never small enough for x + cot x to be less than x/2.)arrow_forwardConstruct a histogram for the spot weld shear strength datain Exercise 6.2.9. Comment on the shape of the histogram. Doesit convey the same information as the stem-and-leaf display? Reference: Exercise 6.2.9 is found in the image attached belowarrow_forward1. Show that f(x) = x3 is not uniformly continuous on R. 2. Show that f(x) = 1/(x-2) is not uniformly continuous on (2,00). 3. Show that f(x)=sin(1/x) is not uniformly continuous on (0,л/2]. 4. Show that f(x) = mx + b is uniformly continuous on R. 5. Show that f(x) = 1/x2 is uniformly continuous on [1, 00), but not on (0, 1]. 6. Show that if f is uniformly continuous on [a, b] and uniformly continuous on D (where D is either [b, c] or [b, 00)), then f is uniformly continuous on [a, b]U D. 7. Show that f(x)=√x is uniformly continuous on [1, 00). Use Exercise 6 to conclude that f is uniformly continuous on [0, ∞). 8. Show that if D is bounded and f is uniformly continuous on D, then fis bounded on D. 9. Let f and g be uniformly continuous on D. Show that f+g is uniformly continuous on D. Show, by example, that fg need not be uniformly con- tinuous on D. 10. Complete the proof of Theorem 4.7. 11. Give an example of a continuous function on Q that cannot be continuously extended to R. 12.…arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSON
Discrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education