(or not be selected to run). In other words, remaining code should be wrapped in (a) branch structure(s) to run or not run according to user inputs. Sample Runs: Test your program as you go for all of the possible outcomes described above! Don't wait until the end to test! There are lots of possible paths/outcomes. Sample Run 1: Enter your full name: Hannah Hillberg Please enter up to the first four letters of your first name: bot bot bot I can't follow instructions We cannot trust that you are not a robot. Good bye. Sample Run N: Please enter your first and last name: Hannah Hillberg Please enter up to the first four letters of your first name: hann You are being directed to Operator 1... Hello, I'm Operator 1! Please enter your card number: 4567741236985462 Thank you for setting up your Visa card. Please enter a PIN: 4568 Please re-enter PIN: 4568 PIN saved. Your account is activated. Thank you! Submission Submit your entire Lab6 Blue] project in a single zipped up folder to Canvas before the deadline.

(or not be selected to run). In other words, remaining code should be wrapped in (a) branch structure(s) to run or not run according to user inputs. Sample Runs: Test your program as you go for all of the possible outcomes described above! Don't wait until the end to test! There are lots of possible paths/outcomes. Sample Run 1: Enter your full name: Hannah Hillberg Please enter up to the first four letters of your first name: bot bot bot I can't follow instructions We cannot trust that you are not a robot. Good bye. Sample Run N: Please enter your first and last name: Hannah Hillberg Please enter up to the first four letters of your first name: hann You are being directed to Operator 1... Hello, I'm Operator 1! Please enter your card number: 4567741236985462 Thank you for setting up your Visa card. Please enter a PIN: 4568 Please re-enter PIN: 4568 PIN saved. Your account is activated. Thank you! Submission Submit your entire Lab6 Blue] project in a single zipped up folder to Canvas before the deadline.

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

