
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Write a function testCraps using Python that accepts a positive integer n as an input, simulates n games and craps, and returns the fraction of games the player won.
- the testCraps function should not make dice rolls directly, instead ...
- testCraps function should call the craps function repeatedly and keep track of the results
- if you your craps and testCraps function simulate the game correctly without any extra rolls, you should be able to hit the results below exactly
Sample results examples:
>>> random.seed(0)
>>> testCraps(10000)
0.5
>>> random.seed(1)
>>> testCraps(10000)
0.4921
>>> [(i,random.seed(i),testCraps(100*i)) for i in range(1,10)]
[(1, None, 0.49), (2, None, 0.46), (3, None, 0.47333333333333333), (4, None,
0.5125), (5, None, 0.476), (6, None, 0.47333333333333333), (7, None,
0.4514285714285714), (8, None, 0.48), (9, None, 0.4855555555555556)]
Please only give to me the final code or "tool" that would generate any of the above results. Thanks!
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images

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
- //Write a function that loops through and console.log's the numbers from 1 to 100, except multiples of three, log (without quotes) "VERY GOOD" instead of the number, for the multiples of five, log (without quotes) "SUPER AWESOME". For numbers which are multiples of both three and five, log (without quotes) "VERY GOOD SUPER AWESOME" Console log out: 12VERY GOOD4SUPER AWESOMEVERY GOOD78VERY GOODSUPER AWESOME11VERY GOOD1314VERY GOOD SUPER AWESOME1617VERY GOOD19SUPER AWESOMEVERY GOOD2223VERY GOODSUPER AWESOME26VERY GOOD2829VERY GOOD SUPER AWESOMEarrow_forwardWrite a python program with the following functions:1. the function factorial_loop(num) that takes an integer num and returns the value of the factorial of num written as num!, where num! = num * (num-1) * (num-2) * … * 2 * 1. This function must use a loop (iteration) to compute the value of num!.2. the function factorial_recursive(num) that takes an integer num and returns the value of the factorial of num (i.e., num!) as defined above. This function must use a recursive algorithm to compute the value of num!.arrow_forwardIN JAVA SCRIPT Create a function that returns the thickness (in meters) of a piece of paper after folding it n number of times. The paper starts off with a thickness of 0.5mm. Examples numLayers (1) "0.001m" // Paper folded once is 1mm (equal to 0.001m) numLayers (4) "0.008m" // Paper folded 4 times is 8mm (equal to 0.008m) numLayers (21) "1048.576m" // Paper folded 21 times is 1048576mm (equal to 1048.576m) (Ctrl)arrow_forward
- Write a function that finds and returns the smallest value of n for which: 1 + 2 + 3 + ... + n is greater than or equal to max (where max is a number input from the user). You can use the following prototype: int SmallestValue(int); In the main program be sure to declare all variables and show the call. Be user friendly! Sample run: What is the max number: 23 The smallest value of n where the sum of 1 to n is greater or equal to 23 is: 7 Again? Y What is the max number: 12 The smallest value of n where the sum of 1 to n is greater or equal to 12 is: 5 Again? N in c++ please use basic coding I'm not too advancedarrow_forwardYou shouldn't date someone whose age is less than half your own age plus 7. Write a boolean-valued function can_date(age1, age2) that takes the ages of two people and return True if they can date. The ages are not in any particular order - the bigger one may be either first or last.arrow_forwardUse Python Write a function, say_spam(n); it takes an integer parameter n and prints "Spam!" n times in response. You should assume n > 0 for this function. Hint: Use a simple for loop with a print statement in the body of the loop. For example: Test Input Result say_spam(1) Spam! say_spam(2) say_hello(3) Spam! Spam! say_spam(5) Spam! Spam! Spam! Spam! Spam!arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education