logo

Crowdly

Browser

Add to Chrome

Questions Bank (1546715 total)

Which of the following statements is LEAST consistent with the section on ‘Personal Income Tax Strategies’ in Australia:

100%
0%
0%
0%
View this question

Which of the following statements is LEAST consistent with section on the lecture on ‘Preparing a Tax Return’ and other relevant sections:

0%
0%
100%
0%
View this question

If I was to loop over this Iterator, how many times would it iterate?

class NumberIterator:

    def __init__(self):

        self.current = 1

        

    def __iter__(self):

        return self

        

    def __next__(self):

        if self.current == 10:

            raise StopIteration()

        

        next_item = self.current

        self.current += 2

        return next_item
0%
0%
100%
0%
View this question

What is TRUE about a Python Generator?

0%
0%
0%
0%
View this question
What shape of demand curves do monopoly firms have, and how much output can they sell?
0%
0%
0%
100%
0%
View this question
When a monopolist increases the amount of output that it produces and sells, what happens to its average revenue and its marginal revenue?
❌
❌
❌
❌
✅
View this question
The main operations of the Stack ADT are push() and pop(). We wish to implement the stack using linked nodes. What are the worst-case time complexities of these methods? We can assume 

n is referring to the number of elements currently in the stack.
0%
0%
100%
0%
View this question

Jenny lives in the country of Snowland. Her taxable income is $24,000 per year. Snowland’s income tax schedule is provided below. Snowland also has a 2% Medicare Levy. What is her income tax payable including Medicare Levy (to the nearest dollar)? Please do not include dollar signs or commas in your answer.

Bracket

Taxable income p.a.

Marginal tax rate

Tax on previous brackets

1

$0 to $10,000

0%

$0

2

$10,000 to $20,000

10%

$0

3

$20,000 to $40,000

20%

$1,000

4

$40,000 to $80,000

30%

$5,000

5

$80,000 or more

40%

$17,000

View this question

I want to add a new method to the Linked Queue class to augment the queue self with the elements of another queue other provided as an argument. This may be seen as an in-place queue merging. What would be the worst-case time complexity required to do this operation efficiently? You can assume that

n is the length of self and m is the length of other.

For example, if I had the following queues:

self: 1 -> 2 -> 3 -> 4 -> 5 [1 is the front of the queue]

other: 6 -> 7 -> 8 -> 9 -> 10 [6 is the front of the queue]

The result should be:

self: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10 [1 is the front of the queue]

0%
0%
0%
100%
View this question

Lisa lives in the country of Snowland. She has:

  • a part-time job with one employer earning a gross salary of $23,000 per year;
  • a casual job with a different employer earning a gross salary of $8,000 per year;
  • $13,000 in a 1 year term deposit that will earn interest at the rate of 5% per year; and
  • study expenses of $5,000 per year that are an allowable deduction.

What is her taxable income (to the nearest dollar)? Please do not include dollar signs or commas in your answer.

View this question