1) On October 1, 20X1, Kelly Company leased a boat from Grant Company. The lease is noncancelable and requires five equal annual payments of $50,000 each. The lease payments are due each October 1, beginning October 1, 20X1. The boat is recorded on Grant’s books at $207,542, which is equal to its fair value. Grant expects that the boat’s residual value at the end of the lease term will be $10,000, but it is not guaranteed by Kelly. However, Kelly has an option to purchase the boat for $10,000 at the end of the lease term. At the inception of the lease, the boat has a remaining economic life of six years with a $2,500 estimated salvage value at the end of its life. Both firms use the straight-line method of amortization and have December 31 year-ends for financial reporting purposes. The interest rate used by Grant Company to calculate the annual lease payment is 12%, and known by Kelly. Collection of the lease payments is reasonably predictable by Grant.
Required:
Complete the following table for Grant’s and Kelly’s December 31, 20X1 income statements:
|
Grant (Lessor) |
Kelly (Lessee) |
|
|
Sales |
||
|
Interest income |
||
|
Rent revenue |
||
|
Amortization expense |
||
|
Rent expense |
||
|
Interest expense |
||
Be sure to show and clearly label all calculations.
In: Accounting
Assume a project information is given in the table below:
| Activity | Immediate Processor | Duration (Days) |
|---|---|---|
| A | --- | 5 |
| B | --- | 5 |
| C | --- | 5 |
| D | A, B | 4 |
| E | B | 3 |
| F | C | 8 |
| G | D, E | 6 |
In: Operations Management
| Distance (m) | 0.3 | 0.6 | 0.9 | 1.2 | 1.5 |
| Time (s) | 3.27 | 7.34 | 11.66 | 16.46 | 21.29 |
Now you will need to use your data to calculate velocities and accelerations. Recall that we have discussed average velocity as vavg = Δx/Δt as well as vavg = (vi + vf)/2. We also discussed average acceleration as aavg = Δv/Δt. Using these equations, calculate the instantaneous velocity of your cart at each distance/time data point and the average acceleration between each pair of distance/time data points. When you have completed your calculations, organize your results into a table with four columns: time, position, velocity, and average acceleration.
In: Physics
Construct two small C programs, compile and set up two executable files for the two commands world and mars. Both commands simply print out messages on the screen:
world n - print the message hello world on the screen n times
mars n - print the message HELLO MARS on the screen n times
Thanks a lot for your help!!!
In: Computer Science
Contrast leadership and management, and what implications for managers offer theories of leadership?
In: Operations Management
When creating the Academic Database, there were several instances of data validation. Data types were assigned to each field in the table to stop undesirable values from being placed into certain fields. A presence check was used on fields that were listed as NOT NULL, requiring some data to be input. Uniqueness validation was automatically assigned for fields that were primary keys. Describe at least one field in the Academic Database a table where range validation could have been used and describe at least one field in the Academic Database where choice validation could have been used. Your answer should be addressed in 100 to 150 words.
In: Computer Science
OpenGL problem
Draw the entire scene composed with more than 5 objects. Scene should Include rigid transformations such as scale, rotate, translate, etc.
And please write down the code of the application program.cpp file (files containing main, render, etc). Also, show the picture of captured result screen.
you should give 1. code of the application program.cpp, 2. picture of captured result screen(entire scene). Please don't give incomplete answer.
In: Computer Science
suppose i have a list in python that is [hello,yo,great,this,cool,fam]
how do I get all the possible 2 combination that I can have from this list in tuples for example output
[ {hello,hello},{hello,yo},{hello,great},....... {yo,hello},{yo,yo} and so on and son}
no packages allowed
In: Computer Science
You are in charge of ordering programs for the Toronto Maple Leaf games. Because they are specific to an opponent, any leftover programs you have are recycled. Demand for programs is uniformly distributed from 3500 to 6500. The programs cost you $1.5 to print and you sell them for $8.0. How many programs should you order each game to maximize expected profits over
Question 31 (2 points)
Consider your answer in Question 30. If you could get $0.50 for unused Programs from a memorabilia company, what would happen to your optimal order?
Question 31 options:
|
stay the same. |
|
|
go up. |
|
|
go down. |
|
|
it depends on the distribution of demand. |
In: Operations Management
In: Operations Management
In: Physics
discuss the two types of diabetes and what you think
you should know as a medical assistant?
type 1 diabetes:
type 2 diabetes:
In: Nursing
RAK, Inc., has no debt outstanding and a total market value of
$165,000. Earnings before interest and taxes, EBIT, are projected
to be $21,000 if economic conditions are normal. If there is strong
expansion in the economy, then EBIT wIll be 25 percent higher. If
there is a recession, then EBIT will be 35 percent lower. The
company is considering a $60,000 debt issue with an interest rate
of 7 percent. The proceeds will be used to repurchase shares of
stock.There are currently 5,500 shares outstanding. Ignore taxes
for this problem.
a. Calculate earnings per share, EPS, under each of the three
economic scenarios before any debt is issued. Also calculate the
percentage changes in EPS when the economy expands or enters a
recession.
b. Repeat part (a) assuming that the company goes through with
recapitalization. What do you observe?
In: Finance
Ayayai Corp.’s unadjusted trial balance at December 1, 2017, is
presented below.
|
Debit |
Credit |
||
|---|---|---|---|
|
Cash |
$25,000 | ||
|
Accounts Receivable |
35,000 | ||
|
Notes Receivable |
8,000 | ||
|
Interest Receivable |
0 | ||
|
Inventory |
36,000 | ||
|
Prepaid Insurance |
3,300 | ||
|
Land |
20,000 | ||
|
Buildings |
135,000 | ||
|
Equipment |
60,000 | ||
|
Patent |
9,000 | ||
|
Allowance for Doubtful Accounts |
$400 | ||
|
Accumulated Depreciation—Buildings |
45,000 | ||
|
Accumulated Depreciation—Equipment |
24,000 | ||
|
Accounts Payable |
27,000 | ||
|
Salaries and Wages Payable |
0 | ||
|
Notes Payable (due April 30, 2018) |
11,500 | ||
|
Income Taxes Payable |
0 | ||
|
Interest Payable |
0 | ||
|
Notes Payable (due in 2023) |
35,000 | ||
|
Common Stock |
50,000 | ||
|
Retained Earnings |
41,400 | ||
|
Dividends |
12,000 | ||
|
Sales Revenue |
900,000 | ||
|
Interest Revenue |
0 | ||
|
Gain on Disposal of Plant Assets |
0 | ||
|
Bad Debt Expense |
0 | ||
|
Cost of Goods Sold |
630,000 | ||
|
Depreciation Expense |
0 | ||
|
Income Tax Expense |
0 | ||
|
Insurance Expense |
0 | ||
|
Interest Expense |
0 | ||
|
Other Operating Expenses |
61,000 | ||
|
Amortization Expense |
0 | ||
|
Salaries and Wages Expense |
100,000 | ||
|
Total |
$1,134,300 | $1,134,300 |
The following transactions occurred during December.
| Dec. 2 | Purchased equipment for $15,600, plus sales taxes of $600 (paid in cash). | |
| 2 | Ayayai sold for $3,500 equipment which originally cost $4,800. Accumulated depreciation on this equipment at January 1, 2017, was $1,800; 2017 depreciation prior to the sale of equipment was $400. | |
| 15 | Ayayai sold for $5,000 on account inventory that cost $3,200. | |
| 23 | Salaries and wages of $6,300 were paid. |
Adjustment data:
| 1. | Ayayai estimates that uncollectible accounts receivable at year-end are $3,800. | |
| 2. | The note receivable is a one-year, 8% note dated April 1, 2017. No interest has been recorded. | |
| 3. | The balance in prepaid insurance represents payment of a $3,300, 6-month premium on September 1, 2017. | |
| 4. | The building is being depreciated using the straight-line method over 30 years. The salvage value is $30,000. | |
| 5. | The equipment owned prior to this year is being depreciated using the straight-line method over 5 years. The salvage value is 10% of cost. | |
| 6. | The equipment purchased on December 2, 2017, is being depreciated using the straight-line method over 5 years, with a salvage value of $1,800. | |
| 7. | The patent was acquired on January 1, 2017, and has a useful life of 9 years from that date. | |
| 8. | Unpaid salaries at December 31, 2017, total $2,000. | |
| 9. | Both the short-term and long-term notes payable are dated January 1, 2017, and carry a 10% interest rate. All interest is payable in the next 12 months. | |
| 10 | Income tax expense was $12,000. It was unpaid at December 31. |
A) Prepare journal entries for the transactions listed above and
adjusting entries. (Credit account titles are
automatically indented when amount is entered. Do not indent
manually. If no entry is required, select "No Entry" for the
account titles and enter 0 for the amounts. Record journal entries
in the order presented in the
problem.)
B) Prepare an adjusted trial balance at December 31, 2017.
C) Prepare a 2017 income statement.
D) Prepare a 2017 retained earnings statement. (List items that increase retained earnings first.)
E) Prepare a December 31, 2017, balance sheet. (List Current Assets in order of liquidity. List Property, Plant and Equipment in order of Land, Buildings and Equipment.)
In: Accounting
5.25. The following pseudocode (next page) is a correct implementation of the producer/consumer problem with a bounded buffer:
Labels p1, p2, p3 and c1, c2, c3 refer to the lines of code shown above (p2 and c2 each cover three lines of code). Semaphores empty and full are linear semaphores that can take unbounded negative and positive values. There are multiple producer processes, referred to as Pa, Pb, Pc, etc., and multiple consumer processes, referred to as Ca, Cb, Cc, etc. Each semaphore maintains a FIFO (first-in-first-out) queue of blocked processes. In the scheduling chart below, each line represents the state of the buffer and semaphores after the scheduled execution has occurred. To simplify, we assume that scheduling is such that processes are never interrupted while executing a given portion of code p1, or p2, . . . , or c3. Your task is to complete the following chart.
|
item[3] buffer; // initially empty semaphore empty; // initialized to +3 semaphore full; // initialized to 0 binary_semaphore mutex; // initialized to 1 |
|
|
void producer() |
void consumer() |
|
{ |
{ |
|
... |
... |
|
while (true) { |
while (true) { |
|
item = produce(); |
c1: wait(full); |
|
p1: wait(empty); |
/ wait(mutex); |
|
/ wait(mutex); |
c2: item = take(); |
|
p2: append(item); |
\ signal(mutex); |
|
\ signal(mutex); |
c3: signal(empty); |
|
p3: signal(full); |
consume(item); |
|
} |
} |
|
} |
} |
|
Scheduled Step of Execution |
full’s State and Queue |
Buffer |
empty’s State and Queue |
|
Initialization |
full=0full=0 |
OOO |
empty=+3empty= +3 |
|
Ca executes c1 |
full=−1full= −1 (Ca) |
OOO |
empty=+3empty= +3 |
|
Cb executes c1 |
full=−2full= −2 (Ca, Cb) |
OOO |
empty=+3empty= +3 |
|
Pa executes p1 |
full=−2full= −2 (Ca, Cb) |
OOO |
empty=+2empty= +2 |
|
Pa executes p2 |
full=−2full= −2 (Ca, Cb) |
X OO |
empty=+2empty= +2 |
|
Pa executes p3 |
full=−1full= −1 (Cb) Ca |
X OO |
empty=+2empty= +2 |
|
Ca executes c2 |
full=−1full= −1 (Cb) |
OOO |
empty=+2empty= +2 |
|
Ca executes c3 |
full=−1full= −1 (Cb) |
OOO |
empty=+3empty= +3 |
|
Pb executes p1 |
full= full= |
empty= empty= |
|
|
Pa executes p1 |
full= full= |
empty= empty= |
|
|
Pa executes __ |
full= full= |
empty= empty= |
|
|
Pb executes __ |
full= full= |
empty= empty= |
|
|
Pb executes __ |
full= full= |
empty= empty= |
|
|
Pc executes p1 |
full= full= |
empty= empty= |
|
|
Cb executes __ |
full= full= |
empty= empty= |
|
|
Pc executes __ |
full= full= |
empty= empty= |
|
|
Cb executes __ |
full= full= |
empty= empty= |
|
|
Pa executes __ |
full= full= |
empty= empty= |
|
|
Pb executes p1-p3 |
full= full= |
empty= empty= |
|
|
Pc executes __ |
full= full= |
empty= empty= |
|
|
Pa executes p1 |
full= full= |
empty= empty= |
|
|
Pd executes p1 |
full= full= |
empty= empty= |
|
|
Ca executes c1-c3 |
full= full= |
empty= empty= |
|
|
Pa executes __ |
full= full= |
empty= empty= |
|
|
Cc executes c1-c2 |
full= full= |
empty= empty= |
|
|
Pa executes __ |
full= full= |
empty= empty= |
|
|
Cc executes c3 |
full= full= |
empty= empty= |
|
|
Pd executes p2-p3 |
full= full= |
empty= |
In: Computer Science