(5/5)

# CMSC 451 Project 1 Solved The first project involves benchmarking the behavior of Java implementations of one of the following sorting algorithms bubble sort selection sort insertion sort Shell sort, merge sort quick sort or heap sort

INSTRUCTIONS TO CANDIDATES
`CMSC 451 Project 1The first project involves benchmarking the behavior of Java implementations of one of thefollowing sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort,quick sort or heap sort. You must post your selection in the "Ask the Professor" conference. Nomore than five students may select any one algorithm.You must write the code to perform the benchmarking of the algorithm you selected. Yourprogram must include both an iterative and recursive version of the algorithm. You do not haveto write the sorting algorithms yourself, you may take them from some source, but you mustreference your source.You must identify some critical operation to count that reflects the overall performance andmodify each version so that it counts that operation. In addition to counting critical operationsyou must measure the actual run time.In addition, you should examine the result of each call to verify that the data has been properlysorted to verify the correctness of the algorithm. If the array is not sorted, an exception should bethrown.It should also randomly generate data to pass to the sorting methods. It should produce 50 datasets for each value of n, the size of the data set and average the result of those 50 runs. The exactsame data must be used for the iterative and the recursive algorithms. It should also create 10different sizes of data sets. Choose sizes that will clearly demonstrate the trend as n becomeslarge.You should also calculate the coefficient of variance of the critical operation counts and timemeasurement for the 50 runs of each data set size as a way to gauge the data sensitivity of thealgorithm.Your program must be written to conform to the following design:Your output should look at follows:DataSetSize nIterative RecursiveAverageCriticalOperationCountCoefficient ofVariance ofCountAverageExecutionTimeCoefficient ofVariance ofTimeAverageCriticalOperationCountCoefficient ofVariance ofCountAverageExecutionTimeCoefficient ofVariance ofTime100200The data set sizes above are examples. You are to select the actual data set sizes. On the due datefor project 1, you are to submit a .zip file that includes the source code of your completeprogram. All the classes should be in the default package.You must research the issue of JVM warm-up necessary for properly benchmarking Javaprograms and ensure that your code performs the necessary warm-up so the time measurementsare accurate.Grading RubricCriteria Meets Does Not Meet100 points 0 pointsDesign20 points 0 pointsImplemented the required design (20) Did not implement the required design(0)Input20 points 0 pointsCreated 10 different sizes of data sets(10)Did not create 10 different sizes of datasets (0)Produced 50 data sets for each value ofn (10)Did not produce 50 data sets for eachvalue of n (0)Sorting AlgorithmBenchmarkCalculations35 points 0 pointsCorrectly averaged the count and timeresults of the 50 data sets (10)Did not correctly average the countand time results of the 50 data setsCalculated the coefficient of varianceof the critical operation counts andtime measurement (5)Did not calculate the coefficient ofvariance of the critical operationcounts and time measurement (0)Included correct sorting algorithm andcode to verify data was properly sorted(10)Did not Include correct sortingalgorithm and code to verify data wasproperly sorted (0)Performed the necessary warm-up sothe time measurements were accurate(10)Did not perform the necessary warmup so the time measurements wereaccurate (0)Output25 points 0 pointsOutput all the required data (15) Did not output all the required data (0)Output displayed in the requiredformat (10)Output not displayed in the requiredformat (0)`
(5/5)

## Related Questions

##### . Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

##### . The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

##### . Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

##### . SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

##### . Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Hire Me

Hire Me