python: numpy def not_stealing(items): """ While you're shopping, you notice that some items you've picked up do not have a price tag. Do you steal them? NO! Instead, you decide to be a good person and replace them with another item that does have a price. - Items with no price will have a value of np.nan. - Replace np.nan values with a random price between $5 and $9, inclusive. - Return the average of the new prices in the array, rounded to 2 decimal places. - DO NOT REMOVE random.seed(1) Args: items (np.array) Returns: float >> items = np.array([4.63, np.nan, 3.78, 7.12, 12.35, 7.19, np.nan, 1.50, 2.41]) >> not_stealing(items) 5.66 """ #DO NOT REMOVE# random.seed(1) ############## # items = np.array([4.63, np.nan, 3.78, 7.12, 12.35, 7.19, np.nan, 1.50, 2.41]) # print(not_stealing(items)) # items = np.array([np.nan, np.nan, 6.18, np.nan, 18.42, 2.67, 9.14, np.nan, 14.32]) #…
Use Python & Don't use any python Library. You can use Random.randint() only. 3. Suppose you have been hired to develop a musical chair game. In this game there will be 7 participants and all of them will be moving clockwise around a set of 7 chairs organized in a circular manner while music will be played in the background. You will control the music using random numbers between 0-3.lf the generated random number is 1, you will stop the music and if the number of participants who are still in the game is n, the participants at position (n/2) will be eliminated. Each time a participant is eliminated, a chair will be removed and you have to print the player names who are still in the game. The game will end when there will be only one participant left. At the end of the game, display the name of the winner. [Hint: You will need to invoke a built-in method to generate a random number between 0 (inclusive) to 3 (inclusive)]
Implement programs involving the use of while, do..while and for loop statement. Objectives: Topics Covered: Implementing programs using loops. Description FRIDAY THE 13TH When will Friday the 13th occur in 1990? Write a program that will find all months in 1990 in which the 13th falls on a Friday. You need to know the following. 1. January 1, 1990 was on a Monday. 2. September, April, June, and November have thirty days, all the rest have 31 except for February which has 28 except in leap years when it has 29. 3. 1990 is not a leap year. Note: To make it fair for everyone, you may not use any built-in date functions from your computer language. Sample Output if Applicable Sample Run In 1990, Friday the 13th occurs in the months: APRIL
Correct answer will be upvoted else downvoted. You are playing the game "Orchestrating The Sheep". The objective of this game is to make the sheep line up. The level in the game is depicted by a line of length n, comprising of the characters '.' (void space) and '*' (sheep). In one action, you can move any sheep one square to the left or one square to the right, if the relating square exists and is vacant. The game finishes when the sheep are arranged, that is, there ought to be no vacant cells between any sheep. For instance, assuming n=6 and the level is depicted by the string "**.*..", the accompanying game situation is conceivable: the sheep at the 4 position moves to one side, the condition of the level: "**..*."; the sheep at the 2 position moves to one side, the condition of the level: "*.*.*."; the sheep at the 1 position moves to one side, the condition of the level: ".**.*."; the sheep at the 3 position moves to one side, the condition of the level: ".*.**.";…
Write a tester program that counts and displays the number of iterations of the following loop: while problemSize > 0:problemSize = problemSize // 2 After you have write the code. Run the program you created using problem sizes of 1000, 2000, 4000, 10,000, and 100,000. As the problem size doubles or increases by a factor of 10, what happens to the number of iterations?
WATERSORT PROGRAM - JAVA •The aim of Part 2 is to set up the puzzle for the player to solve in Part 3. IMPORTANT NOTE: We are not going to start with 2 empty bottles, but rather with 8 empty slots spread over the 5 bottles as explained in the intro video. Start with 5 empty bottles. Use a random number generator to fill bottles one slot at a time with the colours while keeping 8 slots empty – there is a total of 5*4 = 20 slots – so if we will 12 slots, 8 are free. •Advantage: Easy to create a puzzle with a good mix •Disadvantage: With more colours and bottles and only 2 open bottles for more advanced versions of the game, the result might not be solvable. Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. •Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. •Disadvantage: It is hard to develop an algorithm which…
One way to put a list of people into teams is by counting off. For example, if the list of people is: ['paul', 'francois', 'andrew', 'sue', 'steve', 'arnold', 'tom', 'danny', 'nick', 'anna', 'dan', 'diane', 'michelle', 'jeremy', 'karen'] and the number of teams desired is four, then you assign the people to teams 0, 1, 2, 3, 0, 1, 2, 3, etc. like this: [['paul', 'steve', 'nick', 'michelle'], ['francois', 'arnold', 'anna', 'jeremy'], ['andrew', 'tom', 'dan', 'karen'], ['sue', 'danny', 'diane']] Write the code for the following function. Do not assume that the list of people will divide evenly into the desired number of teams. If the list of people does not divide evenly into the desired number of teams, the teams will simply have unequal sizes. Do not assume that the number of people is at least as large as the number of teams. If there aren't enough people to cover the teams, some (or even all) teams will simply be empty. Hint: The range function will be very helpful. def form_teams…
[Python Language] Using loops of any kind, lists, or Sets is not allowed. Sloan’s Book Collection Sloan loves reading books. She recently started reading an AI generated series called “Harry Trotter”. Sloan is collecting books from the series at her nearest bookstore. Since the series is AI generated, the publishers have produced an infinite collection of the books where each book is identified by a unique integer. The bookstore has exactly one copy of each book. Sloan wants to buy the books in the range [l,r], where l ≤ r. As an example, the range [−3,3] means that Sloan wants to buy the books − 3, − 2, − 1, 0, 1, 2, and 3. Pam also loves the series (or maybe annoying Sloan– who knows, really), and he manages to sneak into the bookstore very early to buy all of the books in the range [d,u], where d ≤ u. When Sloan later visits, sadly she will not find those books there anymore. For example, if Sloan tries to buy books [−2,3] and Pam has bought books [0,2], Sloan would only receive…
Use JAVA CARD GRAPHICS to create a card game in which the dealer shuffles the deck and deals 13 cards to the player. The player sorts her hand and says whether it includes the King of Hearts. Repeat 4 times so all the cards are dealt eventually. Internally, the player should return true or false without writing to the console. In response, the dealer should write on the console, "You won!" or "You loose again." Also create a unit test for the win and loose cases.
please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1
why after run have a lot error?
(This is for devc++ but I use mindmap from Cengage. I know it a little different. If you can't use Cengage, I suggest devc++ version 5.11) One way to determine how healthy a person is, is by measuring the body fat of the person. The formulas to determine the body fat for female and male are as follows: Body fat formula for women: A1 = (body weight X 0.732) + 8.987 A2 = wrist measurement (at fullest point) / 3.140 A3 = waist measurement (at navel) X 0.157 A4 = hip measurement (at fullest point) X 0.249 A5 = forearm measurement (at fullest point) X 0.434 B = A1 + A2 - A3 - A4 + A5 Body fat = body weight - B Body fat percentage = body fat X 100 / body weight Body fat formula for men: A1 = (body weight X 1.082) + 94.42 A2 = waist measurement X 4.15 B = A1 - A2 Body fat = body weight - B Body fat percentage = body fat X 100 / body weight Instructions Write a program to calculate the body fat of a person. Prompt the user to input: Their gender ('m' or 'M' for male, 'f' or 'F' for…