PDF Archive

Easily share your PDF documents with your contacts, on the Web and Social Networks.

Send a file File manager PDF Toolbox Search Help Contact



UOP ECET 370 Week 4 Lab 4 .pdf


Original filename: UOP ECET 370 Week 4 Lab 4 .pdf
Author: LENOVO

This PDF 1.5 document has been generated by Microsoft® Office Word 2007, and has been sent on pdf-archive.com on 04/04/2016 at 10:00, from IP address 43.224.x.x. The current document download page has been viewed 193 times.
File size: 311 KB (2 pages).
Privacy: public file




Download original PDF file









Document preview


UOP ECET 370 Week 4 Lab 4 Complexity of
Computational Problems

Check this A+ tutorial guideline at

http://www.assignmentcloud.com/ecet370/ecet-370-week-4-lab-4-complexity-ofcomputational-problems

For more classes visit
http://www.assignmentcloud.com
General Instructions
Exercise 1 uses the programs in DocSharinglabeled “Minimum," “Factorial,” and
“Sorting algorithms."
Exercise 1: Review of the Lecture Contents Create projects using the classes in the
DocSharing areas labeled “Minimum," “Factorial,” and “Sorting algorithms." Compile
them, run them, and review the code that is given carefully. These programs test the
code discussed in the lecture.
Exercise 2: Efficiency of Algorithms Problem 2 in the Section “Projects” at the end of
Chapter 9 in the textbook: find a value of n for which Loop B is faster.
Exercise 3: Recursion Problem 1 in the Section “Projects” at the end of Chapter 10 in
the textbook: recursive algorithm to find the square root of a given number.

Exercise 4: Sorting In this week’s lecture, the algorithms quicksort and bubblesort
are described and implemented. In DocSharing, under the section labeled “Sorting
algorithms," you can find the class ArrayList where these sorting algorithms are
implemented. Write a Java program that times both of them for various values of n.
Create a table to record the times. Regarding the efficiency of both sorting methods,
what conclusion can be reached from this experiment? Note: You can probably save
development time by using the program from Week 2 to generate a list of the 1000
smallest prime numbers (in random order). This list could then be used as the input
to the sorting algorithms.


UOP ECET 370 Week 4 Lab 4 .pdf - page 1/2
UOP ECET 370 Week 4 Lab 4 .pdf - page 2/2

Related documents


PDF Document uop ecet 370 week 4 lab 4
PDF Document ecet 370 week 4 lab 4 complexity of computational problems
PDF Document ecet 370 week 5 lab 5 search algorithms and techniques
PDF Document uop ecet 370 week 5 lab 5 search algorithms and techniques
PDF Document ecet 370 week 7 lab 7 binary trees
PDF Document uop ecet 370 week 7 lab 7 binary trees


Related keywords