Sabrina is on a game show and is presented with a drawer containing 10 red socks, 10 blue socks, 10 green socks, and 10 yellow socks. Sabrina is to take socks out of the drawer and put them in a bag. She will win $1 for every sock she puts in the bag, as long as the bag does not contain 5 or more socks of one color and 5 or more socks of another color. For example, if she takes 5 red, 4 blue, 3 green, and 2 yellow socks, she would win $14. However, if she took 5 red, 5 blue, 3 green, and 2 yellow socks, she would not win anything because there are two colors (red and blue) that have 5 or more socks each. What is the most money that Sabrina can win? Enter your answer as a single integer only (no words, no dollar signs). A/ What is the minimum number n such that if n socks are removed from the drawer and put into a bag, that the bag will necessarily contain at least 5 socks of one color and at least 5 socks of another color? Enter n as a single integer, no words. A

Sabrina is on a game show and is presented with a drawer containing 10 red socks, 10 blue socks, 10 green socks, and 10 yellow socks. Sabrina is to take socks out of the drawer and put them in a bag. She will win $1 for every sock she puts in the bag, as long as the bag does not contain 5 or more socks of one color and 5 or more socks of another color. For example, if she takes 5 red, 4 blue, 3 green, and 2 yellow socks, she would win $14. However, if she took 5 red, 5 blue, 3 green, and 2 yellow socks, she would not win anything because there are two colors (red and blue) that have 5 or more socks each. What is the most money that Sabrina can win? Enter your answer as a single integer only (no words, no dollar signs). A/ What is the minimum number n such that if n socks are removed from the drawer and put into a bag, that the bag will necessarily contain at least 5 socks of one color and at least 5 socks of another color? Enter n as a single integer, no words. A

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In this game, one flyand three frogs are placed randomly on a board with the size 7x7.In each iteration, they move randomlywithin the board, and the simulation stops when one of the frogs eats the fly.Fly and frogs are essentially creatures that can move, make noise, and eat. Frogs can move up to 2squares in any direction, and flies can move up to 1. Frogs make the "Croak! Croak!" sound, and fliesmake "ZzzZZz!". Since frogs should not eat their kind, a function of "isEatable" should also beimplemented in decision making. A variable or function to check if the fly is alive is also required as aterminate condition for simulation.In each iteration, an 'f' character represents frogs' position on board, and an '*' character is used torepresent the position of fly. Java Language THIS QUESTION HAS BEEN ANSWERED BUT THE ANSWERS GIVEN ARE IRRELEVANT
he Dice game of “Pig” can be played with the following rules. Roll two six-sided dice. Add the face values together. Choose whether to roll the dice again or pass the dice to your opponent. If you pass, then you get to bank any points earned on your turn. Those points become permanent. If you roll again, then add your result to your previous score, but you run the risk of losing all points earned since your opponent had rolled. Continue to roll as much as you want. However, once a “1” comes up on either die, your score is reduced to 0, leaving you only with points that you have previously "banked." Furthermore, you must pass the dice to your opponent. The first person to 100 points is the winner. When a player rolls two dice, the possible outcomes are as follows: Die #2 Roll Roll a 1 Roll a 2 Roll a 3 Roll a 4 Roll a 5 Roll a 6 Die #1 Roll Roll a 1 0 0 0 0 0 0 Roll a 2 0 4 5 6 7 8 Roll a 3 0 5 6 7 8 9 Roll a 4 0 6 7 8 9 10 Roll a 5 0 7 8 9 10 11 Roll a 6 0 8 9 10…
2) scrooge.py Scrooge McDuck is letting you into his vault full of pennies, nickels, dimes and quarters. He will let you play the following game: you can pick 8 coins at random, and if they sum to at least a dollar, you win, and can keep your money! But if you lose, you don't get to keep the money, AND have to pay Scrooge a dollar. (Each coin you pick is equally likely to be a penny, nickel, dime, or quarter.) Your job: using a simulation, estimate 1. the probability that you win (meaning your coins sum to more than a dollar), and 2. if you play this game over and over, the average amount you will win (where the amount you win in a game could be negative). Here is a bit more direction: you should simulate 100,000 plays of this game. Each simulated play should involve picking 8 different random numbers - each one should be .01, .05, .10, or .25, with each value equally likely - which represent the 8 coins being chosen; these should be summed each time. As you proceed through these…
Task An ATM only has 100, 50 and 20 dollar bills (USD) available to be dispensed. Given an amount between 40 and 10000 dollars (inclusive) and assuming that the ATM wants to use as few bills as possible, determinate the minimal number of 100, 50 and 20 dollar bills the ATM needs to dispense (in that order). Here is the specification for the withdraw method you'll complete: withdraw(amount) Parameters amount: Integer - Amount of money to withdraw. Assume that the amount is always divisible into 100, 50 and 20 bills. Return Value Array (of Integers) - An array of 3 integers representing the number of 100, 50 and 20 dollar bills needed to complete the withdraw (in that order). Constraints 40 ≤ amount ≤ 1000 Can you please help me I will rate! Code is in Python 3.7
You have a pack of 5 randomly numbered cards, which can range from 0-9. You can win if you can produce a higher two-digit number from your cards than your opponent. Return true if your cards win that round. Examples winRound ([2, 5, 2, 6, 9], [3, 7, 3, 1, 2]) → true // Your cards can make the number 96 // Your opponent can make the number 73 // You win the round since 96 > 73 winRound ([2, 5, 2, 6, 9], [3, 7, 3, 1, 2]) → true winRound ([1, 2, 3, 4, 5], [9, 8, 7, 6, 5]) → false winRound ([4, 3, 4, 4, 5], [3, 2, 5, 4, 1]) → false
You have a pack of 5 randomly numbered cards, which can range from 0-9. You can win if you can produce a higher two-digit number from your cards than your opponent. Return true if your cards win that round. Examples winRound ([2, 5, 2, 6, 9], [3, 7, 3, 1, 2]) → true // Your cards can make the number 96 // Your opponent can make the number 73 // You win the round since 96 > 73 winRound ([2, 5, 2, 6, 9], [3, 7, 3, 1, 2]) → true winRound ([1, 2, 3, 4, 5], [9, 8, 7, 6, 5]) → false winRound ([4, 3, 4, 4, 5], [3, 2, 5, 4, 1]) → false
Raccoon Rhapsody is a quest-based game. People who sign up for Raccoon Rhapsody — call them players — have accounts. For each player's account, we keep track of the player's name, address, the date that they joined, a cc# (a valid credit card number we keep on file), and a balance (how much money in Canadian dollars they presently have in their game account). Each player will also have a unique login, which is the account's “name”. It is assumed that a given player will have just one account. A player may create over time any number of avatars. An avatar is an in-game persona. Thus, an avatar belongs to a player (an account). An avatar has a name, gender, look, and skill level. There is a small set of looks available, which may be extended over time; e.g., “wizard”, “faerie”, “footballer”, “shark”, and “raccoon”. The game's virtual word is divided up into a number of realms. On any given day, a player may log in (visit) as one of his or her avatars into one of the realms. (The player…
CHALLENGE ACTIVITY 2.4.1: Gallons of paint needed to paint walls. The number of gallons of paint needed to cover a wall is equal to the wall's total area divided by 3500. The program reads wall area from input, representing a wall's total area. Complete the program to output the number of gallons of paint needed to cover the wall, rounded to five digits after the decimal point Ex 1: If variable wall area is assigned the value 250.0, then the output is: 0.71429 Ex 2: If variable wall area is assigned the value 578.6, then the output is 1.65314 See How to Use zyBooks for info on how our automated program grader works 1 wall area - float(input()) 2 DID!!
. The game consists of a 7x7 board of which 10 of those 49 slots are “stars”. Theobjective of the game is to determine the position of these stars. To help withidentifying 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 itidentifies how many stars are adjacent to the slot. The range of values are from0 (no stars) to 8 (fully surrounded by stars). A Tentaizu puzzle contains only thesenumber hints. Much like other puzzle games like sudoku, there is only onecombination of star positions that is described by the puzzle.2. Your task is to create a solver function for a given Tentaizu puzzle. This functionshould be able to recursively solve the puzzle. Define a function “solve” with theinput variable being a 7x7 list representing the Tentaizu puzzle. The return valueshould be a list of tuples containing the correct coordinates of the 10 stars. Ifthere is no valid solution, it should return an empty…
Lets say you are travelling to an island by your boat.Your boat is lightweight and you need to keep it as light as possible.The boat has cargo capacity of 120kg. Your weight is 85kg. rest you can fill up with food.You want to be light weight but have maximum calorie. You have 5 packs of food(rice flour lentil honey sugar) printed with total calorie on the pack. rice flour lentil honey sugar(20,15,10,5,2kgs)packs have 205,210,215,220,230 cal respectively. What is highest possible calorie you can take with you. 907.35 905.75 875 981
You have a pack of 5 randomly numbered cards, which can range from 0-9. You can win if you can produce a higher two-digit number from your cards than your opponent. Return true if your cards win that round. Examples winRound ([2, 5, 2, 6, 9], [3, 7, 3, 1, 2]) → true // Your cards can make the number 96 // Your opponent can make the number 73 // You win the round since 96 > 73 winRound ([2, 5, 2, 6, 9], [3, 7, 3, 1, 2]) → true winRound ([1, 2, 3, 4, 5], [9, 8, 7, 6, 5]) → false winRound ([4, 3, 4, 4, 5], [3, 2, 5, 4, 1]) → false
A child is running up a n-step staircase and can hop one, two, or three steps at a time. Create a method for counting how many different ways the child can run up the stairs.