Quiz Question Program plan: Filename: “Question.java” This program file is used to define a class “Question”. In the code, Define a class “Question”. Declare class variables “text” and “answer”. Define a constructor “Question()”. Initialize the “text” and “answer”. Define a method “setAnswer()”. Initialize the value of “answer”. Define a method “checkAnswer()”. Return the value. Define a method “display()”. Print the value of “text”. Filename: “QuestionTester.java” This program file is used to define a class “QuestionTester”. In the code, Define a class “QuestionTester”. Define a method “main()”. Declare an object “q” of class “Question”. Call the method “setAnswer()” to set the answer. Call the method “checkAnswer()” for different type of answers and print the result. Print the expected result.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9, Problem 3PE

Program Plan Intro

Quiz Question

Program plan:

Filename: “Question.java”

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

Define a class “Question”.

Declare class variables “text” and “answer”.

Define a constructor “Question()”.

Initialize the “text” and “answer”.

Define a method “setAnswer()”.

Initialize the value of “answer”.

Define a method “checkAnswer()”.

Return the value.

Define a method “display()”.

Print the value of “text”.

Filename: “QuestionTester.java”

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

Define a class “QuestionTester”.

Define a method “main()”.

Declare an object “q” of class “Question”.

Call the method “setAnswer()” to set the answer.

Call the method “checkAnswer()” for different type of answers and print the result.

Print the expected result.

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