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
We saw earlier that LT is not closed under concatenation. If we think in terms of the LT graphs, recognizing the concatenation of LT languages would seem to require knowing, while

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

Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff ≡L partitions Σ* into ?nitely many Nerode equivalence classes. Proof: For the "only if" direction (that every recogn

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?

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.

Sketch an algorithm for the universal recognition problem for SL 2 . This takes an automaton and a string and returns TRUE if the string is accepted by the automaton, FALSE otherwi

Automaton (NFA) (with ε-transitions) is a 5-tuple: (Q,Σ, δ, q 0 , F i where Q, Σ, q 0 and F are as in a DFA and T ⊆ Q × Q × (Σ ∪ {ε}). We must also modify the de?nitions of th