A school has been selling raffle tickets to raise funds for the school library. Each ticket is sold for $5, and the school has sold many such tickets. Each ticket has a code. When a ticket is presented at the library book sale, it can be redeemed for $1, $5, or $10. The dollar amount being assigned to each ticket is determined by a lottery before the book sale. Heidi is wondering whether the school is actually losing money out of the raffle. (a) Formulate the null and alternative hypotheses that can be used to determine whether the school is losing money out of the raffle. Note that the issue is whether the school is losing money, not whether the school is breaking even. Please think about what the implication is when formulating the null and alternative hypotheses

A school has been selling raffle tickets to raise funds for the school library. Each ticket is sold for $5, and the school has sold many such tickets. Each ticket has a code. When a ticket is presented at the library book sale, it can be redeemed for $1, $5, or $10. The dollar amount being assigned to each ticket is determined by a lottery before the book sale. Heidi is wondering whether the school is actually losing money out of the raffle. (a) Formulate the null and alternative hypotheses that can be used to determine whether the school is losing money out of the raffle. Note that the issue is whether the school is losing money, not whether the school is breaking even. Please think about what the implication is when formulating the null and alternative hypotheses

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter5: Making Decisions

Section: Chapter Questions

Problem 5GZ

See similar textbooks

Similar questions

