The fiscal year-end 2016 financial statements for Walt Disney Co. report revenues of $68,632 million, net operating profit after tax of $9,754 million, net operating assets of $58,603 million. The fiscal year-end 2015 balance sheet reports net operating assets of $59,079 million.         Walt Disney’s 2016 net operating profit margin is:

The 2023 Form 10-K of Oracle Corporation, for the May 31, 2023 year-end, included the following information relating to their allowance for doubtful accounts: Balance in allowance at the beginning of the year $476 million, accounts written off during the year of $167 million, balance in allowance at the end of the year $379 million.         What did Oracle Corporation report as bad debt expense for the year?

In its 2023 annual report, Caterpillar Inc. reported the following (in millions):     2023 2022 Sales $38,537 $47,011 Cost of goods sold $26,309 $38,546   As a percentage of sales, did Caterpillar’s gross profit increase or decrease during 2023?

Great Deal Company forecasts a $1.35 dividend for 2021, $1.42 dividend for 2022 and a $1.60 dividend for 2023 for Beach Corporation.  For all years after 2023, Great Deal Company forecasts that Beach dividends will grow at 1% per year.    Using the dividend discount valuation model determine the intrinsic value of Beach Corporation, assuming the company’s cost of equity capital is 5%.

Exam 1- Ch. 1, 2, 6 & 7

Consider the situation where we want to transmit a sequence of symbols from the alphabet {A,B,C,D}, with frequencies given byA: 0.16, B: 0.34, C: 0.33, D: 0.17In an optimal encoding (as produced by Huffman’s algorithm), how many bits will be used to represent

For the various knapsack problems, we have considered the greedy strategy G of first picking as much as allowed of the most precious item (the one with highest value/weight ratio), next picking as much as allowed of the second most precious item, etc, etc.  Match each version with the outcome guaranteed:

We shall consider the general method, employed by an adversary,  to prove that no algorithm can always decide a given problem X using less than M questions. For that purpose, the adversary maintains Q, and R_1 … R_M, such that : 1. X(Q) is true2. X(R_i) is false for all i \in 1 … M and such that after k questions from the algorithm:3. Q is consistent with all k answers from the adversary 4. for all i in 1 … M, except for at most k such, it holds that R_i is consistent with all k answers from the adversary.For each declaration from the algorithm, how should the adversary respond?

Assume that X can be polynomially reduced  to Z, in that there exists a function f such that     forall  x,   x in X   iff   f(x) in Zand f can be computed in time polynomial in the size of x. Which inferences are then valid?

Consider how we could decide the 3COL problem:  generate one color map, and check if it is a valid coloring;  if not, then reuse the space to generate a second color map,  and check if it is a valid coloring; if not,  then reuse the space to generate a third color map, etc, etc,  until either some color map has been found valid,  or all color maps have been found invalid. Observe that a color map can be generated and checked in polynomial time. What can we then say about each of the below claims (where PSPACE are the problems that can be decided in polynomial space)?