A theater seating chart is implemented as a two-dimensional array of ticket prices, like this: 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 20 20 20 20 20 20 10 10 10 10 20 20 20 20 20 20 10 10 10 10 20 20 20 20 20 20 10 10 20 20 30 30 40 40 30 30 20 20 20 30 30 40 50 50 40 30 30 20 30 40 50 50 50 50 50 50 40 30 Write a program that prompts users to pick either a seat or a price. Mark sold seats by changing the price to 0. When a user specifies a seat, make sure it is available. When a user specifies a price, find any seat with that price. P7.8 should loop using a menu until the user selects quit. It should display the current state of the seats in the theater before prompting the user for 1) Select a seat or 2) Select by Price or 3) Quit Make certain to document your code using the JavaDoc format.

A theater seating chart is implemented as a two-dimensional array of ticket prices, like this: 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 20 20 20 20 20 20 10 10 10 10 20 20 20 20 20 20 10 10 10 10 20 20 20 20 20 20 10 10 20 20 30 30 40 40 30 30 20 20 20 30 30 40 50 50 40 30 30 20 30 40 50 50 50 50 50 50 40 30 Write a program that prompts users to pick either a seat or a price. Mark sold seats by changing the price to 0. When a user specifies a seat, make sure it is available. When a user specifies a price, find any seat with that price. P7.8 should loop using a menu until the user selects quit. It should display the current state of the seats in the theater before prompting the user for 1) Select a seat or 2) Select by Price or 3) Quit Make certain to document your code using the JavaDoc format.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

C++ 2. A theater seating chart is implemented as a two-dimensional array of ticket prices,Like this10 10 10 10 10 10 10 10 10 1010 10 10 10 10 10 10 10 10 1010 10 10 10 10 10 10 10 10 1010 10 20 20 20 20 20 20 10 1010 10 20 20 20 20 20 20 10 1010 10 20 20 20 20 20 20 10 1020 20 30 30 40 40 30 30 20 2020 30 30 40 50 50 40 30 30 2030 40 50 50 50 50 50 50 40 30 Write a program that prompts users to pick either a seat or price. Mark sold seats by changing theprice to 0. When a user specifies a seat, make sure it is available. When a user specifies a price,find any seat with that price. 3. A supermarket awards coupons depending on how much a customer spends on groceries.For example, if you spend Ghc50, you will get a coupon worth eight percent of that amount.The following table shows the percent used to calculate the coupon awarded for differentamounts spent. Write a program that calculates and prints the value of the coupon a person can receive based on groceries purchased.Here is a sample…
Using java language In voltTest[10] is an encapsulated array that contains 10 voltages. Display how many are ACTIVE (5V), SATURATED (greater than 5V) and CUTOFF (less than 5V). Use the UML diagram as a reference. setValue(int,int,int) – accepts the value of voltActive, voltSaturated and voltCutoff as a parameter, which is the number of active, saturated and cutoff voltages. displayResult() – displays the number of active, saturated and cutoff voltages.
A popular word game involves finding words from a grid of randomly generatedletters. Words must be at least three letters long and formed from adjoining letters.Letters may not be reused and it is valid to move across diagonals. As an example,consider the following 4 * 4 grid of letters: A B C DE F G HI J K LM N O P The word “FAB” is valid (letters in the upper left corner) and the word “KNIFE”is valid. The word “BABE” is not valid because the “B” may not be reused. Theword “MINE” is not valid because the “E” is not adjacent to the “N”. Write a program that uses a 4 * 4 two-dimensional array to represent the gameboard. The program should randomly select letters for the board. You may wishto select vowels with a higher probability than consonants. You may also wish toalways place a “U” next to a “Q” or to treat “QU” as a single letter. The programshould read the words from the text file words.txt (included on the website withthis book) and then use a recursive algorithm to…
An 8-puzzle game consists of 8 sliding tiles, numbered by digits from 1 to 8 and arranged in a 3x3 array of nine cells. A configuration in the puzzle refers to some specific arrangement of the tiles in the array, where each digit is arranged into a different cell. One of the cell is empty (represented by a "*") and any adjacent tile can be moved into the empty cell. An example below c | 1 | 2 | 3 b | 4 | * | 5 a | 6 | 7 | 8------------------ Y/X a b c We use a 3-tuple (number, X, Y) to represent the position of a digit, where number is the actual digit, and (X,Y) is the coordinate value of the digit in the current configuration (e.g., in the configuration above, we have (5,c,b), meaning the digit 5 is at the position of (c,b)).Hence the configuration in the example can be represented as:[(1,a,c), (2,b,c), (3,c,c), (4,a,b), (5,c,b), (6,a,a), (7,b,a), (8,c,a)].Any move of an adjacent tile into the empty cell moves the current configuration into the one adjacent to it.…
Create a NetBeans project for this activity. Project Name: MP1_<lastname_firstname> Example: MP1_Blanco_Maria  Compress the NetBeans project into .rar or .zip format and then upload to the link provided in the LMS. Program Specification: Use two-dimensional array with size 7 columns and 5 rows. Seat numbers are populated during run-time and not hard-coded. User is asked to input a seat number. The chosen seat number is replaced by the letter X. Program displays a remark “Seat successfully reserved” when reservation is done.  The class name should be SeatReservation_<lastname>. Assessments Example: SeatReservation_Blanco Week005 – Machine Problem 1  Only NetBeans project will be accepted. Non-compliance will require resubmission. The highest score for resubmission is 50%. The user is not allowed to reserve a previously reserved seat. Display “Seat is taken” remarks. The user is not allowed to enter an invalid seat number.…
Please add an gif image/plot an gif to this code. This is a brownian motion python code here it is code import numpy as np import matplotlib.pyplot as plt def brownian_motion(L, N): # initialize position in the center of the grid x = L // 2 y = L // 2 # initialize the grid grid = np.zeros((L, L), dtype=np.int32) # loop over the number of steps for i in range(N): # choose a random direction direction = np.random.choice(['up', 'down', 'left', 'right']) # move one step in that direction if direction == 'up': " y += 1" elif direction == 'down': "y -= 1" elif direction == 'left': "x -= 1" elif direction == 'right': "x += 1" # make sure the particle is still on the grid if x < 0 or x >= L or y < 0 or y >= L: "continue" # update the grid grid[y, x] = 1 return grid if __name__ == '__main__': # set the size of the grid L…
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a 'map' of all the underground resources in the mine. This map comes as a two-dimensional integer array. The array has n rows and k columns. Each integer is between zero and one hundred (inclusive). This array represents a grid map of the mine – with each row representing a different height level. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and k. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit…
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a 'map' of all the underground resources in the mine. This map comes as atwo-dimensional integer array. The array has n rows and k columns. Each integer is between zero and one hundred (inclusive). This array represents a grid map of the mine – with each row representing a different height level. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and k. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit…
In Java language Declare a constant V with value 5 Declare a variable named Graph that is an integer matrix of VxV Define a MENU procedure with the following text GRAPH 1. Create Graph 2.ShowGraph 3. Adjacency between pair 4. Input degree 5.Output degree 6.Loops 0.Exit Validate MENU so that it receives only valid options (from 0 to 6), otherwise send an error message and repeat the reading Make the MENU call in the main program Define a CREATE procedure/function to fill an array with random values between 0 and 1. Where 0 represents no adjacency and 1 indicates there is. Making the CREATE call in the main program receives as a parameter the Graph array created at point Define a SHOW procedure/function to print an adjacency matrix, in matrix form Make the SHOW call in the main program, it receives as a parameter the Graph array created in point 2 Define an ADJACENCY procedure/function that receives, apart from the array, two integer values and returns a true value if…
JavaScript ============================================================================ Use the map() method to create a new array with each word capitalized. Use an arrow function with the map() method to access each word in the array. Use string manipulation to capitalize the first letter of each word. Use the map() method again to create an array of word lengths. Use an arrow function with the map() method to access each word in the array. Use the length property of the string to find the length of each word. Use the map() method once more to create an array of objects with each word and its length. Use an arrow function with the map() method to access each word in the array. Create an object with a "word" property that is set to the current word and a "length" property that is set to the length of the current word. Use console.log() to print out the new capitalized word array, word length array, and object array.…
A prime integer is any integer greater than 1 that can be divided evenly only by itself and 1. The Sieve of Eratosthenes is a method of finding prime numbers. It works as follows:a) Create an array with all elements initialized to 1 (true). Array elements with prime subscripts will remain 1. All other array elements will eventually be set to zero.b) Starting with array subscript 2 (subscript 1 is not prime), every time an array element is found whose value is 1, loop through the remainder of the array and set to zero every element whose subscript is a multiple of the subscript for the element with value 1. For array subscript 2, all elements beyond 2 in the array that are multiples of 2 will be set to zero (subscripts 4, 6, 8, 10, and so on.). For array subscript 3, all elements beyond 3 in the array that are multiples of 3 will be set to zero (subscripts 6, 9, 12, 15, and so on)When this process is complete, the array elements that are still set to 1 indicate that the subscript is a…
JAVA LANGUAGE Create an ArrayList, Name it YourRegNoandName that can hold Integers, and fill each slot with a different random value from 1-50. Display those values on the screen, and then prompt the user for an integer to search through the ArrayList, and if the item is present, say “FOUND”. It is not necessary to display anything if the value was not found. If the item is in the ArrayList multiple times, it's okay if the program prints the message more than once. ALSO SCREENSHOT THE OUTPUT