Concept explainers
Fortune magazine publishes an annual survey of the 100 best companies to work for. The data in the DATAfile named FortuneBest100 shows the rank, company name, the size of the company, and the percentage job growth for full-time employees for 98 of the Fortune 100 companies for which percentage job growth data were available (Fortune magazine website, February 25, 2013). The column labeled Rank shows the rank of the company in the Fortune 100 list; the column labeled Size indicates whether the company is a small company (less than 2500 employees), a midsized company (2500 to 10,000 employees), or a large company (more than 10,000 employees); and the column labeled Growth Rate (%) shows the percentage growth rate for full-time employees.
a. Construct a crosstabulation with Job Growth (%) as the row variable and Size as the column variable. Use classes starting at -10 and ending at 70 in increments of 10 for Growth Rate (%).
b. Show the frequency distribution for Job Growth (%) and the frequency distribution for Size.
c. Using the crosstabulation constructed in part (a), develop a crosstabulation showing column percentages.
d. Using the crosstabulation constructed in part (a), develop a crosstabulation showing row percentages.
e. Comment on the relationship between the percentage job growth for full-time employees and the size of the company.
Trending nowThis is a popular solution!
Chapter 2 Solutions
Bundle: Statistics for Business & Economics, Loose-leaf Version, 13th + MindTap Business Statistics with XLSTAT, 2 terms (12 months) Printed Access Card
- T1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an independent set and m(G) = |E(G)|. (i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The neighborhood of a vertex in a triangle free graph must be independent; all edges have at least one end in a vertex cover. (ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you may need to use either elementary calculus or the arithmetic-geometric mean inequality.arrow_forwardWe consider the one-period model studied in class as an example. Namely, we assumethat the current stock price is S0 = 10. At time T, the stock has either moved up toSt = 12 (with probability p = 0.6) or down towards St = 8 (with probability 1−p = 0.4).We consider a call option on this stock with maturity T and strike price K = 10. Theinterest rate on the money market is zero.As in class, we assume that you, as a customer, are willing to buy the call option on100 shares of stock for $120. The investor, who sold you the option, can adopt one of thefollowing strategies: Strategy 1: (seen in class) Buy 50 shares of stock and borrow $380. Strategy 2: Buy 55 shares of stock and borrow $430. Strategy 3: Buy 60 shares of stock and borrow $480. Strategy 4: Buy 40 shares of stock and borrow $280.(a) For each of strategies 2-4, describe the value of the investor’s portfolio at time 0,and at time T for each possible movement of the stock.(b) For each of strategies 2-4, does the investor have…arrow_forwardNegate the following compound statement using De Morgans's laws.arrow_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardQuestion 6: Negate the following compound statements, using De Morgan's laws. A) If Alberta was under water entirely then there should be no fossil of mammals.arrow_forwardNegate the following compound statement using De Morgans's laws.arrow_forward
- Characterize (with proof) all connected graphs that contain no even cycles in terms oftheir blocks.arrow_forwardLet G be a connected graph that does not have P4 or C3 as an induced subgraph (i.e.,G is P4, C3 free). Prove that G is a complete bipartite grapharrow_forwardProve sufficiency of the condition for a graph to be bipartite that is, prove that if G hasno odd cycles then G is bipartite as follows:Assume that the statement is false and that G is an edge minimal counterexample. That is, Gsatisfies the conditions and is not bipartite but G − e is bipartite for any edge e. (Note thatthis is essentially induction, just using different terminology.) What does minimality say aboutconnectivity of G? Can G − e be disconnected? Explain why if there is an edge between twovertices in the same part of a bipartition of G − e then there is an odd cyclearrow_forward
- Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell