CSC3002 23fall Assignment 3

CSC3002 2023 Fall Assignment 3
Due 23:59, Nov. 5, 2023
About this Assignment

• Submission to OJ platform is required, while submission to Blackboard again is not necessary. You only
need to upload all the content in the corresponding .cpp (the .cpp file that has a main() function in it)
file to OJ.
• StanfordCPPLib is not needed in this assignment.
Problem 1 (Exercise 11.6, Points: 25)

Problem Description Using the following definitions of MAX_JUDGES and scores as a starting point:
const int MAX_JUDGES = 100;
double scores [ MAX_JUDGES ];
Write a program that reads in gymnastics scores between 0 and 10 from a set of judges and then computes
the average of the scores after eliminating both the highest and lowest scores from consideration.
Requirements Please finish sumArray, findLargest and findSmallest functions in the file GymJudge.cpp.
DO NOT modify the main() part, which is for testing unit.
In & Out Your program should accept input values until the maximum number of judges is reached or the
user enters a blank line.
If the number of input values is less than 3, prompt a error message. If a score that is out of range is received,
such score will not be counted and a error message will also be prompted. The processing steps are in the
function readScores(), which you should not modify but are highly recommended to read.
Then input your values following the prompts:

Enter a score for each judge in the range 0 to 10.
Enter a blank line to signal the end of the list.
Judge #1: 6
Judge #2: 5
Judge #3: 3.1415
Judge #4:
The average after eliminating 3.14 and 6.00 is 5.00.
Please see out/p1_1.txt, out/p1_2.txt for output format.
1
Problem 2
Part1:(Exercise 12.4, Points: 15)
Problem Description Design and implement a class called IntArray in intArray.cpp that implements the
following methods:
• A constructor IntArray(n) that creates an IntArray object with n elements, each of which is initialized
to 0.
• A destructor that frees any heap storage allocated by the IntArray.
• A method size() that returns the number of elements in the IntArray.
• A method get(k) that returns the element at position k. If k is outside the vector bounds1 , get should
prompt the message:"ERROR: Index range out of bounds!".
• A method put(k, value) that assigns value to the element at position k (directly assign, not insertion).
As with get, the put() method should call error with the same message if k is out of bounds.
Use int[] instead of wrapping an exiting vector<int>.
In & Out Two integers should be input to test the functionality of this program:
Position meaning
0 index of the task
1 size of array
where index of the task = 1 in this part.

This program supports both text file input and manual input.
For instance, when input:

1 0
You are expected to get:
array.size(): 0
ERROR: Index range out of bounds!
ERROR: Index range out of bounds!
Please see out/p2_1.txt for output format.

Problem Description You can make the IntArray class from the preceding exercise look a little more like
traditional arrays by overriding the bracket-selection operator, which has the following prototype:
int & operator []( int k );
Like the get and put methods, your implementation of operator[] should check to make sure that the index
k is valid. If the index is valid, the operator[] method should return the element by reference so that clients
can assign a new value to a selection expression.
In & Out Two integers should be input to test the functionality of this program, with the same meanings
of those in Part 1. The index of the task = 2 in this part. Other test input modes are the same as those in
Part1.
1 Here we consider the bound to be >=0 and < n
2
Problem Description Implement deep copying for the IntArray class from P2Part1 and P2Part2.
The following functions should be completed in this part:
• A function that copies the data from the src parameter into the current object. All dynamic memory is
reallocated to create a "deep copy" in which the current object and the source object.
void IntArray :: deepCopy ( const IntArray & src )
• A function that implements deep copy via "=" operator.

IntArray & IntArray :: operator =( const IntArray & src )
• A function that implements deep copy though the constructor.

IntArray :: IntArray ( const IntArray & src )
In & Out Two integers should be input to test the functionality of this program, with the same meanings
of those in Part 1. The index of the task = 3 in this part.
Other test input modes are the same as those in Part1.
About P2
• Please complete all the functions included in the problem descriptions, other wise your program will be
deducted even if the OJ running results go well.
• In all test cases for this problem, size of array n is a non-negative integer.
• Pre-test cases on the OJ platform are test case of part1, part2, and part3, respectively.
• DO NOT modify the main() part, which is for testing unit.

CSC3002 23fall Assignment 3

Uploaded by

Copyright:

Available Formats

CSC3002 23fall Assignment 3

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSC3002 23fall Assignment 3

Uploaded by

Copyright:

Available Formats

CSC3002 2023 Fall Assignment 3

Due 23:59, Nov. 5, 2023

About this Assignment

• StanfordCPPLib is not needed in this assignment.

Problem 1 (Exercise 11.6, Points: 25)

Then input your values following the prompts:

where index of the task = 1 in this part.

For instance, when input:

Part2:(Exercise 12.5, Points: 5)

1 Here we consider the bound to be >=0 and < n

• A function that implements deep copy via "=" operator.

• A function that implements deep copy though the constructor.

You might also like