Data structure HW ASAP

Due 8/31/2016

1. List the following function in increasing order:

 log, !, log  ,  

1. What is the big-O of the following functions: (i) 40 + 10000

(ii) log  (iii) 0.0001 x 

Programming:

1.

·      Download and study program P0-0 from MyTSU, build and run it

·      Implement Solution_1 and Solution_2 for the prefixAverage problem using two different algorithms (refer slide 44, 45)

·      Run for the cases of size = 1,000, 10,000, and 50,000 for both solutions, respectively.

·      Conduct a Big-Oh analysis for both solutions (i.e. what is the time complexity of the two algorithms in Big-O, respectively?)

2.

·      Download and study program P0-1 from MyTSU, build and run it

·      Modify the program so that it can do its original work (Display, Average, Search) for any number of numbers up to MAX_SIZE;

·      Add a method that can find the largest number and its position in the array (also for any number of numbers up to MAX_SIZE)

·      Add a method that can find the smallest number and its position in the array (also for any number of numbers up to MAX_SIZE)

Requirement for assignment reports

1. The cover page must be attached.
2. For each programming question, the submission must contain the program itself  printed out from Visual Studio, proper description of the program, and  running page (screen shot) which shows that the program works  for all cases.
3. Each program must have proper comments lines for non-trivial so that the instructors can read and understand the program.