C++ How to Program (10th Edition)
10th Edition
ISBN: 9780134448237
Author: Paul J. Deitel, Harvey Deitel
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
[Fish
Tank]
You play with a clown fish that has an initial size so. The fish can eat other fish in a tank organized in m columns and n rows. The fish at column i and row j has a positive size si,j.
When your fish eats another fish, it grows by that amount. For example, if your clown fish has a size of 10 and eats a fish of size 5, it becomes of size 15. You cannot eat a fish that
is bigger than your size. The game starts by eating any fish in the first (left-most) column that is not bigger than yours. After that, you advance one column at a time by moving
right. You have only three allowed moves. You either stay at the same row, move one row higher or one row lower. You will always move to the right. Thus, you will make exactly
m moves to advance from left to right. Your goal is to exit the fish tank from the right with the biggest possible size.
The figure below shows an example with the best answer highlighted. In this case, the final fish size is 71 (10+8+7+24+22). You are required…
C++
Create a Blackjack (21) game. Your version of the game will imagine only a SINGLE suit of cards, so 13 unique cards, {2,3,4,5,6,7,8,9,10,J,Q,K,A}. Upon starting, you will be given two cards from the set, non-repeating. Your program MUST then tell you the odds of receiving a beneficial card (that would put your value at 21 or less), and the odds of receiving a detrimental card (that would put your value over 21). Recall that the J, Q, and K cards are worth ‘10’ points, the A card can be worth either ‘1’ or ‘11’ points, and the other cards are worth their numerical values.
FOR YOUR ASSIGNMENT: Provide two screenshots, one in which the game suggests it’s a good idea to get an extra card and the result, and one in which the game suggests it’s a bad idea to get an extra card, and the result of taking that extra card.
(Learning Objective: students will be able to apply their knowledge of the built-in random package to generate simulations of simple phenomena.)
Write a function:
• dicesim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep
track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured.
Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.dicesim(6,6,10000)) resulted in:
[0.
0.
0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281]
or displayed using the code from Section 16.1.1.:
PMF of X
Note: you should submit a file with only the standard comments at the top and the function. The grading scripts will then import the file for testing.
Chapter 9 Solutions
C++ How to Program (10th Edition)
Ch. 9 - Prob. 9.3ECh. 9 - (Enhancing Class Tina) Provide a constructor...Ch. 9 - (Complex class) Create a class called complex for...Ch. 9 - (Rational Class) Create a class culled Rational...Ch. 9 - (Enhancing Class Tine) Modify the Time class of...Ch. 9 - Prob. 9.8ECh. 9 - Prob. 9.9ECh. 9 - Prob. 9.10ECh. 9 - (Rectangle Class) Create a class Rectangle with...Ch. 9 - (Enhancing Class Rectangle) Create a more...
Ch. 9 - Prob. 9.13ECh. 9 - Prob. 9.14ECh. 9 - (TicTacToe Class) create a class TicTacToe that...Ch. 9 - Prob. 9.16ECh. 9 - (Constructor overloading) Can a Time class...Ch. 9 - (constructor or destructor) What happens when a...Ch. 9 - (Date Class Modification) Modify class Date in...Ch. 9 - (Savings Account Class) Create a Savings Account...Ch. 9 - (IntegerSet Class) Create class IntegerSet for...Ch. 9 - (Time Class Modification) It would be perfectly...Ch. 9 - Prob. 9.23ECh. 9 - (Card Shuffling and Dealing) Modify the program...Ch. 9 - Prob. 9.25ECh. 9 - (Project: Card Shuffling and Dealing) Modify the...Ch. 9 - (Project: Card Shuffling and Dealing) Modify the...Ch. 9 - (Project: Emergency Response Class) The North...
Knowledge Booster
Similar questions
- Modify the below code according to what is asking you to do. Show your modified code in a picture, please.arrow_forward***in python only*** use turtle function Define the concentricCircles function such that: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the largest (i.e., outermost) circle, and then every other circle out to the edge alternates between that color and the 'other' color. The difference between the radii of subsequent circles is always the same, and this difference is also equal to the radius of the smallest circle. Put another way: the distance between the inside and outside of each ring is the same. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters Use any kind of loop Within the definition of concentricCircles with 4 parameters, use any kind of loop in at least one place. Call…arrow_forward"""3. Write a function validSolution/ValidateSolution/valid_solution()that accepts a 2D array representing a Sudoku board, and returns trueif it is a valid solution, or false otherwise. The cells of the sudokuboard may also contain 0's, which will represent empty cells.Boards containing one or more zeroes are considered to be invalid solutions.The board is always 9 cells by 9 cells, and every cell only contains integersfrom 0 to 9. (More info at: http://en.wikipedia.org/wiki/Sudoku)""" # Using dict/hash-tablefrom collections import defaultdict def valid_solution_hashtable(board): for i in range(len(board)): dict_row = defaultdict(int) dict_col = defaultdict(int) for j in range(len(board[0])): value_row = board[i][j] value_col = board[j][i] if not value_row or value_col == 0: return False if value_row in dict_row: return False else: dict_row[value_row] += 1.arrow_forward
- Q2) (Perfect Numbers) An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. Write a function perfect that determines if parameter number is a perfect number. Use this function in a program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. Challenge the power of your computer by testing numbers much larger than 1000.arrow_forward*68. What is the return value of f (p, p), if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f(int &x, int c) { c = c 1; if X = X + 1; return f(x, c) } (a) 3024 (c==0) return 1; * X; (b) 6561 (c) 55440 (d) 161051arrow_forwardPythonarrow_forward
- Programming Language : R programming (R Studio) A twin prime is a prime that has a prime gap of two. Sometimes the term twin prime isused for a pair of twin primes. For example, the five twin prime pairs are (3, 5), (5, 7),(11, 13), (17, 19) and (29, 31). Write a function that returns the number of all twin primepairs between 1 and a given number n.arrow_forwarduse pythonarrow_forward(Python matplotlib or seaborn) CPU Usage We have the hourly average CPU usage for a worker's computer over the course of a week. Each row of data represents a day of the week starting with Monday. Each column of data is an hour in the day starting with 0 being midnight. Create a chart that shows the CPU usage over the week. You should be able to answer the following questions using the chart: When does the worker typically take lunch? Did the worker do work on the weekend? On which weekday did the worker start working on their computer at the latest hour? cpu_usage = [ [2, 2, 4, 2, 4, 1, 1, 4, 4, 12, 22, 23, 45, 9, 33, 56, 23, 40, 21, 6, 6, 2, 2, 3], # Monday [1, 2, 3, 2, 3, 2, 3, 2, 7, 22, 45, 44, 33, 9, 23, 19, 33, 56, 12, 2, 3, 1, 2, 2], # Tuesday [2, 3, 1, 2, 4, 4, 2, 2, 1, 2, 5, 31, 54, 7, 6, 34, 68, 34, 49, 6, 6, 2, 2, 3], # Wednesday [1, 2, 3, 2, 4, 1, 2, 4, 1, 17, 24, 18, 41, 3, 44, 42, 12, 36, 41, 2, 2, 4, 2, 4], # Thursday [4, 1, 2, 2, 3, 2, 5, 1, 2, 12, 33, 27, 43, 8,…arrow_forward
- 58arrow_forwardC++ please help I will give you a good rating!!!!! Implement the following function by using subsets() developed in step 1. /* Check if given value given be expressed by K or less coins chosen from the given set of coins @param coins: all coins we can choose from @param first, last: specify the range of coins to choose from, i.e., coins[first…last] @param value: the value to express @param K: the maximum # of coins to use @precondition: all coins have positive values @postcondition: return true of false depending on the checking result */ bool CoinChangeK (const vector<int> & coins, int first, int last, int value, int K) Hint: call subsets( ) function to return all possible subsets, and then go through them to see if any subsets with size <=K as a sum equal to value or not. Code #include <iostream>#include <algorithm>#include <vector>using namespace std; void…arrow_forwardC++ please help I will give you a good rating!!!!! Implement the following function by using subsets() developed in step 1. /* Check if given value given be expressed by K or less coins chosen from the given set of coins @param coins: all coins we can choose from @param first, last: specify the range of coins to choose from, i.e., coins[first…last] @param value: the value to express @param K: the maximum # of coins to use @precondition: all coins have positive values @postcondition: return true of false depending on the checking result */ bool CoinChangeK (const vector<int> & coins, int first, int last, int value, int K) Hint: call subsets( ) function to return all possible subsets, and then go through them to see if any subsets with size <=K as a sum equal to value or not. CODE #include <iostream> #include <algorithm> #include <vector> using namespace std; void…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning