Ticket Seller Program plan: Import required package. Define the “Main” class. Declare required static variables. Define the “main ()” method. Declare required variables. Create an object for Scanner class. Do until “flag” is “true”. Get the number of tickets from the user and store it in a variable “tickets”. Check if the tickets are greater than “rem”. Break the loop. Check if the tickets are less than or equal to 4. Check if “rem” is equal to 0. Break the loop. Check if “rem” is greater than or equal to “tickets”. Calculate remaining tickets and store it in a variable “rem”. Increment “buyer”. Assign “true” to “flag”. Else, Assign “false” to “flag”. Else, Assign “true” to “flag”. Print the remaining number of tickets and total number of buyers.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 12PP

Program Plan Intro

Ticket Seller

Program plan:

Import required package.

Define the “Main” class.

Declare required static variables.

Define the “main ()” method.

Declare required variables.

Create an object for Scanner class.

Do until “flag” is “true”.

Get the number of tickets from the user and store it in a variable “tickets”.

Check if the tickets are greater than “rem”.

Break the loop.

Check if the tickets are less than or equal to 4.

Check if “rem” is equal to 0.

Break the loop.

Check if “rem” is greater than or equal to “tickets”.

Calculate remaining tickets and store it in a variable “rem”.

Increment “buyer”.

Assign “true” to “flag”.

Else,

Assign “false” to “flag”.

Else,

Assign “true” to “flag”.

Print the remaining number of tickets and total number of buyers.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Answer the question fully and accurately by providing the required files(Java Code, Two output files and written answers to questions 1-3 in a word document)meaning question 1 to 3 also provide correct answers for those questions.(note: this quetion is not graded).

.NET Interactive Solving Sudoku using Grover's Algorithm We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules: •No column may contain the same value twice •No row may contain the same value twice If we assign each square in our sudoku to a variable like so: 1 V V₁ V3 V2 we want our circuit to output a solution to this sudoku. Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the conversion of classical decision problems into oracles for Grover's algorithm. Turning the Problem into a Circuit We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit that…