Program to negate a 24-bit true-color image Program plan: In the file “ BMPImageNegater.java ”, import necessary packages and create a class “ BMPImageNegater”, Define the method “main()”, Declare the variable to hold the file name. Check if there is no command line input, Print an error message. Otherwise, Get the file name from the command line input. Execute “try” statement, Set the offset value as “10”. Advances the pointer to the starting position of the first pixel. Calculate “256” to the power of “2”. Calculate “256” to the power of “3”. Read and compute the power of first pixel. Advances the pointer to the starting position of the width. Read and compute the width of an image. Read and compute the height of an image. Discover the number of padding bytes if any. Advances the pointer to the first pixel in the image. Declare the variables. Execute a loop, Execute a loop, Read and negate the Red value of this pixel. Read and negate the Green value of this pixel. Read and negate the Blue value of this pixel Overwrite the pixels with the negated value. Update the values in an image. Skip the padding bytes if any. Close the file. Catch if “FileNotFoundException” occurs, Handle the exception. Catch if “IOException” occurs, Handle the exception.

Question

Want to see the full answer?

Answer 1

Question

Chapter 20, Problem 9PP

Program Plan Intro

Program to negate a 24-bit true-color image

Program plan:

In the file “BMPImageNegater.java”, import necessary packages and create a class “BMPImageNegater”,

Define the method “main()”,

Declare the variable to hold the file name.

Check if there is no command line input,

Print an error message.

Otherwise,

Get the file name from the command line input.

Execute “try” statement,

Set the offset value as “10”.

Advances the pointer to the starting position of the first pixel.

Calculate “256” to the power of “2”.

Calculate “256” to the power of “3”.

Read and compute the power of first pixel.

Advances the pointer to the starting position of the width.

Read and compute the width of an image.

Read and compute the height of an image.

Discover the number of padding bytes if any.

Advances the pointer to the first pixel in the image.

Declare the variables.

Execute a loop,

Execute a loop,

Read and negate the Red value of this pixel.

Read and negate the Green value of this pixel.

Read and negate the Blue value of this pixel

Overwrite the pixels with the negated value.

Update the values in an image.

Skip the padding bytes if any.

Close the file.

Catch if “FileNotFoundException” occurs,

Handle the exception.

Catch if “IOException” occurs,

Handle the exception.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

7. Long-Distance CallsA long-distance provider charges the following rates for telephone calls: Rate Category Rate per MinuteDaytime (6:00 a.m. through 5:59 p.m.) $0.07Evening (6:00 p.m. through 11:59 p.m.) $0.12Off-Peak (midnight through 5:59 a.m.) $0.05Write a GUI application that allows the user to select a rate category (from a set of radio buttons), and enter the number of minutes of the call into an Entry widget. An info dialog box should display the charge for the call.

Name and Address The Name and Address Problem Write a GUI program that displays your name and address when a button is clicked. The program’s window should appear as the sketch on the left side of Figure 13-61 when it runs. When the user clicks the Show Info button, the program should display your name and address, as shown in the sketch on the right of the figure.

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…