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

Finite state automata, Since the signi?cance of the states represented by t...

Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev

Abstract model of computation, When we say "solved algorithmically" we are ...

When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program

Regular expressions, The project 2 involves completing and modifying the C+...

The project 2 involves completing and modifying the C++ program that evaluates statements of an expression language contained in the Expression Interpreter that interprets fully pa

Finiteness of languages is decidable, To see this, note that if there are a...

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the

Pumping lemma constant, a) Let n be the pumping lemma constant. Then if L i...

a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le

Equivalence of nfas, It is not hard to see that ε-transitions do not add to...

It is not hard to see that ε-transitions do not add to the accepting power of the model. The underlying idea is that whenever an ID (q, σ  v) directly computes another (p, v) via

Convert chomsky normal form into binary form, Suppose G = (N, Σ, P, S) is a...

Suppose G = (N, Σ, P, S) is a reduced grammar (we can certainly reduce G if we haven't already). Our algorithm is as follows: 1. Define maxrhs(G) to be the maximum length of the

Qbasic, Ask question #Minimum 100 words accepte

Ask question #Minimum 100 words accepte

Language accepted by a nfa, The language accepted by a NFA A = (Q,Σ, δ, q 0...

The language accepted by a NFA A = (Q,Σ, δ, q 0 , F) is NFAs correspond to a kind of parallelism in the automata. We can think of the same basic model of automaton: an inpu

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