Mail Box System Program plan: Filename: “Mailbox.java” This program file is used to define a class “Mailbox”. In the code, Import the required packages. Define a class “Mailbox”. Define the class members. Define a constructor “Mailbox ()”. Set the values for class members. Define a method “getUser()”. Return the “user”. Define a method “addMessage()”. Add “m”. Define a method “getAllMessages()” Create a string “r”. Iterate a “for” loop, Add “m” to “r”. Return “r”. Filename: “Message.java” This program file is used to define a class “Message”. In the code, Import the required packages. Define a class “Message”. Define the class members. Define a constructor “Message()”. Set the class elements. Define the method “read()”. Create a string “line”. If length of “line” is less than 1, Return. If the length of “line” is greater than or equal to 1, Add “line” to “text”. Define the method “getRecipient()”. Create a string “recipient”. Define the method “toString()”. Return the string. Filename: “MessageTester.java” This program file is used to define a class “MessageTester”. In the code, Define a class “MessageTester”. Define a method “main()”. Define the object “m” of class “Message”. Read new message. Create a string array “lines”. Print the “lines[0]”. Print expected value. Print the “lines[1]”. Print expected value. Print the “lines[2]”. Print expected value. Print the “lines[3]”. Print expected value. Call the method “getRecipient()” and print the value. Print the expected value. Create the object of “Mailbox”. Call the method “addMessage()” and print the value. Read new message. Call the method “addMessage()”. Call the method “getUser()” and print the result. Print the expected value. Print the statement. Call the method “getAllMessages()”. Print the expected value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 5PE

Program Plan Intro

Mail Box System

Program plan:

Filename: “Mailbox.java”

This program file is used to define a class “Mailbox”. In the code,

Import the required packages.

Define a class “Mailbox”.

Define the class members.

Define a constructor “Mailbox ()”.

Set the values for class members.

Define a method “getUser()”.

Return the “user”.

Define a method “addMessage()”.

Add “m”.

Define a method “getAllMessages()”

Create a string “r”.

Iterate a “for” loop,

Add “m” to “r”.

Return “r”.

Filename: “Message.java”

This program file is used to define a class “Message”. In the code,

Import the required packages.

Define a class “Message”.

Define the class members.

Define a constructor “Message()”.

Set the class elements.

Define the method “read()”.

Create a string “line”.

If length of “line” is less than 1,

Return.

If the length of “line” is greater than or equal to 1,

Add “line” to “text”.

Define the method “getRecipient()”.

Create a string “recipient”.

Define the method “toString()”.

Return the string.

Filename: “MessageTester.java”

This program file is used to define a class “MessageTester”. In the code,

Define a class “MessageTester”.

Define a method “main()”.

Define the object “m” of class “Message”.

Read new message.

Create a string array “lines”.

Print the “lines[0]”.

Print expected value.

Print the “lines[1]”.

Print expected value.

Print the “lines[2]”.

Print expected value.

Print the “lines[3]”.

Print expected value.

Call the method “getRecipient()” and print the value.

Print the expected value.

Create the object of “Mailbox”.

Call the method “addMessage()” and print the value.

Read new message.

Call the method “addMessage()”.

Call the method “getUser()” and print the result.

Print the expected value.

Print the statement.

Call the method “getAllMessages()”.

Print the expected value.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

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…

how to read log logs

Discrete Mathematics for Computer Engineering