Prepare the consolidated financial statements, Theory of Computation

Assignment Help:

Prepare the consolidated financial statements for the year ended 30 June 2011.

On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , John Ltd's equity consisted of the following:

Share capital                      $500,000

General reserve                  $ 100,000

Retained Earnings              $ 50,000

At 1 July 2007, all the identifiable assets and liabilities of John Ltd were recorded at fair value.

Financial information for Mark Ltd and John Ltd for the year ended 30 June 2011 is presented in the left hand columns of the worksheet. It is assumed that both companies use the perpetual inventory system.

Additional information:

a) During the year 2010-11, John Ltd  paid a dividend of $30,000 from profits earned before 20 June,2007.

b) On January 1 2011, John Ltd sold merchandise costing $40,000 to Mark Ltd for $50,000. Half this merchandise was sold to external entities for $30,000 before 30 June2011.

c) It is estimated that goodwill acquired in John Ltd has been impaired by an amount of $7000.

d) Mark Ltd sells plant to John Ltd for $8,500. This plant initially cost Mark Ltd $15,000, is 5 years old and has an accumulated depreciation of $8000 at the date of sale . The remaining useful life is assessed as 7 years.

e) At July 1 2010, there was a profit in the inventory of Mark Ltd of $4000 on goods acquired from John Ltd in the previous period.

f) The tax rate is 30%.


Related Discussions:- Prepare the consolidated financial statements

Kleene closure, One might assume that non-closure under concatenation would...

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included

Decision problems of regular languages, We'll close our consideration of re...

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

Problem solving and programming concepts, The Last Stop Boutique is having ...

The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product

Normal forms, how to convert a grammar into GNF

how to convert a grammar into GNF

#turing machine, #can you solve a problem of palindrome using turing machin...

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

Production, How useful is production function in production planning?

How useful is production function in production planning?

Pojects idea, i want to do projects for theory of computation subject what ...

i want to do projects for theory of computation subject what topics should be best.

Decision problems, In Exercise 9 you showed that the recognition problem an...

In Exercise 9 you showed that the recognition problem and universal recognition problem for SL2 are decidable. We can use the structure of Myhill graphs to show that other problems

Example of finite state automaton, The initial ID of the automaton given in...

The initial ID of the automaton given in Figure 3, running on input ‘aabbba' is (A, aabbba) The ID after the ?rst three transitions of the computation is (F, bba) The p

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd