Exercises 1 through 4 refer to the data set shown in Table 15-12 The table shows the scores on a Chem 103 test consisting of 10 questions worth 10 points each.
Table 15-12
Chem 103 test scores
Student ID | Score | Student ID | Score |
1362 | 50 | 4315 | 70 |
1486 | 70 | 4719 | 70 |
1721 | 80 | 4951 | 60 |
1932 | 60 | 5321 | 60 |
2489 | 70 | 5872 | 100 |
2766 | 10 | 6433 | 50 |
2877 | 80 | 6921 | 50 |
2964 | 60 | 8317 | 70 |
3217 | 70 | 8854 | 100 |
3588 | 80 | 8964 | 80 |
3780 | 80 | 9158 | 60 |
3921 | 60 | 9347 | 60 |
4107 | 40 |
Suppose that the grading scale for the test is
a. What percentage of the students who took the test got a grade of
b. In a pie chart showing the distribution of the test grades, what is the size of the central angle (in degrees) of the “wedge” representing the grade of
c. Draw a pie chart showing the distribution of the test grades. Give the central angles for each wedge in the pie chart.
(round your answer to the nearest degree).
Want to see the full answer?
Check out a sample textbook solutionChapter 15 Solutions
EXCURSIONS IN MODERN MATH
- 1.2.15. (!) Let W be a closed walk of length at least 1 that does not contain a cycle. Prove that some edge of W repeats immediately (once in each direction).arrow_forward1.2.18. (!) Let G be the graph whose vertex set is the set of k-tuples with elements in (0, 1), with x adjacent to y if x and y differ in exactly two positions. Determine the number of components of G.arrow_forward1.2.17. (!) Let G,, be the graph whose vertices are the permutations of (1,..., n}, with two permutations a₁, ..., a,, and b₁, ..., b, adjacent if they differ by interchanging a pair of adjacent entries (G3 shown below). Prove that G,, is connected. 132 123 213 312 321 231arrow_forward
- 1.2.19. Let and s be natural numbers. Let G be the simple graph with vertex set Vo... V„−1 such that v; ↔ v; if and only if |ji| Є (r,s). Prove that S has exactly k components, where k is the greatest common divisor of {n, r,s}.arrow_forward1.2.20. (!) Let u be a cut-vertex of a simple graph G. Prove that G - v is connected. עarrow_forward1.2.12. (-) Convert the proof at 1.2.32 to an procedure for finding an Eulerian circuit in a connected even graph.arrow_forward
- 1.2.16. Let e be an edge appearing an odd number of times in a closed walk W. Prove that W contains the edges of a cycle through c.arrow_forward1.2.11. (−) Prove or disprove: If G is an Eulerian graph with edges e, f that share vertex, then G has an Eulerian circuit in which e, f appear consecutively. aarrow_forwardBy forming the augmented matrix corresponding to this system of equations and usingGaussian elimination, find the values of t and u that imply the system:(i) is inconsistent.(ii) has infinitely many solutions.(iii) has a unique solutiona=2 b=1arrow_forward
- 1.2.6. (-) In the graph below (the paw), find all the maximal paths, maximal cliques, and maximal independent sets. Also find all the maximum paths, maximum cliques, and maximum independent sets.arrow_forward18 Find the expected value E(X) and the variance V(X) for the following probability density function. f(x)=2x-4 for 1arrow_forward1.2.13. Alternative proofs that every u, v-walk contains a u, v-path (Lemma 1.2.5). a) (ordinary induction) Given that every walk of length 1-1 contains a path from its first vertex to its last, prove that every walk of length / also satisfies this. b) (extremality) Given a u, v-walk W, consider a shortest u, u-walk contained in W.arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillFunctions and Change: A Modeling Approach to Coll...AlgebraISBN:9781337111348Author:Bruce Crauder, Benny Evans, Alan NoellPublisher:Cengage Learning