C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN: 9781337102087
Author: D. S. Malik
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
error_outline
This textbook solution is under construction.
Students have asked these similar questions
There are four people who want to cross a rickety bridge; they all begin on the
same side. You have 17 minutes to get them all across to the other side. It is night, and
they have one flashlight. A maximum of two people can cross the bridge at one time. Any
party that crosses, either one or two people, must have the flashlight with them. The
flashlight must be walked back and forth; it cannot be thrown, for example. Person 1
takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes,
and person 4 takes 10 minutes. A pair must walk together at the rate of the slower
person's pace.
Write the specification of an algorithm that solves the problem.
We have n glasses which can hold a varying amount of liquid. We will say that glass1 is size q1 quarts and glass2 is size q2 quarts, etc. We now give you a size, say x quarts. You must give me a glass of exactly x quarts. You are allowed to fill any glass to exactly its size and to pour any liquid from one glass into another. When you pour, you either have to empty the glass you are pouring from or fill the glass you are pouring into. Can you do it?More concrete example: G1 has size 10 quarts. G2 has size 4 quarts. G3 has size 1 quart. You can get a 5 quart drink by filling G1, pouring 4 quarts from it into G2 and 1 quart of it into G1. After that, G1 has exactly 5 quarts.
In the same problem, we could get 8 quarts by filling G2 twice and emptying it into G1 twice.
Given This:
Write an algorithm to do this and determine its complexity.
Suppose we can buy a chocolate bar from the vending machine for $1 each.Inside every chocolate bar is a coupon. We can redeem six coupons for onechocolate bar from the machine. This means that once you have startedbuying chocolate bars from the machine, you always have some coupons.We would like to know how many chocolate bars can be eaten if we startwith N dollars and always redeem coupons if we have enough for an additional chocolate bar.For example, with 6 dollars we could consume 7 chocolate bars afterpurchasing 6 bars giving us 6 coupons and then redeeming the 6 couponsfor one bar. This would leave us with one extra coupon. For 11 dollars, wecould have consumed 13 chocolate bars and still have one coupon left.For 12 dollars, we could have consumed 14 chocolate bars and have twocoupons left.
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Suppose a person can buy a chocolate bar from the vending machine for $1 each. Inside every chocolate bar is a coupon. A person can redeem 3 coupons for one chocolate bar from the machine. This means that once a person has started buying chocolate bars from the machine, he/she always has some coupons. A person would like to know how many chocolate bars can be bought, if a person starts with N dollars and always redeem coupons, if he/she has enough for an additional chocolate bar. For example: With 3 dollars a person could buy 4 chocolate bars after purchasing 3 bars giving him/her 3 coupons and then redeeming the 3 coupons for one bar. This would leave him/her with one extra coupon. Thus, will have 4 chocolate bars and still have one coupon leftover. For 11 dollars, a person can have 16 chocolate bars and still have one coupon leftover. For 12 dollars, a person can have 17 chocolate bars and have two coupons leftover. Write a complete Python program that prompts a buyer to input…arrow_forwardBowling involves 10 frames. Each frame starts with 10 pins. The bowler has two throws to knock all 10 pins down. The total score is the sum of pins knocked down, with some special rules. For the first 9 frames: If all 10 pins are knocked down on a frame's first throw (a "strike"), that frame's score is the previous frame plus 10 plus the next two throws. (No second throw is taken). If all 10 pins are knocked down after a frame's second throw (a "spare"), that frame's score is the previous frame plus 10 plus the next throw. In the 10th frame, if the bowler's first throw is a strike, or the first two throws yields a spare, the bowler gets a third throw. The 10th frame's score is the previous frame's score plus the pins knocked down in the 10th frame's two or three throws. Given integers represents all throws for a game, output on one line each frame's score followed by a space (and end with a newline). Note that the number of throws may be as few as 11 (strikes in first 9 frames,…arrow_forwardBowling involves 10 frames. Each frame starts with 10 pins. The bowler has two throws to knock all 10 pins down. The total score is the sum of pins knocked down, with some special rules. For the first 9 frames: If all 10 pins are knocked down on a frame's first throw (a "strike"), that frame's score is the previous frame plus 10 plus the next two throws. (No second throw is taken). If all 10 pins are knocked down after a frame's second throw (a "spare"), that frame's score is the previous frame plus 10 plus the next throw. In the 10th frame, if the bowler's first throw is a strike, or the first two throws yields a spare, the bowler gets a third throw. The 10th frame's score is the previous frame's score plus the pins knocked down in the 10th frame's two or three throws. Given integers represents all throws for a game, output on one line each frame's score followed by a space (and end with a newline). Note that the number of throws may be as few as 11 (strikes in first 9 frames,…arrow_forward
- Bowling involves 10 frames. Each frame starts with 10 pins. The bowler has two throws to knock all 10 pins down. The total score is the sum of pins knocked down, with some special rules. For the first 9 frames: If all 10 pins are knocked down on a frame's first throw (a "strike"), that frame's score is the previous frame plus 10 plus the next two throws. (No second throw is taken). If all 10 pins are knocked down after a frame's second throw (a "spare"), that frame's score is the previous frame plus 10 plus the next throw. In the 10th frame, if the bowler's first throw is a strike, or the first two throws yields a spare, the bowler gets a third throw. The 10th frame's score is the previous frame's score plus the pins knocked down in the 10th frame's two or three throws. Given integers represents all throws for a game, output on one line each frame's score followed by a space (and end with a newline). Note that the number of throws may be as few as 11 (strikes in first 9 frames,…arrow_forwardA spinner with three equal sections is being used in a game. One section is labeled “0 points,” and two sections are labeled “2 points.” A player can decide not to spin the spinner and score 1 point. Each player gets one turn, and the player with the higher score wins; in case of a tie, the winner is decided by one flip of a fair coin. Alex takes his turn first. Eddie, knowing Alex’s score, takes his turn next. If both players use strategies that maximize their winning probabilities, what is the probability that Alex wins? a 1/3 b 1/2 c 2/3 d 4/9arrow_forwardLet's begin with a lesson in roulette. Roulette is a casino game that involves spinning a ball on a wheel that is marked with numbered squares that are red, black, or green. Half of the numbers 1–36 are colored red and half are black and the numbers 0 and 00 are green. Each number occurs only once on the wheel. We can make many different types of bets, but two of the most common are to bet on a single number (1–36) or to bet on a color (either red or black). These will be the two bets we will consider in this project. After all players place their bets on the table, the wheel is spun and the ball tossed onto the wheel. The pocket in which the ball lands on the wheel determines the winning number and color. The ball can land on only one color and number at a time. We begin by placing a bet on a number between 1 and 36. This bet pays 36 to 1 in most casinos, which means we will be paid $36 for each $1 we bet on the winning number. If we lose, we simply lose whatever amount of money we…arrow_forward
- Let's begin with a lesson in roulette. Roulette is a casino game that involves spinning a ball on a wheel that is marked with numbered squares that are red, black, or green. Half of the numbers 1–36 are colored red and half are black and the numbers 0 and 00 are green. Each number occurs only once on the wheel. We can make many different types of bets, but two of the most common are to bet on a single number (1–36) or to bet on a color (either red or black). These will be the two bets we will consider in this project. After all players place their bets on the table, the wheel is spun and the ball tossed onto the wheel. The pocket in which the ball lands on the wheel determines the winning number and color. The ball can land on only one color and number at a time. We begin by placing a bet on a number between 1 and 36. This bet pays 36 to 1 in most casinos, which means we will be paid $36 for each $1 we bet on the winning number. If we lose, we simply lose whatever amount of money we…arrow_forwardJojo, Lili and Bibi are playing together. Because they had just learned the alphabet, Jojo also proposed a game using the alphabet to hone and deepen their abilities. The game is a game of changing strings. Initially Jojo has an X string. The X string will be changed through several processes given by Jojo. The process is changing an alphabet Ai to Bi. Each alphabet can only be changed once. After all processes take place. Jojo just wants to find out how many characters Bi are in the string X. If the alphabet does not appear in the string, the character does not need to be displayed. The alphabet displayed must be ordered by alphabet. Lili and Bibi want to do it, but they doubt their answer, for that they ask for your help to make an answer for the Jojo game. Format Input The input will consist of several lines of input in ”testdata.in” file. First consists of T, the number of test cases. For each testcase consists of several lines. The first line consists of the X string, Jojo’s…arrow_forwardSuppose you are a participant in a game show. You have a chance to win a motorbike. You are askedto select one of the 500 doors to open; the motorbike is behind one of the 500 doors; the other remaining doorsare losers and have balloons behind them. Once you select a door, the host of the game show, who knowsexactly what is behind each of the door, randomly opens 480 of the other doors all at once that s/he for sureknows are losing doors and have balloons behind them. Then s/he reoffers you – whether you would like toswitch to the other doors or keep your initial or original selection as before. Now in this case, you are goingto make decision based on probabilistic reasoning. Therefore, whenever you are reoffered by the host to dothe selections among the remaining unopened doors, what is the probability of winning for each of theremaining unopened doors (including your original selection)? Do you want to make a switch based on theprobabilistic reasoning? If you are switching, which…arrow_forward
- A chemistry teacher asked her class to answer the following question: If I put 10 bacteria on the classroom doorknob tonight, how many bacteria will be on the doorknob by the time we come to school tomorrow? In order to answer this question, you need to know a few things: Each bacterium (a single bacteria) can create 2 more bacteria every hour This means that after one hour, the doorknob will have 10 + 10 * 2 = 30 bacteria, since we started with 10 bacteria and each of those created 2 more. This means that after two hours, the doorknob will have 30 + 30 * 2 = 90, since there were 30 bacteria at the beginning of hour two, and during that hour each bacteria created 2 more bacteria. Continuing this pattern, the number of bacteria on the doorknob after N hours is numberOfBacteriaLastHour + numberOfBacteriaLastHour * 2 However, if we wanted to know how many bacteria are alive after 12 hours, we need to know how many bacteria were alive at hour 11. To find out how many bacteria are alive at…arrow_forwardA chess knight, on one turn, moves either two squares vertically and one horizontally, or two horizontally and one vertically. If we consider a knight starting at the point ⟨x, y⟩ in Z × Z, it has eight possible moves, to ⟨x+1,y+2⟩,⟨x+1,y−2⟩,⟨x−1,y+2⟩,⟨x−1,y−2⟩,⟨x+ 2, y + 1⟩, ⟨x + 2, y − 1⟩, ⟨x − 2, y + 1⟩, or⟨x − 2, y − 1⟩. (a) Prove that given any two points ⟨x, y⟩ and ⟨x′, y′⟩ in Z × Z, there is a sequence of knight moves from the first point to the second. (b) Let a and b be different positive naturals. An (a, b)-knight also has eight possible moves, from ⟨x,y⟩ to ⟨x±a,y±b⟩ or ⟨x±b,y±a⟩. What conditions on a and b allow the (a, b)-knight to go from any point in Z × Z to any other? Prove your answer. (c) If a and b do not meet the conditions of part (b), exactly which points can the (a,b)- knight reach from ⟨x, y⟩arrow_forwardWilliams and Tuner have invented a new game called Strip-Pennies. The game is played with their coins and a strip of paper divided into cells. The cells are numbered from the left, starting from 1. Williams and Tuner put some coins at some random cells on the strip, each coin in a cell. They alternatively take their turn to play the game. At each step, a player must take a coin and move it to a cell to the left of it. There is at most one coin in a cell at any time of the game. Of course, a coin cannot jump over another coin. Whoever cannot move loses the game. Tuner takes her turn first. Develop a python code to find out who wins the game, if Tuner could win the game, show her a winning move. If there are several winning moves, show her the winning move that uses the leftmost possible coin. If there are still several moves, show her the move that moves the coin as far as possible to the left. Sample Input: 1 3 135 Sample Output: Tuner wins Move 5 to 4arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole