Free Essay

Submitted By achintmaxwell

Words 1159

Pages 5

Words 1159

Pages 5

Ch. 11 of Discrete and Combinatorial Mathematics *

Exercise 11.1, problems 8, 11 , text-pg:519

Exercise 11.2, problems 1, 6, text-pg:528

Exercise 11.3, problems 5, 20 , text-pg:537

Exercise 11.4, problems 14 , text-pg:553

Exercise 11.5, problems 7 , text-pg:563 *

Ch. 12 of Discrete and Combinatorial Mathematics *

Exercise 12.1, problems 11 , text-pg:585

Exercise 12.2, problems 6 , text-pg:604

Exercise 12.3, problems 2 , text-pg:609 Exercise 12.5, problems 3 , text-pg:621

Chapter 11

Exercise 11.1

Problem 8:

Figure 11.10 shows an undirected graph representing a section of a department store. The vertices indicate where cashiers are located; the edges denote unblocked aisles between cashiers.

The department store wants to set up a security system where

(plainclothes) guards are placed at certain cashier locations so that each cashier either has a guard at his or her location or is only one aisle away from a cashier who has a guard. What is the smallest number of guards needed?

Figure 11.10

Problem 11:

Let G be a graph that satisfies the condition in Exercise 10.

(a) Must G be loop-free? (b) Could G be a multigraph? (c) If

G has n vertices, can we determine how many edges it has?

Exercise 11.2

Problem 1:

Let G be the undirected graph in Fig. 11.27(a).

a) How many connected subgraphs ofGhave four vertices and include a cycle?

b) Describe the subgraph G1 (of G) in part (b) of the figure first, as an induced subgraph and second, in terms of deleting a vertex of G.

c) Describe the subgraphG2 (ofG) in part (c) of the figure first, as an induced subgraph and second, in terms of the deletion of vertices of G.

d) Draw the subgraph of G induced by the set of vertices

U _ {b, c, d, f, i, j}.

e) For the graph G, let the edge e _ {c, f }. Draw the subgraph

G − e.

Figure 11.27

Problem 6:

Find all (loop-free) nonisomorphic undirected graphs with four vertices. How many of these graphs are connected?

Exercise 11.3

Problem 5:

Figure 11.42

Let G1 _ (V1, E1) and G2 _ (V2, E2) be the loop-free undirected connected graphs in Fig. 11.42.

a) Determine |V1|, |E1|, |V2|, and |E2|. s t u v w x y z a b c d e f g h

G1 _ (V1, E1)

G2 _ (V2, E2)

b) Find the degree of each vertex in V1. Do likewise for each vertex in V2.

c) Are the graphs G1 and G2 isomorphic?

Problem 20:

a) Find an Euler circuit for the graph in Fig. 11.44.

b) If the edge {d, e} is removed from this graph, find an

Euler trail for the resulting subgraph.

Exercise 11.4

Problem 14:

Determine which of the graphs in Fig. 11.69 are planar. If a graph is planar, redraw it with no edges overlapping. If it is nonplanar, find a subgraph homeomorphic to either K5 or K3,3.

Exercise 11.5

Problem 7:

a) For n ≥ 3, how many different Hamilton cycles are there in the complete graph Kn?

b) How many edge-disjoint Hamilton cycles are there in

K21?

c) Nineteen students in a nursery school play a game each day where they hold hands to form a circle. For how many days can they do this with no student holding hands with the same playmate twice?

Chapter 12

Exercise 12.1

Problem 11:

The following statements are equivalent for a loop-free undirected graph G _ (V , E). a) G is a tree.

b) Gis connected, but the removal of any edge fromGdisconnectsGinto two subgraphs that are trees.

c) G contains no cycles, and |V | _ |E| + 1.

d) G is connected, and |V | _ |E| + 1.

e) G contains no cycles, and if a, b ∈ V with {a, b} / ∈ E, then the graph obtained by adding edge {a, b} to G has precisely one cycle.

