Week 7 only:

Instructions:

The Test Plan for each project includes the Pseudocode, Flowchart, Goals and Objectives, Functional Requirements, and Test Matrix including Actual Output column. Below the table are screenshots verifying the actual output for each case.

FOUR TEST PLANS!!! Really?! This is also an Announcement in our classroom.

For Week 7, we have TWO Chapters – 7 and 8! We have 4 Projects, Test Plan for each project as usual, along with our Quizzes on Chapters 7 and 8, and one Discussion on Arrays.

(1) Week 7 Discussion, (2) Chap 7 Quizzes, Projects 2 & 5, (3) Chap 8 Quizzes, Projects 3 & 5, (4) Test Plans for all 4 Projects

Each Test Plan has 5 parts, in order: (1) Pseudocode, (2) Flowchart, (3) Goals & Objectives, (4) Functional Requirements, the (5) Test Matrix/table (simplified), and Output (screenshots from your own output). Your Output also appears under your table to verify Actual Output. Please make it clear that all 5 tasks are covered for each of your projects.

Our Projects this Week — We have FOUR!

The algorithms this week will be our focus. In working on a project in which the algorithm (steps) is not immediately clear to us, we may want to do the task by hand first, modeling the problem to SEE more clearly what the task is and how we may create the solution. You’re working like a pro! Also, we’ll be using loops again. See full Instructions in our textbook for each project.

Chapter 7: Project 2 Read integers from user. For all integers between 1 and 100, count occurrences of each.

Sample run:

Enter the integers between 1 and 100: 2 5 3 2

2 occurs 2 times <– Note when to show “time” versus “times”

3 occurs 1 time

5 occurs 1 time

Chapter 7: Project 5 Write a method that returns true if list is already sorted in increasing order, false if not. Write a test program. There can be more than one way of solving some tasks.

Sample run:

Enter list: 8 10 1 5 16 61 9 11 1 <– 1st number tells us how many

The list is not sorted

Chapter 8: Project 3 Find the largest element in a 2-dimensional array.

Sample run:

Enter the number of rows and columns of the array: 3 4

Enter the array:

23.5 35 2 10

4.5 3 45 3.5

35 44 5.5 9.6

The location of the largest element is at (1, 2) <–

Note that (1,2) is the 2nd row and 3rd column, since array indices begin with 0.

Chapter 8: Project 5 Find the Central City, the city with the shortest total distance to all other cities.

Sample run:

Enter the number of cities: 5

Enter the coordinates of the cities: 2.5 5 5.1 3 1 9 5.4 54 5.5 2.1

The central city is at (2.5, 5.0)

The total distance to all other cities is 60.81

Note: We might model the problem on paper in order to better understand it. I suggest a very simple problem such as cities (3,2), (7,1), (4,6) and (6,4) on graph paper. How would you find the Central City? How will you tell the program to do these steps?

What are your questions? Let’s finish Week 6 work quickly and begin Week 7!

Rebecca Rowson