QUESTION FOUR
The following ratios have been calculated from the most recent financial statements for Goodman Enterprises and Kwiksave Limited. Both businesses operate in the retail industry.

Goodman Enterprises       Kwiksave Limited
Average collection period    55 days 22 days
Gross profit margin 39% 13%
Average days in inventory 46 days 23 days
Net profit margin    9.9% 9.9%

REQUIRED:
(a)   Compare and contrast the profitability and liquidity of Goodman Enterprises and Kwiksave Limited on the basis of the ratios above. (word limit: 300 words)

(b)   Explain which of the two businesses is likely to be operating in a price-competitive environment and to what extent this has impacted on their net profit margin. (word limit: 150 words)

In the following two parts:

1. Pick the right answer and fully explain why this is the correct answer
2. Fully explain why each of the other three options are not the correct answer. Provide a relevant example to enhance your answer.

Each Part must be no more than 160 words in total.”

1)A.“Which one of the following is not a cause of economic growth?”

a. reduction in the retirement age

b.advances in technology

c.improvements in education and training

d.the discovery of a new natural fuel

Maximum word count: 160 words

1)B.“After quitting his job as a quality control expert Jack is currently looking for a job. This is referred to as:”

a.Cyclical unemployment

b.Frictional unemployment

c.Structural unemployment

d.Classical unemployment

Maximum word count: 160 words

Essay: Who Did It Best?

Who do you believe to be the greatest artist of the Italian High Renaissance (16th century)?

Compose a minimum of 3 paragraphs: 300-word minimum

Limit your artist selection to the Italian High Renaissance only (16th century).

Begin with a thorough introduction and overview of the artist you select. Then provide a detailed analysis of why you believe this artist is the greatest. In support of your stance, include a minimum of three of the artist's works, providing titles and descriptions. This may require some basic research on your part. Convince me!

Excellent (50 points)    All requirements met and you did exactly what was asked of you (including proper grammar, spelling, paragraph and word count).

Write a method named minimumValue, which returns the smallest value in an array that is passed (in) as an argument. The method must use Recursion to find the smallest value. Demonstrate the method in a full program, which does not have to be too long regarding the entire code (i.e. program). Write (paste) the Java code in this word file (.docx) that is provided. (You can use additional pages if needed, and make sure your name is on every page in this word doc.) Use the following array to test the method: int[] seriesArray = {-5, -10, +1999, +99, +100, +3, 0, +9, +300, -200, +1, -300} Make sure that the seriesArray only tests for values, which are positive, given your recursive method.

C++ Lexicographical Sorting

Given a file of unsorted words with mixed case: read the entries in the file and sort those words lexicographically. The program should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words.

You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat."

For example, if the array contains ten words and the contents are

cat Rat bat Mat SAT Vat Hat pat TAT eat

after sorting, the word at index 6 is Rat

You are encouraged to use this data to test your program.

1.

Test Company reported the following income statement for the most recent period.

Determine the breakeven point in units.

Note: Give your answer using commas. Do not include the word “units.”

Example: 12,345

2. Determine the number of units Test Company must sell to earn operating income of $20,000. Note: Give your answer using commas. Do not include the word “units.”

3.

Determine the breakeven point in dollars.

Note: Give your answer using dollar signs and commas but not decimal points (cents).

Example: $12,345

4.

Determine the sales revenue Test Company must generate to earn operating income of $30,000.

Note: Give your answer using dollar signs and commas but not decimal points (cents).

5.

Determine the margin of safety in dollars.

Note: Give your answer using dollar signs and commas but not decimal points (cents).

6.

Determine the margin of safety in units.

Note: Give your answer using commas. Do not include the word “units.”

Example: 12,345

7.

Test Company’s sales manager proposed holding a Holiday Sale. Prices would be discounted 5% and an additional $1,000 would be used for advertising to promote the event. Determine the number of units Test Company must sell during the promotion to continue earning $18,000.

Note: Give your answer using commas. Do not include the word “units.”

Example: 12,345

8.

Test Company reported sales of $250,000, variable expenses of $190,000 and fixed expenses of $48,000. Determine the sales revenue needed to break even.

Note: Give your answer using dollar signs and commas but not decimal points (cents).

Example: $12,345

​

