Include required library files. Define a class named “ArrOutOfRangeErr”. Declare the required variables, constructors and function inside the access specifier “public” and “private”. Define a “testExcep()” function to test the exception. Using exception, set and get the values. Define a “create2DArr()” function to create an two-dimensional array. Define a “check_args()” function to check the validity and return the message if something is wrong. Define a “set()” function to store values. Define a “get()” function to retrieve the values. Define a default constructor for no messages. Define a parameterized constructor for row and column data. Define a “getMsg()” function to return the exception message string. Define a “getRows()” function to return the number of rows. Define a “getCols()” function to return the number of columns. Define a “getDesiredRow()” function to return the requested row number. Define a “getDesiredColumn()” function to return the requested column number. Define a “writeErr()” function to write the error message. Define a “main()” function. Declare the required variables. Create a 2D array for rows and columns. Populate the rows and columns. Print the array contents using “for” loop. Then test the some boundary cases.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 7PP

Program Plan Intro

Include required library files.

Define a class named “ArrOutOfRangeErr”.

Declare the required variables, constructors and function inside the access specifier “public” and “private”.

Define a “testExcep()” function to test the exception.

Using exception, set and get the values.

Define a “create2DArr()” function to create an two-dimensional array.

Define a “check_args()” function to check the validity and return the message if something is wrong.

Define a “set()” function to store values.

Define a “get()” function to retrieve the values.

Define a default constructor for no messages.

Define a parameterized constructor for row and column data.

Define a “getMsg()” function to return the exception message string.

Define a “getRows()” function to return the number of rows.

Define a “getCols()” function to return the number of columns.

Define a “getDesiredRow()” function to return the requested row number.

Define a “getDesiredColumn()” function to return the requested column number.

Define a “writeErr()” function to write the error message.

Define a “main()” function.

Declare the required variables.

Create a 2D array for rows and columns.

Populate the rows and columns.

Print the array contents using “for” loop.

Then test the some boundary cases.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Design a dynamic programming algorithm for the problem described below Input: A list of numbers A = = [a1,..., an]. Output: A contiguous subsequence of numbers with the maximum sum. The algorithm must take O(n) time. You must also write and explain the recurrence. (I am looking for an i ≥ 1 and k ≥ 0 such that a + ai+1 + ···ai+k has the largest possible sum among all possible values for i and k.) Example 1: Input: A[5, 15, -30, 10, -5, 40, 10]. Output: [10, 5, 40, 10] Example 2: Input: A = [7, 5, 7, 4, -20, 6, 9, 3, -4, -8, 4] Output: [6,9,3]

Design a dynamic programming algorithm for the Longest Increasing Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest increasing subsequence among these integers. The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [5, 3, 6, 8, 4, 6, 2, 7, 9, 5] Output: 5 ([3, 4, 6, 7, 9]) Example 2: Input: [12, 42, 66, 73, 234, 7, 543, 16] Output: 6 ([42, 66, 73, 234, 543])

Design a dynamic programming algorithm for the Subset Sum problem described below: Input: A set of n integers A and an integer s Output: A subset of A whose numbers add up to s, or that no such set exists. The algorithm must take O(n·s) time. You must also write and explain the recurrence. Example 1: Input: A = {4, 7, 5, 2, 3}, s = 12 Output: {7,2,3} Example 2: Input: A{4, 7, 5,3}, s = 6 Output: 'no such subset'