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

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

#### Dfa to re, c program to convert dfa to re

c program to convert dfa to re

#### ARDENS THROREM, PROPERTIES OF Ardens therom

PROPERTIES OF Ardens therom

#### #title., distinguish between histogram and historigram

distinguish between histogram and historigram

#### Mealy machine, Construct a Mealy machine that can output EVEN or ODD Accord...

Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1''s encountered is even or odd.

#### Class of local languages is not closed under union, Both L 1 and L 2 are ...

Both L 1 and L 2 are SL 2 . (You should verify this by thinking about what the automata look like.) We claim that L 1 ∪ L 2 ∈ SL 2 . To see this, suppose, by way of con

#### Project Management at the Phoenician, Ask question #Minimum 20 words accept...

Ask question #Minimum 20 words accepted#

#### Local suffix substitution closure, The k-local Myhill graphs provide an eas...

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

#### Regular expression, what is regular expression?

what is regular expression?

#### Context free grammar, A context free grammar G = (N, Σ, P, S)  is in binary...

A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

#### 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

### Write Your Message!

#### 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!