Proof: We shall prove that (a) ⇒ (b), (b) ⇒ (c), and (c) ⇒ (d), leaving to the reader the proofs for (d)⇒(e) and (e)⇒(a).

[(a) ⇒ (b)]: If G is a tree, then G is connected. So let e _ {a, b} be any edge of G.

Then if G − e is connected, there are at least two paths in G from a to b. But this contradicts Theorem 12.1. Hence G − e is disconnected and so the vertices in G − e may be partitioned into two subsets: (1) vertex a and those vertices that can be reached from a by a path in G − e; and (2) vertex b and those vertices that can be reached from b by a path in G − e. These two connected components are trees because a loop or cycle in either component would also be in G.

[(b) ⇒ (c)]: If G contains a cycle, then let e _ {a, b} be an edge of the cycle. But then G − e is connected, contradicting the hypothesis in part (b). So G contains no cycles, and since G is a loop-free connected undirected graph, we know that G is a tree.

Consequently, it follows from Theorem 12.3 that |V | _ |E| + 1.

[(c) ⇒ (d)]: Let κ(G) _ r and let G1, G2, . . . , Gr be the components of G. For 1 ≤ i ≤ r, select a vertex vi ∈ Gi and add the r − 1 edges {v1, v2}, {v2, v3}, . . . , {vr−1, vr } to G to form the graph G

_ _ (V , E

_

), which is a tree. Since G

_ is a tree, we know that

|V | _ |E

_| + 1 because of Theorem 12.3. But from part (c), |V | _ |E| + 1, so |E| _ |E

_|

and r − 1 _ 0.With r _ 1, it follows that G is connected.

Let T _ (V , E) be a tree with |V | _ n ≥ 2. How many distinct paths are there (as subgraphs) in T ?

Exercise 12.2

Problem 6:

List the vertices in the tree shown in Fig. 12.31 when they are visited in a preorder traversal and in a postorder traversal.

Exercise 12.3

Problem 2:

Apply the merge sort to each of the following lists. Draw the splitting and merging trees for each application of the procedure.

a) −1, 0, 2, −2, 3, 6, −3, 5, 1, 4

b) −1, 7, 4, 11, 5, −8, 15, −3, −2, 6, 10, 3

Exercise 12.5

Problem: 3

Let T _ (V , E) be a tree with |V | _ n ≥ 3.

a) What are the smallest and the largest numbers of articulation points that T can have? Describe the trees for each of these cases.

b) How many biconnected components does T have in each of the cases in part (a)?…...

Free Essay

...Course Design Guide MTH/221 Version 1 1 Course Design Guide College of Information Systems & Technology MTH/221 Version 1 Discrete Math for Information Technology Copyright © 2010 by University of Phoenix. All rights reserved. Course Description Discrete (as opposed to continuous) mathematics is of direct importance to the fields of Computer Science and Information Technology. This branch of mathematics includes studying areas such as set theory, logic, relations, graph theory, and analysis of algorithms. This course is intended to provide students with an understanding of these areas and their use in the field of Information Technology. Policies Faculty and students/learners will be held responsible for understanding and adhering to all policies contained within the following two documents: University policies: You must be logged into the student website to view this document. Instructor policies: This document is posted in the Course Materials forum. University policies are subject to change. Be sure to read the policies at the beginning of each class. Policies may be slightly different depending on the modality in which you attend class. If you have recently changed modalities, read the policies governing your current class modality. Course Materials Grimaldi, R. P. (2004). Discrete and combinatorial mathematics: An applied introduction. (5th ed.). Boston, MA: Pearson Addison Wesley. Article References Albert, I. Thakar, J., Li, S., Zhang, R., & Albert, R...

Words: 1711 - Pages: 7

Premium Essay

...mean that students who have taken both calculus and a computer science course cannot take the class. Only those who have taken exactly one of the two courses can take the class. Similarly, when a menu at a restaurant states, “Soup or salad comes with an entree”, the restaurant almost always means that customers can have either soup or salad, but not both. Hence, this is an exclusive, rather than an inclusive, or. Sometimes, we use or in an exclusive sense. When the exclusive or is used to connect the propositions p and q, the proposition “p or q (but not both)” is obtained. Let p and q be propositions. The exclusive or of p and q, denoted by , is the proposition that is true when exactly one of p and q is true and is false otherwise. Table 4. The truth table for the exclusive or of two propositions | p | Q | | TTFF | TFTF | FTTF | Let p and q be propositions. The implication is the proposition that is false when p is true and q is false and true otherwise. In this implication p is called the hypothesis (or antecedent or premise) and q is called the conclusion (or consequence). Table 5. The truth table for the implication | p | Q | | TTFF | TFTF | TFTT | Because implications arise in many places in mathematical reasoning, a wide variety of terminology is used to express . Some of the more common ways of expressing this implication are: “if p, then q”, “p implies q”, “if p, q”, “p only if q”, “p is sufficient for q”, “q if p”, “q whenever p”, “q is necessary for......

Words: 1725 - Pages: 7

Premium Essay

...Exercise 4.1: 4. A wheel of fortune has the integers from 1 to 25 placed on it in a random manner. Show that regardless of how the numbers are positioned on the wheel, there are three adjacent numbers whose sum is at least 39. Work: Let suppose that there are not three adjacent numbers whose sum is at least 39 then for every set of 3 adjacent numbers their sum is less than 39 Since all the numbers are integers for every set of 3 adjacent numbers their sum is less than or equal to 38 Let select the 24 numbers around the “1”, from these 24 numbers we can create 8 sets of 3 consecutive adjacent numbers , then the total sum is less than or equal to 8(38)+1 = 305 So we have that the sum of 1+2+3+……+25 305 (but this is false) because 1+2+….25 = 25(26)/2 = 325 > 305 Then we proved that regardless of how the numbers are positioned on the wheel, there are three adjacent numbers whose sum is at least 39. 7. A lumberjack has 4n + 110 logs in a pile consisting of n layers. Each layer has two more logs than the layer directly above it. If the top layer has six logs, how many layers are there? Work: The 1st layer (the top one) has 6 logs The 2nd layer has 6+1(2) logs The 3rd layer has 6+2(2) The 4th layer has 6+3(2) ……………. The nth layer 6 +(n-1)(2) Total number of layers is: 6n +2(1+2+3+….+n-1) = 6n + 2(n-1)n/2 = 6n+n(n-1) =......

Words: 545 - Pages: 3

Free Essay

...1.1/1.2 1a During a local campaign, eight Republican and five Democratic candidates are nominated for president of the school board. a. If the president is to be one of these candidates, how many possibilities are there for the eventual winner? 8 + 5 = 13 1.4 1a In how many ways can 10 (identical) dimes be distributed among five children if (a) there are no restrictions? The number of combinations of n objects taken r at a time is: C ( n + r – 1 , r ) x1 + x2 + x3 + ... + xn = r x1 + x2 + x3 + x4 + x5 = 10 Translates to: number of dimes given to person 1 + number of dimes given to person 2 + number of dimes given to person 3 + number of dimes given to person 4 + number of dimes given to person 5 10 total dimes n = 5 r = 10 C ( 5 + 10 – 1 , 10 ) C ( 14 , 10 ) 1,001 2.1 2 Identify the primitive statements in problem 1: a. In 2003 George W. Bush was the president of the United States. b. x+3 is a positive integer. c. Fifteen is an even number. d. If Jennifer is late for the party, then her cousin Zachary will be quite angry. e. What time is it? f. As of June 30, 2003, Christine Marie Evert had won the French open a record seven times. 2.2 2 Verify the Absorption Law by means of a truth table. p ∨ (p ∧ q)<->p p or (p and q) p | q | p q | p (p q) | p ∨ (p ∧ q)<->p | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 2.3 2b Use truth......

