Absolute C++
6th Edition
ISBN: 9780133970784
Author: Walter Savitch, Kenrick Mock
Publisher: Addison-Wesley
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 4, Problem 12PP
In the land of Puzzlevania, Aaron, Bob, and Charlie had an argument over which one of them was the greatest puzzle-solver of all time. To end the argument once and for all, they agreed on a duel to the death. Aaron was a poor shot and only hit his target with a probability of 1/3. Bob was a bit better and hit his target with a probability of 1/2. Charlie was an expert marksman and never missed. A hit means a kill and the person hit drops out of the duel. To compensate for the inequities in their marksmanship skills, the three decided that they would fire in turns, starting with Aaron, followed by Bob, and then by Charlie. The cycle would repeat until there was one man standing. That man would be remembered for all time as the Greatest Puzzle-Solver of All Time. An obvious and reasonable strategy is for each man to shoot at the most accurate shooter still alive, on the grounds that this shooter is the deadliest and has the best chance of hitting back.
Write a
An alternate strategy is for Aaron to intentionally miss on his first shot. Modify the program to accommodate this new strategy and output the probability of winning for each contestant. What strategy is better for Aaron, to intentionally miss on the first shot or to try and hit the best shooter?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In a classroom election, two presidential candidates, namely, Lisa and Teddy, both garnered the same number of total votes. As such, they decided to play a custom dice game to determine the winner of the election. In this game, a player needs to roll a pair of dice. Teddy will win the game if the sum is odd whereas Lisa will be declared winner if the sum results to even. However, prior to the start of the game, Teddy complained that the custom dice game is biased because according to him, the probability of an even result is 6/11, and for odd - only 5/11. Verify Teddy's claim and evaluate the fairness of the game.
CLEAR SOLUTION
Jack and Jill will play a game called Hotter, Colder. Jill chooses a number from 0 to 100, and Jack makes repeated attempts to guess it. For each guess, Jill will respond with:
hotter - if the current guess is closer to her number than the previous guess is
colder - if the current guess is farther to her number than the previous guess is
same - if the current guess is as far (to her number) as the previous guess is
For Jack’s first guess, since there is no previous guess yet, Jill will just answer same.
Describe an algorithm or a systematic approach that Jack can follow to win the games faster (fewer guesses).
Example: Jill chooses number 40. Note: Jack can guess any number from 0 to 100 at any point of the game.
Jack guesses 100. Jill responds same (first guess)
Jack guesses 60. Jill responds hotter (60 is closer to 40 than previous guess 100)
Jack guesses 80. Jill responds colder (80 is farther from 40 than previous guess 60)
Jack guesses…
Tom and Jerry recently saw the movie inception. Inspired by that movie they decided to play a complicated game.
Analogous to the movie inception, Jerry is the dreamer and Tom is the thief who enters Jerry's dream in order to extract the secret code. Tom wins the game if he is able to extract the secret code, else Jerry wins the game. Note that here Tom has to extract the idea from Jerry.
Tom after performing a lot of mathematical analysis finally ended up to one last step for which he requires a little computation. He has got an array of positive integers. If atleast one of them is prime, he will be able to crack the secret code and win the game, else Jerry wins the game.
Input
The first line contains a single integer t (1≤t≤106) the number of test cases. Description of each test case is as follows.
The first line of each test case contains a single integer n (1≤n≤2⋅106) the number of elements in the array.
The second line of each test case contains n positive integers…
Chapter 4 Solutions
Absolute C++
Ch. 4 - Write a program that converts from 24-hour...Ch. 4 - The area of an arbitrary triangle can be using the...Ch. 4 - Write a program that tells what coins to give out...Ch. 4 - Write a program that will read in a length in feet...Ch. 4 - Write a program like that of the previous exercise...Ch. 4 - (You should do the previous two programming...Ch. 4 - Write a program that will read a weight in pounds...Ch. 4 - Write a program like that of the previous exercise...Ch. 4 - (You should do the previous two programming...Ch. 4 - (You should do Programming Projects 4.6 and 4.9...
Ch. 4 - You are a contestant on a game show and have won a...Ch. 4 - In the land of Puzzlevania, Aaron, Bob, and...Ch. 4 - You would like to know how fast you can run in...Ch. 4 - Your time machine is capable of going forward in...Ch. 4 - Write a function named convertToLowestTerms that...Ch. 4 - Consider a text file named scores. txt that...Ch. 4 - Given the scores . txt file described in...Ch. 4 - Write a function named sort that takes three...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
F414. Determine the magnitude of the moment of the force F = {300i 200j + 150k} N about the OA axis.
INTERNATIONAL EDITION---Engineering Mechanics: Statics, 14th edition (SI unit)
Define a class called Diamond that is derived from either the class ShapeBasics (Listing 8.12) or the abstract ...
Java: An Introduction to Problem Solving and Programming (8th Edition)
Assume that both of the inputs in the following circuit are 1. Describe what would happen if the upper input we...
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Write an if-else statement that assigns 1 to x when y is equal to 100. Otherwise, it should assign 0 to x.
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
T F: A variables scope is the time during which the variable exists in memory.
Starting Out With Visual Basic (8th Edition)
Big data Big data describes datasets with huge volumes that are beyond the ability of typical database manageme...
Management Information Systems: Managing The Digital Firm (16th Edition)
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
- A coin is flipped 8 times in a row (assume all outcomes are equally likely). For each of the following questions, you should write your answer as an expression. Do not give the final numeric value. For example, you should write C(4,2)/24 instead of 0.375. Q1.1 What is the probability that it lands on heads exactly four times?arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. The I-th stage is named with an integer artificial intelligence (0≤ai≤n−i). At the point when the character is remaining on the I-th stage, the player can move the character to any of the j-th stages where i+1≤j≤i+ai. If the character is on the I-th stage where ai=0 and i≠n, the player loses the game. Since Gildong thinks the current game isn't adequately hard, he needs to make it considerably harder. He needs to change a few (perhaps zero) names to 0 so that there remains precisely one way of winning. He needs to alter the game as little as could really be expected, so he's requesting you to see as the base number from stages that ought to have their names changed. Two different ways are unique if and provided that there exists a stage the character gets to in one manner however not in the alternate manner. Input Each test contains at least one experiments. The main line contains the number of…arrow_forwardA band of thieves comes up with a series of rules for hiding their loot so that they are always able to find it. The rules are as follows: If the house is next to a lake, then the treasure does not go in the kitchen If the tree in the front yard is an elm, then the treasure is in the kitchen The tree in the front yard is an elm or the treasure is buried under the flagpole If the tree in the backyard is an oak then the treasure is in the garage. You observe that the house where the treasure is hidden is next to a lake. Where is the treasure? discrete matharrow_forward
- A robot starts on a point marked “A” on a rectangular grid of points. The starting point is always the top left point on the grid. The robot can move left, right, up or down, moving from one point to the next. By moving in steps going left, right, up or down, the robot would like to reach a point marked “B”, which is always the bottom right point in the grid. Sometimes, points are marked as “x”, and the robot is not allowed to visit them at all. A robot is never allowed to visit a point more than once. In how many ways can the robot move from A to B and visit all points along the way? For example, in the following grid, represented in text as A . . . . B there is only one path from A to B: In the following grid, represented in text as A . . x x B there is still only one path (we're lucky because of the two x's): However, in the grid A . . . x B there are no ways for the robot to move from A to B and visit all points that are not marked with “x”. Write a single…arrow_forwardcan you help me for exercise 6 with two pointsarrow_forwardFrog Contest On their way down the river, Jojo and Lili saw two frogs each in position X1and X2. The two frogs are seen jumping happily towards the same direction that is come to Jojo. After watching the two frogs, Jojo and Lili saw that the speed the two frogs are different. The first frog to start jumping from position X1 has a speed of V1, while the second frog that starts to jump from position X2 has a speed of V2. Jojo guess that "YES" both frogs will be in the same position in a certain time T, while Bibiguessing "NO" the two frogs will never be in the same position in timethe. Help Jojo and Lili calculate the frog's movements to determine whether the guess they are right. Input FormatThe first line of input consists of a series of integers namely X1, V1, X2, V2, T.X1 and V1 are the initial position and jump speed per second of the first frog.X2 and V2 are the starting position and jump speed per second of the second frog.T is the second when the frog jumps. Output FormatA string…arrow_forward
- Bob and Alice want to send each other secret messages that no one else will have access to. They have decided that they will use a locked box to hold the secret messages, and they will drop the box off in each other’s mailboxes. The problem is that if they use a combination lock, they will have to send the combination to the box and someone might intercept it. Here are the materials they have access to: A box that can be locked with a combination lock Two combination locks (the kinds that click shut that you might use on a school locker) Paper Pencil Describe a protocol Bob and Alice can set up to deliver these messages securely.arrow_forwardAs we've previously seen, equations describing situations often contain uncertain parameters, that is, parameters that aren't necessarily a single value but instead are associated with a probability distribution function. When more than one of the variables is unknown, the outcome is difficult to visualize. A common way to overcome this difficulty is to simulate the scenario many times and count the number of times different ranges of outcomes occur. One such popular simulation is called a Monte Carlo Simulation. In this problem-solving exercise you will develop a program that will perform a Monte Carlo simulation on a simple profit function. Consider the following total profit function: PT=nPv Where Pr is the total profit, n is the number of vehicles sold and P, is the profit per vehicle. PART A Compute 5 iterations of a Monte Carlo simulation given the following information: n follows a uniform distribution with minimum of 1 and maximum 10 P, follows a normal distribution with a mean…arrow_forwardCorrect answer will be upvoted else downvoted. Computer science. You have w white dominoes (2×1 tiles, the two cells are hued in white) and b dark dominoes (2×1 tiles, the two cells are shaded in dark). You can put a white domino on the board in case both board's cells are white and not involved by some other domino. Similarly, you can put a dark domino if the two cells are dark and not involved by some other domino. Would you be able to put all w+b dominoes on the board if you can put dominoes both on a level plane and in an upward direction? Input The main line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains three integers n, k1 and k2 (1≤n≤1000; 0≤k1,k2≤n). The second line of each experiment contains two integers w and b (0≤w,b≤n). Output For each experiment, print YES in case it's feasible to put all w+b dominoes on the board and negative, in any case. You might print each letter…arrow_forward
- The fairies in Fairyland are getting ready to compete in the Fly High game where the fairy that flies the highest isdeclared a winner. The number of fairies participating in this competition is not known ahead of time. Before flyinghigh, each fairy goes through a pixie dust machine and gets sprinkled with the pixie dust. The pixie dust allows themto fly and perform their special talent high up in the sky. Pixie dust can be of any one of the 4 colours (red, blue,yellow, and green) and each colour has a dust strength in the following ranges (dust strength determines roughlyhow high a fairy can fly):Colour StrengthRed 40 - 49Blue 30 - 39Green 20 - 29Yellow 10 - 19Write a Python program, in a file called fairyland.py, to include the following functions:• function main that repeatedly obtains a fairy’s name (from the user) and, using other functions, determinesthe colour of pixie dust that the fairy has been dusted with, the height of the fairy’s flight (based on thatcolour), and keeps…arrow_forwardYou visit an island of Knights, Knaves, and Spies. Knights always tell the truth, Knaves always lie, while Spies can say anything (truth or lie). You meet three inhabitants, John, Bill, and Tom. One is a Knight, one is a Knave, and one is a Spy. John says: “I am a knight", Bill says: “John is telling the truth," and Tom says: “I am the spy!". Determine what type of people John, Bill, and Tom arearrow_forwardAn experiment with 10 participants was conducted to measure simple reaction time: the time to press a button in response to a visual stimulus (a light). This was a pilot study, so only five participants were tested. The reaction times in milliseconds for the five participants over 10 trials are shown below. Trial Susan Abdul Krisha Sam Sara T1 326 311 242 270 447 T2 395 256 184 492 429 T3 383 280 432 377 452 T4 337 344 454 315 556 T5 463 345 304 368 483 T6 194 287 385 302 307 T7 303 290 225 184 442 T8 235 266 425 483 319 T9 180 134 371 269 493 T10 484 265 293 312 375arrow_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
6 Stages of UI Design; Author: DesignerUp;https://www.youtube.com/watch?v=_6Tl2_eM0DE;License: Standard Youtube License