Improve the performance of the Java program by adding threads to the Sort.java file. Implement the threadedSort() method within the Sort class. (Reuse any of the existing methods by calling them as necessary from your threadedSort method. You may add additional methods to the Sort class, if necessary.)
Document your analysis as a short paper (1 page).
Main File (sort.java):
001import java.io.BufferedReader;
002import java.io.File;
003import java.io.FileReader;
004import java.io.IOException;
005import java.util.ArrayList;
006import java.util.logging.Level;
007import java.util.logging.Logger;
008
009public class Sort {
010
011 /**
012 * You are to implement this method. The method should invoke one or
013 * more threads to read and sort the data from the collection of Files.
014 * The method should return a sorted list of all of the String data
015 * contained in the files.
016 *
017 * @param files
018 * @return
019 * @throws IOException
020 */
021 public static String[] threadedSort(File[] files) throws IOException
022 {
023 String[] sortedData = new String[0];
024 SortThread[] sortThreads = new SortThread[files.length];
025 for (int i=0; i
026 sortThreads[i] = new SortThread(files[i]);
027 sortThreads[i].start();
028 }
029
030 for (SortThread thread : sortThreads) {
031 try {
032 thread.join();
033 }
034 catch (InterruptedException ex){
035 Logger.getLogger(Sort.class.getName()).log(Level.SEVERE, null, ex);
036 }
037 return sortedData;
038 }
039 throw new java.lang.IllegalStateException(“Method not implemented”);
040 }
041
042 private static class SortThread extends Thread {
043 private File file;
044 private String[] data;
045
046
047 public SortThread(File file) {
048 this.file = file;
049 }
050
051 @Override
052 public void run() {
053 try {
054 data = Sort.getData(file);
055 for (int i = 0; i
056 //Thread.sleep(100);
057 //I commented this out because it was wasting time
058 //System.out.println(data[i]);
059 //I commented this out because I didn’t want to display the entire files
060 }
061 }
062 catch (IOException ex) {
063 Logger.getLogger (Sort.class.getName()).log(Level.SEVERE, null, ex);
064 }
065 }
066 }
067
068 /**
069 * Given an array of files, this method will return a sorted
070 * list of the String data contained in each of the files.
071 *
072 * @param files the files to be read
073 * @return the sorted data
074 * @throws IOException thrown if any errors occur reading the file
075 */
076 public static String[] sort(File[] files) throws IOException {
077
078 String[] sortedData = new String[0];
079
080 for (File file : files) {
081 String[] data = getData(file);
082 data = MergeSort.mergeSort(data);
083 sortedData = MergeSort.merge(sortedData, data);
084 }
085
086 return sortedData;
087
088 }
089 /**
090 * This method will read in the string data from the specified
091 * file and return the data as an array of String objects.
092 *
093 * @param file the file containing the String data
094 * @return String array containing the String data
095 * @throws IOException thrown if any errors occur reading the file
096 */
097 private static String[] getData(File file) throws IOException {
098
099 ArrayList data = new ArrayList();
100 BufferedReader in = new BufferedReader(new FileReader(file));
101 // Read the data from the file until the end of file is reached
102 while (true) {
103 String line = in.readLine();
104 if (line == null) {
105 // the end of file was reached
106 break;
107 }
108 else {
109 data.add(line);
110 }
111 }
112 //Close the input stream and return the data
113 in.close();
114 return data.toArray(new String[0]);
115
116 }
117}
Mergesort.java:
01public class MergeSort {
02
03 // The mergeSort method returns a sorted copy of the
04 // String objects contained in the String array data.
05 /**
06 * Sorts the String objects using the merge sort algorithm.
07 *
08 * @param data the String objects to be sorted
09 * @return the String objects sorted in ascending order
10 */
11 public static String[] mergeSort(String[] data) {
12
13 if (data.length > 1) {
14 String[] left = new String[data.length / 2];
15 String[] right = new String[data.length – left.length];
16 System.arraycopy(data, 0, left, 0, left.length);
17 System.arraycopy(data, left.length, right, 0, right.length);
18
19 left = mergeSort(left);
20 right = mergeSort(right);
21
22 return merge(left, right);
23
24 }
25 else {
26 return data;
27 }
28
29 }
30
31 /**
32 * The merge method accepts two String arrays that are assumed
33 * to be sorted in ascending order. The method will return a
34 * sorted array of String objects containing all String objects
35 * from the two input collections.
36 *
37 * @param left a sorted collection of String objects
38 * @param right a sorted collection of String objects
39 * @return a sorted collection of String objects
40 */
41 public static String[] merge(String[] left, String[] right) {
42
43 String[] data = new String[left.length + right.length];
44
45 int lIndex = 0;
46 int rIndex = 0;
47
48 for (int i=0; i
49 if (lIndex == left.length) {
50 data[i] = right[rIndex];
51 rIndex++;
52 }
53 else if (rIndex == right.length) {
54 data[i] = left[lIndex];
55 lIndex++;
56 }
57 else if (left[lIndex].compareTo(right[rIndex]) < 0) {
58 data[i] = left[lIndex];
59 lIndex++;
60 }
61 else {
62 data[i] = right[rIndex];
63 rIndex++;
64 }
65 }
66
67 return data;
68
69 }
70
71}
SortTest.java:
01import java.io.File;
02import java.io.IOException;
03
04/**
05 * The class SortTest is used to test the threaded and non-threaded
06 * sort methods. This program will call each method to sort the data
07 * contained in the four test files. This program will then test the
08 * results to ensure that the results are sorted in ascending order.
09 *
10 * Simply run this program to verify that you have correctly implemented
11 * the threaded sort method. The program will not verify if your sort
12 * uses threads, but will verify if your implementation correctly
13 * sorted the data contained in the four files.
14 *
15 * There should be no reason to make modifications to this class.
16 */
17public class SortTest {
18
19 public static void main(String[] args) throws IOException {
20
21 File[] files = {new File(“enable1.txt”), new File(“enable2k.txt”), newFile(“lower.txt”), new File(“mixed.txt”)};
22
23 // Run Sort.sort on the files
24 long startTime = System.nanoTime();
25 String[] sortedData = Sort.sort(files);
26 long stopTime = System.nanoTime();
27 double elapsedTime = (stopTime – startTime) / 1000000000.0;
28
29 // Test to ensure the data is sorted
30 for (int i=0; i
31 if (sortedData[i].compareTo(sortedData[i+1]) > 0) {
32 System.out.println(“The data returned by Sort.sort is not sorted.”);
33 throw new java.lang.IllegalStateException(“The data returned by Sort.sort is not sorted”);
34 }
35 }
36 System.out.println(“The data returned by Sort.sort is sorted.”);
37 System.out.println(“Sort.sort took ” + elapsedTime + ” seconds to read and sort the data.”);
38
39 // Run Sort.threadedSort on the files and test to ensure the data is sorted
40 startTime = System.nanoTime();
41 String[] threadSortedData = Sort.threadedSort(files);
42 stopTime = System.nanoTime();
43 double threadedElapsedTime = (stopTime – startTime)/ 1000000000.0;
44
45 // Test to ensure the data is sorted
46 if (sortedData.length != threadSortedData.length) {
47 System.out.println(“The data return by Sort.threadedSort is missing data”);
48 throw new java.lang.IllegalStateException(“The data returned by Sort.threadedSort is not sorted”);
49 }
50 for (int i=0; i
51 if (threadSortedData[i].compareTo(threadSortedData[i+1]) > 0) {
52 System.out.println(“The data return by Sort.threadedSort is not sorted”);
53 throw new java.lang.IllegalStateException(“The data returned by Sort.threadedSort is not sorted”);
54 }
55 }
56 System.out.println(“The data returned by Sort.threadedSort is sorted.”);
57 System.out.println(“Sort.threadedSort took ” + threadedElapsedTime + ” seconds to read and sort the data.”);
58
59
60 }
61
62}
The error am getting:
run:The data returned by Sort.sort is sorted.Sort.sort took 2.072120353 seconds to read and sort the data.The data return by Sort.threadedSort is missing dataException in thread “main” java.lang.IllegalStateException: The data returned by Sort.threadedSort is not sortedat SortTest.main(SortTest.java:49)Java Result: 1BUILD SUCCESSFUL (total time: 3 seconds)
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improve The Performance Of The Java Program By Adding Threads To The Sort Java F 1
/in Uncategorized /by developerImprove the performance of the Java program by adding threads to the Sort.java file. Implement the threadedSort() method within the Sort class. (Reuse any of the existing methods by calling them as necessary from your threadedSort method. You may add additional methods to the Sort class, if necessary.)
Document your analysis as a short paper (1 page).
Main File (sort.java):
001import java.io.BufferedReader;
002import java.io.File;
003import java.io.FileReader;
004import java.io.IOException;
005import java.util.ArrayList;
006import java.util.logging.Level;
007import java.util.logging.Logger;
008
009public class Sort {
010
011 /**
012 * You are to implement this method. The method should invoke one or
013 * more threads to read and sort the data from the collection of Files.
014 * The method should return a sorted list of all of the String data
015 * contained in the files.
016 *
017 * @param files
018 * @return
019 * @throws IOException
020 */
021 public static String[] threadedSort(File[] files) throws IOException
022 {
023 String[] sortedData = new String[0];
024 SortThread[] sortThreads = new SortThread[files.length];
025 for (int i=0; i
026 sortThreads[i] = new SortThread(files[i]);
027 sortThreads[i].start();
028 }
029
030 for (SortThread thread : sortThreads) {
031 try {
032 thread.join();
033 }
034 catch (InterruptedException ex){
035 Logger.getLogger(Sort.class.getName()).log(Level.SEVERE, null, ex);
036 }
037 return sortedData;
038 }
039 throw new java.lang.IllegalStateException(“Method not implemented”);
040 }
041
042 private static class SortThread extends Thread {
043 private File file;
044 private String[] data;
045
046
047 public SortThread(File file) {
048 this.file = file;
049 }
050
051 @Override
052 public void run() {
053 try {
054 data = Sort.getData(file);
055 for (int i = 0; i
056 //Thread.sleep(100);
057 //I commented this out because it was wasting time
058 //System.out.println(data[i]);
059 //I commented this out because I didn’t want to display the entire files
060 }
061 }
062 catch (IOException ex) {
063 Logger.getLogger (Sort.class.getName()).log(Level.SEVERE, null, ex);
064 }
065 }
066 }
067
068 /**
069 * Given an array of files, this method will return a sorted
070 * list of the String data contained in each of the files.
071 *
072 * @param files the files to be read
073 * @return the sorted data
074 * @throws IOException thrown if any errors occur reading the file
075 */
076 public static String[] sort(File[] files) throws IOException {
077
078 String[] sortedData = new String[0];
079
080 for (File file : files) {
081 String[] data = getData(file);
082 data = MergeSort.mergeSort(data);
083 sortedData = MergeSort.merge(sortedData, data);
084 }
085
086 return sortedData;
087
088 }
089 /**
090 * This method will read in the string data from the specified
091 * file and return the data as an array of String objects.
092 *
093 * @param file the file containing the String data
094 * @return String array containing the String data
095 * @throws IOException thrown if any errors occur reading the file
096 */
097 private static String[] getData(File file) throws IOException {
098
099 ArrayList data = new ArrayList();
100 BufferedReader in = new BufferedReader(new FileReader(file));
101 // Read the data from the file until the end of file is reached
102 while (true) {
103 String line = in.readLine();
104 if (line == null) {
105 // the end of file was reached
106 break;
107 }
108 else {
109 data.add(line);
110 }
111 }
112 //Close the input stream and return the data
113 in.close();
114 return data.toArray(new String[0]);
115
116 }
117}
Mergesort.java:
01public class MergeSort {
02
03 // The mergeSort method returns a sorted copy of the
04 // String objects contained in the String array data.
05 /**
06 * Sorts the String objects using the merge sort algorithm.
07 *
08 * @param data the String objects to be sorted
09 * @return the String objects sorted in ascending order
10 */
11 public static String[] mergeSort(String[] data) {
12
13 if (data.length > 1) {
14 String[] left = new String[data.length / 2];
15 String[] right = new String[data.length – left.length];
16 System.arraycopy(data, 0, left, 0, left.length);
17 System.arraycopy(data, left.length, right, 0, right.length);
18
19 left = mergeSort(left);
20 right = mergeSort(right);
21
22 return merge(left, right);
23
24 }
25 else {
26 return data;
27 }
28
29 }
30
31 /**
32 * The merge method accepts two String arrays that are assumed
33 * to be sorted in ascending order. The method will return a
34 * sorted array of String objects containing all String objects
35 * from the two input collections.
36 *
37 * @param left a sorted collection of String objects
38 * @param right a sorted collection of String objects
39 * @return a sorted collection of String objects
40 */
41 public static String[] merge(String[] left, String[] right) {
42
43 String[] data = new String[left.length + right.length];
44
45 int lIndex = 0;
46 int rIndex = 0;
47
48 for (int i=0; i
49 if (lIndex == left.length) {
50 data[i] = right[rIndex];
51 rIndex++;
52 }
53 else if (rIndex == right.length) {
54 data[i] = left[lIndex];
55 lIndex++;
56 }
57 else if (left[lIndex].compareTo(right[rIndex]) < 0) {
58 data[i] = left[lIndex];
59 lIndex++;
60 }
61 else {
62 data[i] = right[rIndex];
63 rIndex++;
64 }
65 }
66
67 return data;
68
69 }
70
71}
SortTest.java:
01import java.io.File;
02import java.io.IOException;
03
04/**
05 * The class SortTest is used to test the threaded and non-threaded
06 * sort methods. This program will call each method to sort the data
07 * contained in the four test files. This program will then test the
08 * results to ensure that the results are sorted in ascending order.
09 *
10 * Simply run this program to verify that you have correctly implemented
11 * the threaded sort method. The program will not verify if your sort
12 * uses threads, but will verify if your implementation correctly
13 * sorted the data contained in the four files.
14 *
15 * There should be no reason to make modifications to this class.
16 */
17public class SortTest {
18
19 public static void main(String[] args) throws IOException {
20
21 File[] files = {new File(“enable1.txt”), new File(“enable2k.txt”), newFile(“lower.txt”), new File(“mixed.txt”)};
22
23 // Run Sort.sort on the files
24 long startTime = System.nanoTime();
25 String[] sortedData = Sort.sort(files);
26 long stopTime = System.nanoTime();
27 double elapsedTime = (stopTime – startTime) / 1000000000.0;
28
29 // Test to ensure the data is sorted
30 for (int i=0; i
31 if (sortedData[i].compareTo(sortedData[i+1]) > 0) {
32 System.out.println(“The data returned by Sort.sort is not sorted.”);
33 throw new java.lang.IllegalStateException(“The data returned by Sort.sort is not sorted”);
34 }
35 }
36 System.out.println(“The data returned by Sort.sort is sorted.”);
37 System.out.println(“Sort.sort took ” + elapsedTime + ” seconds to read and sort the data.”);
38
39 // Run Sort.threadedSort on the files and test to ensure the data is sorted
40 startTime = System.nanoTime();
41 String[] threadSortedData = Sort.threadedSort(files);
42 stopTime = System.nanoTime();
43 double threadedElapsedTime = (stopTime – startTime)/ 1000000000.0;
44
45 // Test to ensure the data is sorted
46 if (sortedData.length != threadSortedData.length) {
47 System.out.println(“The data return by Sort.threadedSort is missing data”);
48 throw new java.lang.IllegalStateException(“The data returned by Sort.threadedSort is not sorted”);
49 }
50 for (int i=0; i
51 if (threadSortedData[i].compareTo(threadSortedData[i+1]) > 0) {
52 System.out.println(“The data return by Sort.threadedSort is not sorted”);
53 throw new java.lang.IllegalStateException(“The data returned by Sort.threadedSort is not sorted”);
54 }
55 }
56 System.out.println(“The data returned by Sort.threadedSort is sorted.”);
57 System.out.println(“Sort.threadedSort took ” + threadedElapsedTime + ” seconds to read and sort the data.”);
58
59
60 }
61
62}
The error am getting:
run:The data returned by Sort.sort is sorted.Sort.sort took 2.072120353 seconds to read and sort the data.The data return by Sort.threadedSort is missing dataException in thread “main” java.lang.IllegalStateException: The data returned by Sort.threadedSort is not sortedat SortTest.main(SortTest.java:49)Java Result: 1BUILD SUCCESSFUL (total time: 3 seconds)
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improve The Performance Of The Java Program By Adding Threads To The Sort Java F 2
/in Uncategorized /by developerImprove the performance of the Java program by adding threads to the Sort.java file. Implement the threadedSort() method within the Sort class. (Reuse any of the existing methods by calling them as necessary from your threadedSort method. You may add additional methods to the Sort class, if necessary.)
Document your analysis as a short paper (1 page).
Main File (sort.java):
001import java.io.BufferedReader;
002import java.io.File;
003import java.io.FileReader;
004import java.io.IOException;
005import java.util.ArrayList;
006import java.util.logging.Level;
007import java.util.logging.Logger;
008
009public class Sort {
010
011 /**
012 * You are to implement this method. The method should invoke one or
013 * more threads to read and sort the data from the collection of Files.
014 * The method should return a sorted list of all of the String data
015 * contained in the files.
016 *
017 * @param files
018 * @return
019 * @throws IOException
020 */
021 public static String[] threadedSort(File[] files) throws IOException
022 {
023 String[] sortedData = new String[0];
024 SortThread[] sortThreads = new SortThread[files.length];
025 for (int i=0; i
026 sortThreads[i] = new SortThread(files[i]);
027 sortThreads[i].start();
028 }
029
030 for (SortThread thread : sortThreads) {
031 try {
032 thread.join();
033 }
034 catch (InterruptedException ex){
035 Logger.getLogger(Sort.class.getName()).log(Level.SEVERE, null, ex);
036 }
037 return sortedData;
038 }
039 throw new java.lang.IllegalStateException(“Method not implemented”);
040 }
041
042 private static class SortThread extends Thread {
043 private File file;
044 private String[] data;
045
046
047 public SortThread(File file) {
048 this.file = file;
049 }
050
051 @Override
052 public void run() {
053 try {
054 data = Sort.getData(file);
055 for (int i = 0; i
056 //Thread.sleep(100);
057 //I commented this out because it was wasting time
058 //System.out.println(data[i]);
059 //I commented this out because I didn’t want to display the entire files
060 }
061 }
062 catch (IOException ex) {
063 Logger.getLogger (Sort.class.getName()).log(Level.SEVERE, null, ex);
064 }
065 }
066 }
067
068 /**
069 * Given an array of files, this method will return a sorted
070 * list of the String data contained in each of the files.
071 *
072 * @param files the files to be read
073 * @return the sorted data
074 * @throws IOException thrown if any errors occur reading the file
075 */
076 public static String[] sort(File[] files) throws IOException {
077
078 String[] sortedData = new String[0];
079
080 for (File file : files) {
081 String[] data = getData(file);
082 data = MergeSort.mergeSort(data);
083 sortedData = MergeSort.merge(sortedData, data);
084 }
085
086 return sortedData;
087
088 }
089 /**
090 * This method will read in the string data from the specified
091 * file and return the data as an array of String objects.
092 *
093 * @param file the file containing the String data
094 * @return String array containing the String data
095 * @throws IOException thrown if any errors occur reading the file
096 */
097 private static String[] getData(File file) throws IOException {
098
099 ArrayList data = new ArrayList();
100 BufferedReader in = new BufferedReader(new FileReader(file));
101 // Read the data from the file until the end of file is reached
102 while (true) {
103 String line = in.readLine();
104 if (line == null) {
105 // the end of file was reached
106 break;
107 }
108 else {
109 data.add(line);
110 }
111 }
112 //Close the input stream and return the data
113 in.close();
114 return data.toArray(new String[0]);
115
116 }
117}
Mergesort.java:
01public class MergeSort {
02
03 // The mergeSort method returns a sorted copy of the
04 // String objects contained in the String array data.
05 /**
06 * Sorts the String objects using the merge sort algorithm.
07 *
08 * @param data the String objects to be sorted
09 * @return the String objects sorted in ascending order
10 */
11 public static String[] mergeSort(String[] data) {
12
13 if (data.length > 1) {
14 String[] left = new String[data.length / 2];
15 String[] right = new String[data.length – left.length];
16 System.arraycopy(data, 0, left, 0, left.length);
17 System.arraycopy(data, left.length, right, 0, right.length);
18
19 left = mergeSort(left);
20 right = mergeSort(right);
21
22 return merge(left, right);
23
24 }
25 else {
26 return data;
27 }
28
29 }
30
31 /**
32 * The merge method accepts two String arrays that are assumed
33 * to be sorted in ascending order. The method will return a
34 * sorted array of String objects containing all String objects
35 * from the two input collections.
36 *
37 * @param left a sorted collection of String objects
38 * @param right a sorted collection of String objects
39 * @return a sorted collection of String objects
40 */
41 public static String[] merge(String[] left, String[] right) {
42
43 String[] data = new String[left.length + right.length];
44
45 int lIndex = 0;
46 int rIndex = 0;
47
48 for (int i=0; i
49 if (lIndex == left.length) {
50 data[i] = right[rIndex];
51 rIndex++;
52 }
53 else if (rIndex == right.length) {
54 data[i] = left[lIndex];
55 lIndex++;
56 }
57 else if (left[lIndex].compareTo(right[rIndex]) < 0) {
58 data[i] = left[lIndex];
59 lIndex++;
60 }
61 else {
62 data[i] = right[rIndex];
63 rIndex++;
64 }
65 }
66
67 return data;
68
69 }
70
71}
SortTest.java:
01import java.io.File;
02import java.io.IOException;
03
04/**
05 * The class SortTest is used to test the threaded and non-threaded
06 * sort methods. This program will call each method to sort the data
07 * contained in the four test files. This program will then test the
08 * results to ensure that the results are sorted in ascending order.
09 *
10 * Simply run this program to verify that you have correctly implemented
11 * the threaded sort method. The program will not verify if your sort
12 * uses threads, but will verify if your implementation correctly
13 * sorted the data contained in the four files.
14 *
15 * There should be no reason to make modifications to this class.
16 */
17public class SortTest {
18
19 public static void main(String[] args) throws IOException {
20
21 File[] files = {new File(“enable1.txt”), new File(“enable2k.txt”), newFile(“lower.txt”), new File(“mixed.txt”)};
22
23 // Run Sort.sort on the files
24 long startTime = System.nanoTime();
25 String[] sortedData = Sort.sort(files);
26 long stopTime = System.nanoTime();
27 double elapsedTime = (stopTime – startTime) / 1000000000.0;
28
29 // Test to ensure the data is sorted
30 for (int i=0; i
31 if (sortedData[i].compareTo(sortedData[i+1]) > 0) {
32 System.out.println(“The data returned by Sort.sort is not sorted.”);
33 throw new java.lang.IllegalStateException(“The data returned by Sort.sort is not sorted”);
34 }
35 }
36 System.out.println(“The data returned by Sort.sort is sorted.”);
37 System.out.println(“Sort.sort took ” + elapsedTime + ” seconds to read and sort the data.”);
38
39 // Run Sort.threadedSort on the files and test to ensure the data is sorted
40 startTime = System.nanoTime();
41 String[] threadSortedData = Sort.threadedSort(files);
42 stopTime = System.nanoTime();
43 double threadedElapsedTime = (stopTime – startTime)/ 1000000000.0;
44
45 // Test to ensure the data is sorted
46 if (sortedData.length != threadSortedData.length) {
47 System.out.println(“The data return by Sort.threadedSort is missing data”);
48 throw new java.lang.IllegalStateException(“The data returned by Sort.threadedSort is not sorted”);
49 }
50 for (int i=0; i
51 if (threadSortedData[i].compareTo(threadSortedData[i+1]) > 0) {
52 System.out.println(“The data return by Sort.threadedSort is not sorted”);
53 throw new java.lang.IllegalStateException(“The data returned by Sort.threadedSort is not sorted”);
54 }
55 }
56 System.out.println(“The data returned by Sort.threadedSort is sorted.”);
57 System.out.println(“Sort.threadedSort took ” + threadedElapsedTime + ” seconds to read and sort the data.”);
58
59
60 }
61
62}
The error am getting:
run:The data returned by Sort.sort is sorted.Sort.sort took 2.072120353 seconds to read and sort the data.The data return by Sort.threadedSort is missing dataException in thread “main” java.lang.IllegalStateException: The data returned by Sort.threadedSort is not sortedat SortTest.main(SortTest.java:49)Java Result: 1BUILD SUCCESSFUL (total time: 3 seconds)
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improve This Paper
/in Uncategorized /by developerImprove this paper.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improved Dialogue With Customers Fewer Customer Complaints Improved Complaint Re
/in Uncategorized /by developerImproved Dialogue with Customers Fewer customer complaints Improved complaint resolution Key Elements of Quality Professional Selling? Everyone is a Salesperson…Agree or disagree, Why? Likes/Dislikes about Salespeople? Consumers are Rational and Sovereign Assumptions…Comment, How Would this Affect Salespeople Doing their Jobs? Describe Types of Selling Presented in this Chapter, How are they Different? How are they Similar? Why are You Interested in the Sales Engineer Position? What Does it Take to be Successful in Sales? NOT “I work hard” Knowledge Building Case Understanding of what the Customer Values? 3 things of Value in a Notebook Computer? Difference between Price and Value? Organization Culture/Climate Roar of Technological Innovation Is Our Sales Force Current? Is Organization And Individual Performance Satisfactory?
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improvement Hit Rate Cache Access Time Average Memory Access Time Increase Cache
/in Uncategorized /by developerFor each of the cache modifications that we could perform, select whether it will increase, decrease, have no effect, or have an unknown effect on the parameter.
ImprovementHit RateCache Access Time*Average Memory Access TimeIncrease Cache*[ Select ][ Select ]#[ Select ]Size ( C )Increase[ Select ][ Select ][ Select ]Associativety ( k)Increase Block[ Select ][ Select ][ Select ]Size ( b)Use Multilevel[ Select ![ Select ][ Select ]Caching*
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improving Data Governance Effective Information Management And Data Governance A
/in Uncategorized /by developerImproving Data Governance
Effective information management and data governance are invaluable to an organization. For this assignment, first explain the concept of data governance and its importance within an organization. Then, identify two organizations that have benefited from implementing a technology that improved their data governance. Briefly describe both organizations and then answer these questions for each:
Your well-written report should be 4-5 pages in length, not including the cover and reference pages. Use Saudi Electronic University academic writing standards and APA style guidelines, citing at least two scholarly references in support of your work, in addition to your text and assigned readings.
Required
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improving Decision Making Using Database Software To Design A Customer System Fo
/in Uncategorized /by developerImproving Decision Making: Using Database Software to Design a Customer System for Auto Sales Software skills: Database design, querying, reporting, and forms Business skills: Sales lead and customer analysis This project requires you to perform a systems analysis and then design a system solution using database software. Ace Auto Dealers specializes in selling new vehicles from Subaru. The company advertises in local newspapers and is also listed as an authorized dealer on the Subaru Web site and other major auto-buyer Web sites. The company benefits from a good local word-of-mouth reputation and name recognition and is a leading source of information for Subaru vehicles in the Halifax area. When a prospective customer enters the showroom, he or she is greeted by an Ace sales representative. The sales representative manually fills out a form with information such as the prospective customer’s name, address, telephone number, date of visit, and make and model of the vehicle in which the customer is interested. The representative also asks where the prospect heard about Ace—whether it was from a newspaper ad, the Web, or word of mouth—and this information is also noted on the form. If the customer decides to purchase an auto, the dealer fills out a bill of sale. However, Ace does not believe it has enough information about its customers. It cannot easily determine which prospects have made auto purchases, nor can it identify which customer touch points have produced the greatest number of sales leads or actual sales so it can focus advertising and marketing more on the channels that generate the most revenue. Are purchasers discovering Ace from newspaper ads, from word of mouth, or from the Web? Prepare a systems analysis report detailing Ace’s problem and a system solution that can be implemented using PC database management software. The company has a PC with Internet access and the full suite of Microsoft Office desktop productivity tools. Then use database software to develop a simple system solution. Your systems analysis report should include the following: • Description of the problem and its organizational and business impact • Proposed solution, solution objectives, and solution feasibility • Costs and benefits of the solution you have selected • Information requirements to be addressed by the solution • Management, organization, and technology issues to be addressed by the solution, including changes in business processes On the basis of the requirements you have identified, design the database, and populate it with at least 10 records per table. Consider whether you can use or modify Ace’s existing customer database in your design. Then use the system you have created to generate queries and reports that would be most useful to management. Create several prototype data input forms for the system and review them with your instructor. Then revise the prototypes.
ACE COMPANY DATABASE IN DECISION MAKING 1 ACE COMPANY DATABASE IN DECISION MAKINGNAME OF SCHOOLCOURSE NAME AND NUMBERNAME OF STUDENTPROFESSOR’S NAMEDATE Running Head: ACE COMPANY DATABASE IN…
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improving Population Healthletter To The Editor There Are Mechanisms In Place Th
/in Uncategorized /by developerImproving Population Health—Letter to the Editor
There are mechanisms in place that are used to improve population health, including (1) health statuses and outcomes, (2) determinant factors, and (3) interventions that address determinant factors and improve outcomes (Joshi et al., 2014 p. 549). How health care is provided and how it can be improved is the focus of this assignment, which lends itself to a perfect opportunity for you to put your analysis skills into practice. The Learning Resources section this week provides you with data from the patient experience of care that also sheds light on expectations that have and have not been met. The Healthy People 2020 data provides measurements and goals for health care into the future, along with reasons for achieving those goals.
For this Assignment, read a scenario, analyze an existing problem using the data/resources provided, and make recommendations to address the issues.
The Assignment:
Scenario:
The community of Springfield (population approximately 100,000) is made up of hardworking, mostly older, factory laborers who contributed to both the city and county growth from the late 1950s through early 2005. Since the plant closed, many of the former workers have little to look forward to. There are few jobs available and they are now aging; most are 60 years of age or older.
The Memorial Hospital has been in existence since the mid-1950s and has several primary care physicians and nurse practitioners, a couple of general surgeons, and one cardiologist, but no cardiac surgeons.
Many nurses are recruited from the nearby community college, and the hospital serves as the facility for clinical rounds in their education.
The community is pretty sedentary, with the exception of an occasional game of horseshoes. Cigarette smoking is prominent.
Serious concerns surround the continued existence of the hospital because many residents seek and obtain health care services elsewhere.
Compare the population of this city to other problem areas using the Healthy People sources. The town’s population is approximately 100,000, making the comparison fairly straightforward.
Letter to the Editor of the local paper that includes:
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
Improving Working Capital Prior To Completing This Discussion Read Chapters 19 2
/in Uncategorized /by developerImproving Working Capital
Prior to completing this discussion, read Chapters 19, 21, 22, 23 in your course text. For your initial post, answer the following questions:
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
In Robbins Franchise Q Is This Baskin Robbins Franchise A Good Fit For You
/in Uncategorized /by developerThe franchise Alternative
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"