You are hired by a game design company and one of their most popular games is The Journey. The game has a ton of quests, and for a player to win, the player must finish all the quests. There are a total of N quests in the game. Here is how the game works: the player can arbitrarily pick one of the N quests to start from. Once the player completes a quest, they unlock some other quests. The player can then choose one of the unlocked quests and complete it, and so on. For instance, let’s say that this game had only 4 quests: A, B, C, and D. Let’s say that after you complete • quest A, you unlock quests [B, D]. • quest B, you unlock quests [C, D]. • quest C, you unlock nothing [ ]. • quest D, you unlock quest [C]. Is this game winnable? Yes, because of the following scenario: The player picks quest A to start with. At the end of the quest A, the unlocked list contains [B, D]. Say that player chooses to do quest B, then the…
The game is played in the magic maze, as shown below. The squares are flaming lava pools. If you try to cross them you will die. The grid lines are passageways and are safe to travel in. You can start at any location on the grid but must travel in the passageways. You may travel as far as you want in any direction, but once you turn, you must repeat that distance and you may only make left turns. You may not reverse direction inside the tight passageways. You must end up at the same spot you started at. If you successful, then you gain a magic coin, which automatically appears. You can start over again and again in a different or same starting spot and earn new magic coins, but the routes you take must differ somehow for each magic coin. That is, no magic coins for the exact same route as previously done. If the route varies in any way (perhaps it is the same starting location and ending location as a previous route, but longer), it will earn a new magic coin. Mad Madame Mim has…
Tentaizu is a classic Japanese game that consists of a 7x7 board of which 10 of those 49 slots are "stars". The objective of the game is to determine the position of these stars. To help with identifying the correct position, some slots contain hints in the form of numbers. These hints work like the number hints in minesweeper in the sense that it identifies how many stars are adjacent to the slot. The range of values are from 0 (no stars) to 8 (fully surrounded by stars). A Tentaizu puzzle contains only these number hints. Much like other puzzle games like sudoku, there is only one combination of star positions that is described by the puzzle. Your task is to create a solver function for a given Tentaizu puzzle using python. This function should be able to recursively solve the puzzle. Define a function "solve" with the input variable being a 7x7 list representing the Tentaizu puzzle. The return value should be a list of tuples containing the correct coordinates of the 10 stars. If…
creating a roulette wheel. The pockets are numbered from 0 to 36. The colors of the pockets are as follows: Pocket 0 is green. For pockets 1 through 10, the odd-numbered pockets are red and the even-numbered pockets are black. For pockets 11 through 18, the odd-numbered pockets are black and the even-numbered pockets are red. For pockets 19 through 28, the odd-numbered pockets are red and the even-numbered pockets are black. For pockets 29 through 36, the odd-numbered pockets are black and the even-numbered pockets are red. Create a class named RoulettePocket. The class's constructor should accept a pocket number. The class should have a method named getPocketColor that returns the pocket's color, as a string. Demonstrate the class in a program that asks the user to enter a pocket number, and displays whether the pocket is green, red, or black. The program should display an error message if the user enters a number that is outside the range of 0 through 36.
Nim is a two-player game played with several piles of stones. You can use as many piles and as many stones in each pile as you want, but in order to better understand the game, we'll start off with just a few small piles of stones (see figure 1 below). Pile 1 Pile 1 Pile 2 The two players take turns removing stones from the game. On each turn, the player removing stones can only take stones from one pile, but they can remove as many stones from that pile as they want (please note, a player must remove atleast 1 stone from a pile during his/her turn). If they want, they can even remove the entire pile from the game! The winner is the player who removes the final stone (avoid taking the last stone - see figure 2 below). Pile 2 Pile 3 Pile 3 Let's say its Max (player 1) turn to play. Then Max can win by simply removing a stone from Pile 2 or Pile 3 Draw a game tree (upto depth level 2) for the given version of the Nim game. Please consider figure 1 as your initial game configuration/state…
AGU Computer Engineering Department created a new mathematical game that can be played with two people. In this game, you are given a list of random integers. At each round, the first player takes two numbers from the list and calculates the sum of these numbers. Then, the second player takes two numbers and makes the same calculation. The higher one is going to take the round and increment the score by 1. At the end of the game, who has the better score will win the game. Here are the rules for the game: There are always an even number of items on the list There are two colors for the players: Green and Red Green starts the game At each round, green plays and then red plays The player takes the first and the last numbers The game can end Tie when the scores are the same. The game will end when there is no element to take from the list Your program will simulate the rounds and find out the winner, Green or Red or Tie. The input will be two lines. Input Format…
AGU Computer Engineering Department created a new mathematical game that can be played with two people. In this game, you are given a list of random integers. At each round, the first player takes two numbers from the list and calculates the sum of these numbers. Then, the second player takes two numbers and makes the same calculation. The higher one is going to take the round and increment the score by 1. At the end of the game, who has the better score will win the game. Here are the rules for the game: There are always an even number of items on the list There are two colors for the players: Green and Red Green starts the game At each round, green plays and then red plays The player takes the first and the last numbers The game can end Tie when the scores are the same. The game will end when there is no element to take from the list Your program on java will simulate the rounds and find out the winner, Green or Red or Tie. The input will be two lines. Input…
6 11 12 13 8 9 points = [10, 7, 4, 1] scores=0 15 16 17 18 19 20 21 22 23 29 38 31 32 33 34 35 36 37 38 39 40 41 This project is a fun game that generates a random number in a certain specified range and the user must guess the number after receiving hints. Every time a user's guess is wrong they are prompted with more hints to make it easier at the cost of reducing the score. from random import randint 44 45 24 25 26 27 def guessNumber(): 28 def generateNumber(): 51 52 53 54 55 56 57 return randint (10, 20) def generateHint (secretNumber, userGuess, rounds): if rounds == 0: hint = "The number is between 10 and 20" elif rounds == 1: hint= "The number is a even number" if secretNumber % 2 == 0 else "The number is an odd number" else: hint = "The number is lesser" if userGuess > secretNumber else "The number is greater" return hint secretNumber = generateNumber() for eachRound in range(0, 4): user Input = int(input("Enter your guess: ")) if userInput == secretNumber: print("Hurray! You…
This challenge is based on the classic videogame "Snake". Assume the game screen is an n * n square, and the snake starts the game with length 1 (i.e. just the head) positioned on the top left corner. For example, if n = 7 the game looks something like this: BEGINNING In this version of the game, the length of the snake doubles each time it eats food (e.g. if the length is 4, after eating it becomes 8). Create a function that takes the siden of the game screen and returns the number of times the snake can eat before it runs out of space in the game screen. Examples FIRST MOVE snakefill (3) snakefill (6) - 5 snakefill (24) → 9 3
This challenge is based on the classic videogame "Snake". Assume the game screen is an n * n square, and the snake starts the game with length 1 (i.e. just the head) positioned on the top left corner. For example, if n = 7 the game looks something like this: BEGINNING FIRST MOVE In this version of the game, the length of the snake doubles each time it eats food (e.g. if the length is 4, after eating it becomes 8). Create a function that takes the side n of the game screen and returns the number of times the snake can eat before it runs out of space in the game screen. Ctrl+En
The goal of Snake is to create a snake as long as possible. This is achieved by guiding the snake to an apple on the game board. The snake cannot stop moving, and dies whenever it hits something (excluding apples). Because the snake is growing longer and longer as the game progresses, it gets increasingly difficult to avoid collisions with the snake itself. The player can change the direction of the head of the snake by using the arrow keys. At step in the game, there is always an apple somewhere on the board. If the snake eats an apple, the snake becomes one cell longer. A new apple is placed on a random location, excluding all places covered by the snake. When the snake reaches a side of the game board, it re-emerges at the opposite end.
Packages are a common way to create products that consist of other products. For example, any fast food chain creates "menus" using a main course, a side dish, and a drink. Typically, the main course is a hamburger, the side dish is french fries, and the drink is a soft drink (Cola, Buttermilk, and the like). Menus are also given a name to distinguish them. You are asked to create such menus, but the price of these menus should not be the same as the items on the menu. It should receive a 10 percent discount on the main line, 20 percent on the side, and 50 percent on the drink. In the main section, list the names of their menus and the food served. There should be two menus consisting of a main course, a side dish and a drink. Menus should be listed as items on the menu and their prices. After listing the menus, the products should be listed according to their name and price. WRITE JAVA CODE ACCORDING TO THIS