QUESTION 1

1. (a) List down the 5 threats to Auditor’s Independence and explain each threat.

2. (b) What are the Types of Audit Evidence? Explain each type.

3. (c) What are the three main Types of Substantive Procedures? Explain each type.

4. (d) List down the Financial Statement Assertions relating to Account Balances and explain each

   assertion.

5. (e) List down the Financial Statement Assertions relating to Classes of Transactions and explain

   each assertion.

Question: Write a method named reduce that:
● Takes a function of type (A, A) => A
● Returns A
● Combines all the elements of the list into a single value by applying the provided function
to all elements
○ You may assume the function is commutative
● If the list has size 1, return that element without calling the provided function
Example: If head stores a reference to the List(4, 6, 2)
head.reduce((a: Int, b: Int) => a + b) == 12

Programming language is Scala

Find a list of at least five related numbers. Compute statistics about the data, and give your interpretation.

Analyze the data you have gathered.

1. Possible sources include the 2010 census, Yahoo finance, and U. S. News and World Report.
2. The data could be sports scores, the national debt, a rate or an amount, such as mortality, literacy, abortion, marriage, high school graduation, college graduation, poverty, income, intelligence quotient, profitability, stock price, dividend, population, or something else.
3. List the data.
4. List your sources.
5. List the statistics you have computed about the data including mean, mode, median, midrange, range, and standard deviation.
6. Give your interpretation of the statistics.

Time Management Assignment:

DIRECTIONS: Write a 1½ to 2 page essay on Time Management. You can use the Internet to research Time Management and answer the Objectives listed below. Your essay should include the following information:

1. Time Management: Define. List time wasters, ways to eliminate time wasters, and ways to better manage our time.
2. Organization: Define. List ways to develop good work habits, ID hindrances, how to organize work area, tools to use in achieving organization, and step by step open and close of the office.
3. Prioritize: Define. Discuss proper steps to achieve prioritization, explain a “to do” list, prioritize in the office, and list several hindrances.

.Create, test, and validate an XHTML document that describes an ordered list with the following contents: The highest level should be the names of your parents, with your mother first. Under each parent, you must have a nested, ordered list of the brothers and sisters of your parents, in order by age, eldest first. Each of the nested lists in turn must have nested lists that list the children of your uncles and aunts (your cousins)—under the proper parents, of course. Regardless of how many aunts, uncles, and cousins you actually have, there must be at least three list items in each sublist below each of your parents and below each of your aunts and uncles.

We wonder if caffeine facilitates the learning of nonsense syllables. We randomly assign participants to one of two groups. People in the experimental group drink 2 cups of coffee and then learn a list of nonsense syllables. People in the control group drink 2 cups of plain water and then learn the same list. We record the number of trials required to perfectly learn the list for each participant. Did participants who drank the coffee learn the list faster than participants who drank the water? Be sure to interpret your answer completely, including a graph if appropriate.

Using pthread_create(), pthread_join(), and pthread_exit(), write a C or C++ program running on VirtualBox Debian VM shell to sort a list of signed integers in nondecreasing order using the sorting algorithm of your own choice from a text file containing the integers.

The input data should be stored in a file named p2data.txt

Sort a list of signed integers in nondecreasing order using three threads, among which two of them are sorting threads responsible for sorting each of the two sublists, while the third thread (i.e. the merging thread) is responsible for merging the two sorted sublists into a single sorted list. You may assume that the total number of integers in the list is less than or equal to 20.

Write a C program that creates and prints out a linked list of strings.

• Define your link structure so that every node can store a string of up to 255 characters.

• Implement the function insert_dictionary_order that receives a word (of type char*) and inserts is into the right position.

• Implement the print_list function that prints the list.

• In the main function, prompt the user to enter strings (strings are separated by white-spaces, such as space character, tab, or newline).

• Read and insert every string into the link list until you reach a single dot “.” or EOF.

• Print the list. Use scanf to read strings. Use strcpy() for copying strings.

Here is a sample text input:

This is a sample text. The file is terminated by a single dot: .

Task 4
The class Polynomials is a collection of polynomials of either implementation stored in an instance of the
generic library class List.
class Polynomials
{
private List<Polynomial> L;
// Creates an empty list L of polynomials
public Polynomials ( )
{ … } (1 mark)
// Retrieves the polynomial stored at position i in L
public Polynomial Retrieve (int i) (1 mark)
{ … }
// Inserts polynomial p into L
public void Insert (Polynomial p) (1 mark)
{ … }
// Deletes the polynomial at index i
public void Delete (int i) (1 mark)
{ … }
// Returns the number of polynomials in L
public int Size ( )
{ … } (1 mark)
// Prints out the list of polynomials
public void Print ( )
{ … }
}

The class Polynomials is a collection of polynomials of either implementation stored in an instance of the
generic library class List.
class Polynomials
{
private List L;
// Creates an empty list L of polynomials
public Polynomials ( )
{ … } (1 mark)
// Retrieves the polynomial stored at position i in L
public Polynomial Retrieve (int i) (1 mark)
{ … }
// Inserts polynomial p into L
public void Insert (Polynomial p) (1 mark)
{ … }
// Deletes the polynomial at index i
public void Delete (int i) (1 mark)
{ … }
// Returns the number of polynomials in L
public int Size ( )
{ … } (1 mark)
// Prints out the list of polynomials
public void Print ( )
{ … }

Please use C# to answer