class Arrays1{

public int getSumOfValues(int[] arr){
// return the sum of values of array elements
int sum = 0;
int i;
for(i = 0; i < arr.length; i++){
sum += arr[1];
}
return sum;
}
public int getAverageValueInArray(int[] arr){
// return the average value of array elements
int value = 0;
for(int i = 0; i < arr.length; i++){
double average = value/ arr.length;
}
return value;
}
public int getNumberOfEvens(int[] arr){
//return the number of even values found in the array
int even = 0;
for(int i = 0; i < arr.length; i++){
if(i % 2 == 0){
}
}
return even;
}
public int getNumberOfOdds(int[] arr){
// return the number of odd vsalues found in the array
int odd = 0;
for(int i = 0; i < arr.length; i++){
if(i % 2 != 0){
}
}
return odd;
}
public int maxValue(int[] arr){
// return max value in array
int maxValue = arr[0];
for(int i = 1; i < arr.length; i++){
if(arr[i] > maxValue){
maxValue = arr[i];
}
}
return maxValue;
}
public int minValue(int[] arr){
// return min value in array
int minValue = arr[0];
for(int i = 1; i < arr.length; i++){
if(arr[i] < minValue){
minValue = arr[i];
}
}
return minValue;
}
public boolean arrayContainsWord(String[] arr, String word){
// return true if array contains specific word, false otherwise
for(int i = 0; i < arr.length; i++){
if(arr[i].equals(word));
return true;
}
return false;
}
public int getIndexOfWord(String[] arr, String word){
// if found, return the index of word, otherwise return -1
for(int i = 0; i < arr.length; i++){
if(arr[i].equals(word)){
return i;
}
}
return -1;
}
public boolean areArrays(int[] arr1, int[] arr2){
// 1. initial check: both arrays need to have the same length, return false if not the same
// 2. return true if both given arrats are equals(same values in the same indices), false otherwise
if(arr1.length != arr2.length){
return false;
}
for(int i = 0; i < arr1.length; i++){
if(arr1[i] != arr2[i]){

}
}
return true;
}
public boolean areArraysEqual(String[] arr1, String[] arr2){
// 1. initial check: both arrays need to have the same length, return false if not the same
// 2. return true if both given arrays are equals(same values in the same indices), false otherwise
if(arr1.length != arr2.length){
return false;
}
for(int i = 0; i < arr1.length; i++){
if(arr1[i].equals(arr2[i])){

}
}
return false;
}
}

Write ArraysDriver (similar design to LoopsDriver):

• Write an infinite loop which does the following
  • Prints a menu of 11 options (0 to exit)
  • Asks the user which method to call
  • Calls the method and prints out the answer

In this assignment, you will pass arrays as arguments to these methods. You may declare and initialize these arrays before the loop and reuse them throughout your application. For this assignment, use arrays of 5 elements. You will need 2 int[] arrays and 2 String[] arrays to be declared and initialized before the main loop. You may use arbitrary values for each item/element in the arrays.

The only input you will need from the user (other than the menu option selected) is a word to use for arrayContainsWord and getIndexOfWord.

1. Read previously created binary file using ObjectInputStream
2. Create an appropriate instance of HashMap from Java library
3. Populate the HashMap with data from binary file
4. Display the information read in a user friendly format

Problem:

Given: Words.dat – a binary file consisting of all the words in War and Peace

Goal: Read the words in from the binary file and figure out how many times each word appears in the file. Display the results to the user.

Use a HashMap with the word as a key (String) and an Integer as the value.   For each word, first check to see if it already exists in the Map. If not, add the word as key with a value of 1 for the Integer value.

If it does, get the current value and increment by 1 – replace the old key,value with the new key, value.

After all the words are processed and the HashMap is complete. Iterate through the Hash map and display the results in a user -friendly fashion. Tell me which option you chose in the Assignment box when you submit the homework

Display Options: (Choose one not all)

1. Create an easy to read table and print to the console. Hint: Use tabs (/t) (values are not from file)

Example:

Word                     Count

A                             190

Apple                    6

Etc

2. Display on a Java FX Gui – use ListView for the Words and click to see count

C. Create a text file with the data formatted similar to the console

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.ObjectOutputStream;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
* This file is intended to show how the binary file words.dat was created

*This is not intended to be used only to
* demonstrate how the file was written so it can be read properly

*cjohns25
*/
public class CreateBinaryFile
{

   public static void main(String[] args)
   {
       // step 1 - read in all the words from war and peace into an arrayList
       ArrayList words = new ArrayList();
       Scanner in;
       try
       {
           in = new Scanner(new File("war-and-peace.txt"));

           // Use any characters other than a-z or A-Z as delimiters
           in.useDelimiter("[^a-zA-Z]+");
           while (in.hasNext())
           {
               words.add(in.next().toLowerCase());
           }
           in.close();
       } catch (FileNotFoundException e)
       {
           // TODO Auto-generated catch block
           e.printStackTrace();
       }

       // write to words.dat in binary format
       // open a binary file with ObjectOutputStream for writing
       try
       {
           // Create an output stream for file words.data
           ObjectOutputStream output = new ObjectOutputStream(new FileOutputStream("words.dat", true));

           // Write arrayList to the object output stream one string at a time
           for (String w : words)
           {
               output.writeObject(w);
           }

           output.close();

       } catch (Exception e)
       {
           e.printStackTrace(); // provide this to see where problem occurred
           System.out.println("Problem encountered writing file"); // provide this for user
       }

   }
}

*My CODE*

import java.io.FileInputStream;
import java.io.ObjectInputStream;
import java.util.HashMap;

public class HashMapWords {
public static void main(String[] args) throws Exception {

HashMap<String, Integer> map = new HashMap<String, Integer>();
try (ObjectInputStream datFile = new ObjectInputStream(new FileInputStream("words.dat"))) {

while (true) {
try {
String key = datFile.readUTF();
if (!map.containsKey(key)) {
map.put(key, 0);
}
map.put(key, map.get(key) + 1);
} catch (Exception ex) {
break;
}
}
}

System.out.println("Word\t\tCount");

for (String key : map.keySet()) {
System.out.println(key + "\t\t" + map.get(key));
}
}

}

*OUTPUT*

Word Count

*HAVING TROUBLE MAKING THIS WORK REALLY NEED SOME HELP, TELL ME WHAT IM DOING WRONG. THANK YOU FOR THE HELP *