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, 1. Does above all''s properties can be used to prove a lang...

1. Does above all''s properties can be used to prove a language regular? 2..which of the properties can be used to prove a language regular and which of these not? 3..Identify one

Deterministic finite automata, conversion from nfa to dfa 0 | 1 ____...

conversion from nfa to dfa 0 | 1 ___________________ p |{q,s}|{q} *q|{r} |{q,r} r |(s) |{p} *s|null |{p}

Decidability, examples of decidable problems

examples of decidable problems

Class of recognizable languages, Proof (sketch): Suppose L 1 and L 2 are ...

Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(

Chomsky normal form, s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbo...

s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbol?

Strictly k-local automata, Strictly 2-local automata are based on lookup ta...

Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

TRANSPORTATION, DEGENERATE OF THE INITIAL SOLUTION

DEGENERATE OF THE INITIAL SOLUTION

Non-determinism - recognizable language, Our DFAs are required to have exac...

Our DFAs are required to have exactly one edge incident from each state for each input symbol so there is a unique next state for every current state and input symbol. Thus, the ne

Computer Simulation, Generate 100 random numbers with the exponential distr...

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?

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