Words: 944 - Pages: 4

Premium Essay

...Phase One Individual Project: BeT Proposal Natalie Braggs IT106-1401A-03: Introduction to Programming Logic Colorado Technical University 01/12/2014 Table of Contents Introduction 3 Problem Solving Techniques (Week 1) 4 Data Dictionary 5 Equations 6 Expressions 7 8 Sequential Logic Structures (Week 2) 9 PAC (Problem Analysis Chart)-Transfers 10 IPO (Input, Processing, Output)-Viewing Balances 11 Structure Chart (Hierarchical Chart)-Remote Deposit 12 12 Problem Solving with Decisions (Week 3) 14 Problem Solving with Loops (Week 4) 15 Case Logic Structure (Week 5) 16 Introduction This Design Proposal (BET-Banking e-Teller) is going to show a banking application that allows customers to perform many of the needed transactions from the mobile phones. The Banking e-Teller will allow customers to check balances, make remote capture deposits, and perform transfers to their checking and/or savings accounts. Problem Solving Techniques (Week 1) Data Dictionary ------------------------------------------------- Problem Solving Techniques A data dictionary allows you see what data (items) you are going to use in your program, and lets you see what type of data type you will be using. Providing these important details allows the programmers to collectively get together and brainstorm on what is needed and not needed. Data Item | Data Item Name | Data Type | First name of account owner | firstName | String | Last name of account......

Words: 609 - Pages: 3

Free Essay

...scenarios to form 6 compositions. Based on your findings, make a proposal that is best for your company. A car insurance company is planning to buy a television to put inside their waiting room to occupy their clients. They go to an electronic store and find they are running a sale on plasma TV’s. They have a 42” on sale for $450.00 and a 42” bundle package for $550.00. The bundle package includes a 1 year warranty and a wall mount which is normally a $150 value. The electronic store is also running special promotional offers. Additional 20% off the purchase when opening a charge account f(x) = .80x 10% coupon from the weekend ad g(x) = .90x One day special of $50 off a purchase of $200 or more h(x) = x – 50 Based on the above information, which TV and combination of special offers would be the best deal? Special offer | 42’’ | 42’’ bundle package | Charge account f(x) = .80x | .80 ( 450) f(x) = 360 | .80 ( 550) f(x) = 440 | Coupon ad g(x) = .90x | .90 ( 450)g(x) = 405 | .90 ( 550)g(x) = 495 | One day special h(x) = x – 50 | 450 – 50 h(x) = 400 | 550 – 50 h(x) = 500 | Special offers | 42’’ | 42’’ bundle package | Charge account + Coupon adg(f(x)) | g(360).90 X 360324 | g(440).90 x 440 396 | Charge account + one dayh(f(x)) | h(360)360 – 50310 | h(440)440 – 50 390 | Coupon Ad + charge accountf(g(x)) | f(405).80 x 405 324 | f(495).80 x 495396 | Coupon ad + One day specialh(g(x)) | h(405)405-50355 | h(495)495 – 50445 | One day Special +......

Words: 653 - Pages: 3

Premium Essay

...Visual basic are some of today’s popular and advance languages. Many of today's modern languages have been a result of one of these three languages, but are greatly improved. (“4.”) Both turbo Pascal and basic are languages that are easy to understand and the syntax is very easy and straightforward. In Basic when printing to the screen you simply type the word 'print', in turbo Pascal you would type 'writeln'. These are very simple commands that the computer executes. To execute a line of code in a language such as C, or C++, you would have to type in much more sophisticated lines of code that are much more confusing than the previous two. The format and layout of the various languages are very diverse between some, and between others are somewhat similar. Turbo Pascal does not allow the user to input numbers; it has preset commands that separate each part of the program. FORTRAN, or FORmula TRANslation, was a milestone in computing history. It was developed in 1957 by a team from IBM. At the time, computers had very small memories, were slow, and had very primitive operating systems. The only practical way to program was in assembly language, which is as close to programming in binary code as you can get. It was the first high level language to be a success. It allowed programs that previously took weeks to write to be written in hours. Most of the commands used in FORTRAN are words that represent their function like "PRINT *," "READ *," "IF," "THEN," and "END." On the......

Words: 1364 - Pages: 6

Free Essay

...com to find out this information). Show the relation in the following forms: * Set of ordered pairs (Jets, Namath) (Giants, Manning) (Cowboys, Aikman) (49ers, Montana) (Chiefs, Montana) (Patriots, Brady) 2. The relation is a function, no one element of the domain matches no more than one element of the range. * Directional graph Jets Namath Giants Manning Cowboys Aiken 49er’s Montana Chiefs Montana Patriot’s Brady 3. Now, use set Q as the domain, and set D as the range. Show the relation in the following forms: * Set of ordered pairs (Namath, Jets), (Manning, Giants), (Aiken, Cowboys), (Montana, 49er’s), (Montana, Chiefs), (Brady, Patriots) 4. The relation is not a function, one element of the domain matches with two elements of the range. ( Montana, Chief’s & 49er’s) * Directional graph Namath Jet’s Manning Giant’s Aiken Cowboy’s Montana 49er’s Montana Chief’s Brady Patriot’s Part 2 Mathematical sequences can be used to model real life applications. Suppose you want to construct a movie theater in your town. The number of seats in each row can be modeled by the formula C (n) = 16 + 4(n), when n refers to the nth row, and you need 50 rows of seats. (a) Write the sequence for the number of seats for the first 5 rows: C (n) = 16 +4(n), so for the first row the value of “n” is set to 1. By substituting “1” for “n’” in the function: c (1) =16 + 4(1), c (1) = 16+4, c (1) = 20. I now......

Words: 475 - Pages: 2

Premium Essay

...Relations, Functions, Sequences, and Graphs Part I: Suppose you are developing a statistical database in which information about professional football teams and records are stored. Consider the following 2 sets of data that list football teams and quarterbacks: D = {Jets, Giants, Cowboys, 49ers, Patriots, Rams, Chiefs} Q = {Tom Brady, Joe Namath, Troy Aikman, Joe Montana, Eli Manning} 1. Using D as the domain and Q as the range, show the relation between the 2 sets, with the correspondences based on which players are (or were) a member of which team(s). (You can use http://www.pro-football-reference.com to find out this information). Show the relation in the following forms: Set of ordered pairs {(Jets, Joe Namath), (Giants, Eli Manning), (Cowboys, Troy Aikman), (49ers, Joe Montana), (Patriots, Tom Brady), (Rams, Joe Namath), (Chiefs, Joe Montana)} Jets Jets Directional graph Tom Brady Tom Brady Giants Giants Joe Namath Joe Namath Cowboys Cowboys Troy Aikman Troy Aikman 49ers 49ers Joe Montana Joe Montana Patriots Patriots Rams Rams Eli Manning Eli Manning Chiefs Chiefs 2. Is the relation a function? Explain. Yes, this relation is a function since for every element on the domain side there is one and only one element on the range side. 3. Now, use set Q as the domain, and set D as the range. Show the relation in the following forms: Set of ordered pairs {(Joe Namath, Jets), (Eli Manning, Giants), (Troy Aikman,......

Words: 678 - Pages: 3

Premium Essay

...to logical proofs. Just as positive whole numbers are the fundamental units for arithmetic, propsitions are the fundamental units of logic. Proposition: A statement that is either true or false. E.g. Today is Monday Today is Tuesday The square root of 4 is 2 The square root of 4 is 1 2 is even, and the square of two is even, and 3 is odd and the square of 3 is odd. The Panthers can clinch a playoff berth with a win, plus a loss by the Rams, a loss or tie by the Saints and Bears, a win by the Seahawks and a tie between the Redskins and Cowboys. (Copied verbatim from the sports page 12/26/2004.) Propositions may be true or false and no preference is given one way or the other. This is sometimes difficult to grasp as we have a “natural” preference for true statements. But “snow is chartreuse” and “snow is white” are both propositions of equal standing though one is true and the other false. Non-propositions: What is today? Is today Monday? Questions are not propositions. You can’t judge whether the question itself is true or false, even though the answer to the question may be true or false. Show me some ID! Similarly, imperative statements lack a truth value. 2x=4 x=y Statements with undetermined variables do not have truth value xy=yx looks like a true proposition but is it multiplication or concatenation? If you don’t know, it’s not a proposition. This sentence is false (paradoxes are not......

Words: 2247 - Pages: 9

Premium Essay

...Math 221 Quiz Review for Weeks 5 and 6 1. Find the area under the standard normal curve between z = 1.6 and z = 2.6. 2. A business wants to estimate the true mean annual income of its customers. It randomly samples 220 of its customers. The mean annual income was $61,400 with a standard deviation of $2,200. Find a 95% confidence interval for the true mean annual income of the business’ customers. 3. IQ test scores are normally distributed with a mean of 100 and a standard deviation of 15. An individual's IQ score is found to be 120. Find the z-score corresponding to this value. 4. Two high school students took equivalent language tests, one in German and one in French. The student taking the German test, for which the mean was 66 and the standard deviation was 8, scored an 82, while the student taking the French test, for which the mean was 27 and the standard deviation was 5, scored a 35. Compare the scores. 5. A business wants to estimate the true mean annual income of its customers. The business needs to be within $250 of the true mean. The business estimates the true population standard deviation is around $2,400. If the confidence level is 90%, find the required sample size in order to meet the desired accuracy. 6. The distribution of cholesterol levels in teenage boys is approximately normal with mean = 170 and standard deviation = 30 (Source: U.S. National Center for Health Statistics). Levels above 200 warrant attention. Find the probability......

Words: 2011 - Pages: 9

Free Essay

...MTH 221 Week 1 Individual and Team Assignment Selected Textbook Exercises (UOP Course) For more course tutorials visit www.tutorialrank.com Tutorial Purchased: 3 Times, Rating: A+ Mathematics - Discrete Mathematics Complete 12 questions below by choosing at least four from each section. • Ch. 1 of Discrete and Combinatorial Mathematics o Supplementary Exercises 1, 2, 7, 8, 9, 10, 15(a), 18, 24, & 25(a & b) • Ch. 2 of Discrete and Combinatorial Mathematics o Exercise 2.1, problems 2, 3, 10, & 13, o Exercise 2.2, problems 3, 4, & 17 o Exercise 2.3, problems 1 & 4 o Exercise 2.4, problems 1, 2, & 6 o Exercise 2.5, problems 1, 2, & 4 • Ch. 3 of Discrete and Combinatorial Mathematics o Exercise 3.1, problems 1, 2, 18, & 21 o Exercise 3.2, problems 3 & 8 ----------------------------------------------- MTH 221 Week 1 Individual Assignment Selected Textbook Exercises (UOP Course) For more course tutorials visit www.tutorialrank.com Tutorial Purchased:2 Times, Rating: No rating Complete the six questions listed below: • Ch. 1 of Discrete and Combinatorial Mathematics o Supplementary Exercise 2 • Ch. 2 of Discrete and Combinatorial Mathematics o Exercise 2.1, problem 10; p 54 o Exercise 2.2, problem 4; p 66 o Exercise 2.3, problem 4; p 84 • Ch. 3 of Discrete and Combinatorial Mathematics o Exercise 3.1, problem 18; p......

Words: 677 - Pages: 3

Free Essay

...MATH 221 Homework Week 1 -Latest IF You Want To Purcahse A+ Work then Click The Link Below For Instant Down Load http://www.acehomework.net/wp-admin/post.php?post=3308&action=edit IF You Face Any Problem Then E Mail Us At JOHNMATE1122@GMAIL.COM MATH 221 Homework Week 1 1. Determine whether the data set is a population or a sample. Explain your reasoning. The age of each resident in an apartment building. Choose the correct answer below. 1. Population, because it is a collection of ages for all people in the apartment building. 2. Sample, because it is a collection of ages for all people in the apartment building, but there are other apartment buildings 3. Population, because it is a subset of all apartment buildings in the city. 4. Sample, because it is a collection of ages for some people in the apartment building. 1. Determine whether the data set is a population or a sample. Explain your reasoning. The salary of each baseball player in a league Choose the correct answer below 1. Sample, because it is a collection of salaries for some baseball players in the league 2. Sample, because it is a collection of salaries for all baseball players in the league, but there are other sports 3. Population, because it is a collection of salaries for all baseball players in the league 4. Population, because it is a subset of all athletes 2. Determine whether the underlined value is a parameter or a statistic. The average age of men who have walked on the......

Words: 3015 - Pages: 13

Free Essay

...MATH 221 Homework Week 1 -Latest IF You Want To Purcahse A+ Work then Click The Link Below For Instant Down Load http://www.acehomework.net/wp-admin/post.php?post=3308&action=edit IF You Face Any Problem Then E Mail Us At JOHNMATE1122@GMAIL.COM MATH 221 Homework Week 1 1. Determine whether the data set is a population or a sample. Explain your reasoning. The age of each resident in an apartment building. Choose the correct answer below. 1. Population, because it is a collection of ages for all people in the apartment building. 2. Sample, because it is a collection of ages for all people in the apartment building, but there are other apartment buildings 3. Population, because it is a subset of all apartment buildings in the city. 4. Sample, because it is a collection of ages for some people in the apartment building. 1. Determine whether the data set is a population or a sample. Explain your reasoning. The salary of each baseball player in a league Choose the correct answer below 1. Sample, because it is a collection of salaries for some baseball players in the league 2. Sample, because it is a collection of salaries for all baseball players in the league, but there are other sports 3. Population, because it is a collection of salaries for all baseball players in the league 4. Population, because it is a subset of all athletes 2. Determine whether the underlined value is a parameter or a statistic. The average age of men who have walked on the......

Words: 3015 - Pages: 13

Free Essay

...sample space is in set notation, abbreviating the colors red and yellow: sample space = {RR, YY, RY, YR}. Note that these four outcomes are not equally likely. We can also represent the experiment and the possible outcomes in a probability tree diagram, as shown below. Note in particular the probabilities given for the second ball. For example, if the ﬁrst ball is red, then four out of the remaining seven balls are red, so the probability that the second ball is red is 4/7 (and the probability that it is yellow is 3/7). On the other hand, if the ﬁrst ball is yellow, then ﬁve out of the remaining seven balls are red, so the probability that the second ball is red is 5/7 (and the probability that it is yellow is 2/7). The probabilities of each of the four outcomes can be computed by multiplying the probabilities along the branches leading to the outcomes. First ball R 5 8 3 8 Second ball 4 7 3 7 Y 5 7 2 7 R Y R Y Outcome Probability RR 5 8 × 4 7 = 5 14 RY 5 8 × 3 7 = 15 56 YR 3 8 × 5 7 = 15 56 YY 3 8 × 2 7 = 3 28 (b) Before the ﬁrst draw, ﬁve out of the eight balls in the urn are red. Each ball is equally likely to be drawn. So the probability that the ﬁrst ball drawn is red is 5/8. (c) The event that at least one of the two balls is red contains three outcomes: RR, RY, and YR. Since we know the probabilities of all of these......

Words: 4161 - Pages: 17