Prepare the consolidated financial statements, Theory of Computation

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%.

Posted Date: 3/18/2013 1:15:58 AM | Location : United States







Related Discussions:- Prepare the consolidated financial statements, Assignment Help, Ask Question on Prepare the consolidated financial statements, Get Answer, Expert's Help, Prepare the consolidated financial statements Discussions

Write discussion on Prepare the consolidated financial statements
Your posts are moderated
Related Questions
Explain Theory of Computation ,Overview of DFA,NFA, CFG, PDA, Turing Machine, Regular Language, Context Free Language, Pumping Lemma, Context Sensitive Language, Chomsky Normal For

Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

Give DFA''s accepting the following languages over the alphabet {0,1}: i. The set of all strings beginning with a 1 that, when interpreted as a binary integer, is a multiple of 5.

The Myhill-Nerode Theorem provided us with an algorithm for minimizing DFAs. Moreover, the DFA the algorithm produces is unique up to isomorphism: every minimal DFA that recognizes

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define part



The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo