CS 1323, Spring 2017, Section 1

Due Date: Friday, March31, 11:59 pm

Topics: Methods Revisited,Nesting Loops, Sorting Algorithms

1.      (10 points; 5 points each) Trace the following nested loops using the table on the right.  Show every time a variable is changed—including the last change. 

a.      (Hint: Go SLOWLY, this gets confusing.  The lowest value on each column at any time will be the current value of that variable, so don’t get ahead of yourself.)

int[] data = { 1, 3, 8, 2 };

intsum = 0;

intproduct = 0;

for (inti = 0; i<data.length; i++) {

      product = data[i] * 2;

      for (intj = i; j<i + 1&&j<data.length; j++) {

            sum = data[j] + product;

      }

}

b.      (Hint: Remember to include the ending value of counter variables like i and j)

int[] data = { 1, 3, 8, 2};

intsum = 0;

intproduct = 0;

for (inti = 0; i<data.length; i++) {

      product = data[i] * 2;

      for (intj = 0; j< 3; j++) {

            sum = data[j] + product;

      }

}

2.      (10 points; 2 points each)

You have an array of earthquake data for Oklahoma for the last year.

double[] richterValues;  // constructed and initialized elsewhere as a Perfect Size Array

Use the methods in the Arrays API to do the following actions.  Note: Each of these items is a single line of code that will call one method in the Arrays class.  No credit will be given for writing the logic to do this work instead of using the Arrays class method.

a)      Sort the values in the richterValues array

b)      Store a String representation of the richterValues values into a String called summary.

c)      Make a new copy of the first 5 items in the array.  (Note: If there are less than 5 items in the richterValues array, leave the new values added as 0)

d)      Check to see if the richterValues array is equal to the array “{1, 2, 3}” and store that value into a boolean variable called isSame.

e)      Make a new copy richterValues array that contains only the items in index 3 – index 7.  (Note: In this case, you may assume that the richterValues array has at least 4 items so there is definitely a value in index 3.)

3.      (10 points) Trace the execution of insertion sort, using the algorithm presented in class (no other version will be accepted).  Show each data movement on a separate line in the table. The column labeled “Auxiliary” is there to hold the data item that has to be set to the side.

The tables are given a default size, which may be either too big or too small.  If it’s too big, delete extra rows.  If it is too small, add extra rows.

4.      (10 points) Trace the execution of selection sort, using the algorithm presented in class (no other version will be accepted).  Show each data movement on a separate line in the table. The tables are given a default size, which may be either too big or too small.  If it’s too big, delete extra rows.  If it is too small, add extra rows.

CS 1323: Section 1

Instructor: Sarah Wu

Please place your name in the space provided below.  Please do not put any personally identifying information anywhere else on this homework.

(5 point) Student Name: __________________________________________________________

Submit this file to Canvas as a PDF.  The title of the file does not matter.