Questions
Regarding insurance, if you have a policies table and an insured clients table, what do think...

Regarding insurance, if you have a policies table and an insured clients table, what do think the database cardinality would be? One-to-one, one-to-many, or many-to-many? Explain

In: Operations Management

What is Netsuite Oracle, what features do they have, what is the pricing of it, specific...

What is Netsuite Oracle, what features do they have, what is the pricing of it, specific information of Netsuite. Does it have something for a customer database? If so what is it called and its features.

In: Operations Management

Use the United National Conference on Trade and Development FDI Database (available under the Statistics option...

Use the United National Conference on Trade and Development FDI Database (available under the Statistics option at unctad.org) to research the foreign direct investment profile of a country or region of your choice.

In: Economics

1. Describe one solution about how to create and authenticate the identities of the database administers...

1. Describe one solution about how to create and authenticate the identities of the database administers

2 Describe one solution about how to grant the administrator permissions to the three employees.

In: Computer Science

Think about a DATABASE PROJECT (BUSINESS PROBLEM) you want to do after school show me the...

Think about a DATABASE PROJECT (BUSINESS PROBLEM) you want to do after school

show me the attributes

create a three table for it and explain each table and what it mean.

In: Computer Science

Under System requirement provide a detail overall description, product perspective, Memory Constraint, user interface, Site adaptation...

Under System requirement provide a detail overall description, product perspective, Memory Constraint, user interface, Site adaptation Requirements and Operations of building a HBCU Database Hub/Center.

In: Computer Science

Using the module discussion forum, work with your fellow students to identify any other database benefits...

Using the module discussion forum, work with your fellow students to identify any other database benefits you can think of, as say compared to a spreadsheet or basic file storage.

In: Computer Science

SUBJECT: AUDIT & ASSURANCE Forecast Financial Statements On your second day at AA’s head office, you...

SUBJECT: AUDIT & ASSURANCE

Forecast Financial Statements

On your second day at AA’s head office, you have been given the forecast financial statements for the full year to 30 June 2020, as well as the previous two years’ audited results.

Aussie Airlines: Consolidated Income Statement (Selected) Year Ended 30th June
Currency AUD Millions (figures are rounded)

Forecast 2020

Actual 2019

Actual 2018

Revenue

12.0

18.0

18.0

Expenditure

Wages

3.3

5.0

5.0

Aircraft Costs

4.0

4.0

3.7

Fuel

2.5

3.0

3.0

Depreciation

1.6

1.4

1.4

Other

2.5

3.1

3.4

PBIT

(1.9)

1.5

1.5

Finance Costs

(0.2)

(0.2)

(0.2)

Income Tax

0.0

(0.4)

(0.4)

Statutory Profit for the Year

(2.1)

0.9

0.9

Aussie Airlines: Consolidated Balance Sheet (Selected) As at 30th June
Currency AUD Millions (figures are rounded)

Forecast 2020

Actual 2019

Actual 2018

Current Assets

Cash & Cash Equivalents

0.5

1.8

1.5

Receivables

2.0

1.5

1.0

Other

0.7

1.0

1.0

Total Current Assets

3.2

4.3

3.5

Non-Current Assets

Property, Plant & Equipment

12.3

13.0

13.0

Intangible Assets

0.7

2.0

2.1

Other

1.0

0.0

0.1

Total Non-Current Assets

14.0

15.1

15.2

Total Assets

17.2

19.4

18.7

Current Liabilities

Payables

4.0

1.8

1.7

Revenue Received in Advance

1.0

5.0

4.5

Interest Bearing Liabilities

2.0

0.6

0.4

Provisions

0.9

1.0

1.0

Other

Total Current Liabilities

7.9

8.6

7.6

Non-Current Liabilities

Forecast 2020

Actual 2019

Actual 2018

Revenue Received in Advance

0.2

1.5

1.5

Interest Bearing Liabilities

6.5

4.6

4.3

Provisions

0.4

0.4

0.4

Deferred Tax Liabilities

0.8

0.8

0.9

Other

0.1

0.1

0.0

Total Non-Current Liabilities

8.0

7.4

7.1

Total Liabilities

15.9

15.9

14.7

Net Assets

1.3

3.5

4.0

Equity

Issued Capital

1.9

1.9

2.5

Treasury Shares

(0.2)

(0.2)

(0.1)

Reserves

0.2

0.2

0.5

Retained Earnings

(0.5)

1.6

1.1

Total Equity

1.3

3.5

4.0

QUESTION: After discovering that Aussie Airlines is a going concern, select one material account from AA’s Balance Sheet and one material account from the Income Statement and prepare a brief plan for auditing each account. Give particular attention to the following:

  1. An assessment of the audit risk for the account, given the information in this case study and your assumptions.

  2. The relevant/significant audit assertions for this account.

  3. Name two controls that you would expect management to implement for this account. How would you test these controls.

  4. Describe two substantive testing procedures that you would perform in relation to this account to address the relevant/significant assertions.

In: Accounting

JAVA Programming. How Long is this Gonna Take? Undergraduate students are surprised to learn that as...

JAVA Programming.

How Long is this Gonna Take?

Undergraduate students are surprised to learn that as much intellectual energy has been invested in sorting and searching as almost any other part of Computer Science. Think of Duke Energy's customer database—it’s huge. New customers have to be added, former ones deleted, bills must be sent out, customers send in their payments and inquire about their accounts. An efficient data organization is required for Duke to function at all. The first attack on organizing data involves sorting data elements into some order, and exploiting that order when trying to retrieve a particular element.

Hundreds of sorting algorithms have been developed, and like all sorting algorithms, Selection Sort accomplishes its task by making comparisons and data movements. We often compare algorithms by counting the number of comparisons and movements required—the fewer the better. This begs the question, how many comparisons and movements does the Selection Sort make? And, are these actions affected by the initial arrangement of data values in the array? This is the focus of this lab.

Objectives

By the end of this lab students should be able to

  • Allocate arrays
  • Initialize an array with random numbers
  • Initialize an array to be contain monotonically increasing and decreasing values
  • Sort arrays
  • Explain how sorting time increases as the number of elements to be sorted increases

Collecting Sorting Data

Start with the SelectionSort class in the zip file attached to this item. Keep the name SelectionSort, and add a main method to it.

  • Modify the selectionSort method to have two counters, one for the number of comparisons, and one for the number of data swaps. Each time two data elements are compared (regardless of whether the items are in the correct order—we're interested in that a comparison is being done at all), increment the comparison counter. Each time two data items are actually swapped, increment the data swap counter.
  • At the end of the selectionSort method, print the size of the sorted array, and the counters. (Be sure to identify which counter is which in your print message
  • In your main method,
    • Declare a final int, NUM_ELEMENTS. Initially set NUM_ELEMENTS to 10 to debug your program.
    • Declare and create three double arrays of NUM_ELEMENTS length, lo2Hi, hi2Lo, random.
    • Initialize the first array, lo2Hi, with values 1.0, 2.0, …, NUM_ELEMENTS
    • Initialize the second array, hi2Lo with values NUM_ELEMENTS, 24.0,…, 1.0
    • Initialize the third array, random, with random double values between 0.0 and less than 1.0
    • call the selectionSort method using each array. (Note: you might want to print the array elements themselves for debugging purposes when NUM_ELEMENTS is small, but you’ll not want to print them with larger values for NUM_ELEMENTS.)
  • Run your program three times with different values for NUM_ELEMENTS: 1000, 2000 and 4000.

In your submission write some text describing the relationship between the number of comparisons of the various values of NUM_ELEMENTS. For example, what do we find if we divide the number of comparisons for 2000 elements by the number of comparisons for 1000 elements? What do we find if we divide the number of comparisons for 4000 elements by the number of comparisons for 2000 elements?

Epilog: As you can tell, Selection sort doesn’t scale very well. The number comparisons increase quadradically as a function of number of elements. There comes a point that, because of array size, it’s impractical to use Selection sort. The good news is there are hundreds of sorting algorithms. Some suffer from the same performance shortcomings as Selection sort, but others that are almost “magical” in that increasing the number of elements has minor impact on performance. If you’re interested, take a look at chapter 23 Sorting.

Reporting Sorting Data

Submit, in addition to your program, submit the following information in some understandable form (it doesn’t have to be this exact table, but your submission should contain this information).

1000 elements

2000 elements

4000 elements

Comparison count lo2Hi

Comparison count hi2Lo

Comparison count random

Swap count lo2Hi

Swap count hi2Lo

Swap count random

Increasing the number of elements from 1000 to 2000 increases the number of comparisons by a factor of

Increase factor

Increasing the number of elements from 2000 to 4000 increases the number of comparisons by a factor of

Increase factor

Grading Elements

  • use class SelectionSort with the selectionSort method
  • instrument selectionSort with comparisonCnt and swapCnt, and print the number of array elements and the comparisonCnt and swapCnt values
  • write a main method with final int NUM_ELEMENTS
  • declare and create three double arrays of length NUM_ELEMENTS
  • initialize the arrays as specified
  • call selectionSort with each array
  • Run the SelectionSort with different values for NUM_ELEMENTS: 1000, 2000 and 4000.
  • Document the 18 data values described above.
  • Document the ratio of comparisonCnt values for 2000 elements and 1000 elements.
  • Document the ratio of comparisonCnt values for 4000 elements and 2000 elements
SelectionSort.java 
public class SelectionSort {
  /** The method for sorting the numbers */
  public static void selectionSort(double[] list) {
    for (int i = 0; i < list.length - 1; i++) {
      // Find the minimum in the list[i..list.length-1]
      double currentMin = list[i];
      int currentMinIndex = i;

      for (int j = i + 1; j < list.length; j++) {
        if (currentMin > list[j]) {
          currentMin = list[j];
          currentMinIndex = j;
        }
      }

      // Swap list[i] with list[currentMinIndex] if necessary;
      if (currentMinIndex != i) {
        list[currentMinIndex] = list[i];
        list[i] = currentMin;
      }
    }
  }
}

In: Computer Science

Write a two page paper that describes general networkarchitecture and analyzes contemporary threats to network...

Write a two page paper that describes general network architecture and analyzes contemporary threats to network security. Be sure to include a discussion of both the advantages and disadvantages of firewalls. Include at least 3 outside scholarly sources in your analysis, and ensure that you document these sources in both your in text citations and your References list.

In: Computer Science