Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 2 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 27 Aug 2017 My Price 15.00

Threaded Sort Algorithm

Hello Sir, below is my home work that i will need help with. very urgent please

Application: Implementing and Analyzing a Threaded Sort Algorithm

Once a software application has been implemented and released, that is by no means the end of development. There are all kinds of causes requiring software to be changed, from users reporting bugs, through changes in third-party software, to updates for improved performance. A critical skill of software developers is the ability to understand and update a program’s algorithm.

For this Assignment, you will update an existing Java program using the NetBeans IDE. You will use the NetBeans Integrated Development Environment to make changes to an existing NetBeans Java Project. This existing program correctly sorts the data without using threads and contains a method(threadedSort) that you will update to sort the data using threads.

To prepare:

  • Read this week’s Resources.
  • Download and Install NetBeans:
    Visit the NetBeans download page from this week’s Resources. Download the Java SE bundle. (Note:Select the most recent release version, not a Beta version.)
    Run the downloaded package to install it. Choose the default options for installation.
  • Unzip and open the Unthreaded Program:
    Download and unzip the fileWeek2_Project.zip. This will create a folder containing a NetBeans Project with the non-threaded java program. Note the location of this folder.
    Launch the NetBeans IDE. Click theOpen Project...button(Or click theFiledrop-down menu and selectOpen Project…). Navigate to the project folder, select it, and clickOpen Project.
    The Java Project contains three class files:MergeSort.java,Sort.java, and SortTest.java.Double-click each file in theProjectsection (at the left of the NetBeans IDE window) to display the file’s contents. Each of the Java class files contains comments explaining the purpose of the class and the purpose of the class’ methods.

By Day 7, modify the Java program by adding threads, and analyze the performance of both the threaded and non-threaded versions.

  • Modify the Program:
    Improve the performance of the Java program by adding threads to theSort.javafile. Implement thethreadedSort()method within theSortclass. Reuse any of the existing methods by calling them as necessary from yourthreadedSortmethod. You may add additional methods to theSortclass, if necessary.
  • Analyze the Program:
    When running the providedSortTestprogram, the output presents data to support analyzing the performance of the threaded and non-threaded sort methods. Analyze your threaded implementation by comparing its performance to the original non-threaded implementation and explain the measured behavior. Document your analysis as a short paper (1–3 pages), using APA format. Be sure to discuss the relative performance improvement you expect for your threaded implementation and how the expected performance compares to the measured performance.

Answers

(5)
Status NEW Posted 27 Aug 2017 12:08 PM My Price 15.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)