1) simonsays.py A walker is standing in the Cartesian plane at the origin (0, 0). The walker then moves in the plane according to directions they receive from another person named Simon. Whenever Simon says simonsaysup, the walker moves +1 unit in the y-direction. Whenever Simon says simonsaysdown, the walker moves -1 unit in the y-direction. Whenever Simon says simonsaysright, the walker moves +1 unit in the x-direction. Whenever Simon says simonsaysleft, the walker moves -1 unit in the x-direction. Write a program that behaves as follows. The program should first ask the user to enter input. The user will input a sequence of words on a single line, separated by spaces, each of which will be either simonsaysup, simonssaysdown, simonsaysleft, or simonsaysright. (You may assume the user complies.) The program should then write all the points that the walker visits (excluding the starting point) into a file named path.txt. Each point should be written on its own line in the file, in the format (x, y) (that means the point should by contained in parentheses, with a comma between the x-coordinate and the y-coordinate).

1) simonsays.py A walker is standing in the Cartesian plane at the origin (0, 0). The walker then moves in the plane according to directions they receive from another person named Simon. Whenever Simon says simonsaysup, the walker moves +1 unit in the y-direction. Whenever Simon says simonsaysdown, the walker moves -1 unit in the y-direction. Whenever Simon says simonsaysright, the walker moves +1 unit in the x-direction. Whenever Simon says simonsaysleft, the walker moves -1 unit in the x-direction. Write a program that behaves as follows. The program should first ask the user to enter input. The user will input a sequence of words on a single line, separated by spaces, each of which will be either simonsaysup, simonssaysdown, simonsaysleft, or simonsaysright. (You may assume the user complies.) The program should then write all the points that the walker visits (excluding the starting point) into a file named path.txt. Each point should be written on its own line in the file, in the format (x, y) (that means the point should by contained in parentheses, with a comma between the x-coordinate and the y-coordinate).

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

Correct answer will be upvoted else downvoted. Computer science. At whatever point a robot arrives at a divider, it pivots right away and proceeds with his ride the other way with a similar speed. At whatever point a few robots meet at a similar integer organize, they impact and detonate into dust. When a robot has detonated, it doesn't slam into some other robot. Note that if a few robots meet at a non-integer facilitate, nothing occurs. For every robot see whether it at any point detonates and print the hour of blast on the off chance that it occurs and −1 in any case. Input The primary line contains a solitary integer t (1≤t≤1000) — the number of testcases. Then, at that point, the depictions of t testcases follow. The primary line of each testcase contains two integers n and m (1≤n≤3⋅105; 2≤m≤108) — the number of robots and the organize of the right divider. The second line of each testcase contains n integers x1,x2,… ,xn (0<xi<m) — the beginning…
PERFECT CUBES AND SQUARES PROBLEMSThe product of some integer with itself is called a perfect square. A perfect cube isthe result of multiplying an integer three times by itself. Assume that a perfectcube greater than 2000 is considered a large perfect cube, the ones between 500and 2000 (inclusive) are medium perfect cubes and the ones below 500 are smallprefect cubes. A perfect cube is associated with a perfect square if the sameinteger is either cubed or squared i.e. the perfect square 4 (2x2) is associated withthe perfect cube 8 (2x2x2)Write a program which:1. Asks the user to enter a perfect square.2. Finds the associate perfect cube.3. Determines whether the found perfect cube is small, medium or large.4. Informs the user if the input is not a perfect square.5. Ask the user is they would like to continue or not. Use a while loop to dothis.For example,Example 1:Enter perfect square: 36216 is a small perfect cubeContinue (Y/N): YEnter perfect square: 4008000 is a large perfect…
Penalty kicks in soccer. Let's consider a situation where a football player has to faceoff the goalkeeper in a penalty kickoff. Standing infront of the goalpost, the Kicker (player 1) has several angle which he could kick the ball to the goalpost. Let's say he could kick the ball in the Left corner of the goalpost, Right corner of the goalpost or shoot straight through the Center. And, same as the player, the goalkeeper (player 2) also has three options to predict which direction the player would kick the ball and try to stop it. This game can be represented using the following 3 x 3 matrix: Left Center Right 63 37 94 95 Left 100' 100 100' 100 100' 100 100. 6 100' 100 91 9 94 Center 100' 100 100' 100 94 6 93 7 60 40 Right 100' 100 100' 100 100' 100 In the above matrix, the payoff of the kicker is the probability that he scores and the payoff of the goalkeeper is the probability that the kicker doesn't score. We know that the total probability of an event is 1, therefore, all the…
Correct answer will be upvoted else Multiple Downvoted. Computer science. The j-th companion can be set before the I-th companion on the photograph if his square shape is lower and smaller than the square shape of the I-th companion. Officially, somewhere around one of the accompanying conditions should be satisfied: hj<hi and wj<wi (the two companions are standing or both are lying); wj<hi and hj<wi (one of the companions is standing and the other is lying). For instance, on the off chance that n=3, h=[3,5,3] and w=[4,4,3]: the main companion can be set before the second: w1<h2 and h1<w2 (one of the them is standing and the other one is lying); the third companion can be put before the second: h3<h2 and w3<w2 (the two companions are standing or both are lying). In different cases, the individual in the closer view will cover the individual behind the scenes. Help Polycarp for every I find any j, with the end goal that the j-th…
Let (M) be the surface given by the following equation. x=y+4z? + 1 Which among the following options is true about (M)? (M) is an elliptic cone and it is represented by the following figure. (M) is an elliptic paraboloid and it is represented by the following figure IMus an eietic parapo.c 900 represented e.c oure. Me an e coc eoresented Nhen
Three prisoners have been sentenced to long terms in prison, but due to over crowed conditions, one prisoner must be released. The warden devises a scheme to determine which prisoner is to be released. He tells the prisoners that he will blindfold them and then paint a red dot or blue dot on each forehead. After he paints the dots, he will remove the blindfolds, and a prisoner should raise his hand if he sees at least one red dot on the other two prisoners. The first prisoner to identify the color of the dot on his own forehead will be release. Of course, the prisoners agree to this. (What do they have to lose?) The warden blindfolds the prisoners, as promised, and then paints a red dot on the foreheads of all three prisoners. He removes the blindfolds and, since each prisoner sees a red dot (in fact two red dots), each prisoner raises his hand. Some time passes when one of the prisoners exclaims, "I know what color my dot is! It's red!" This prisoner is then released. Your problem…
4. Königsberg bridges The Königsberg bridge puzzle is universally accepted as the problem that gave birth to graph theory. It was solved by the great Swiss-born mathematician Leonhard Euler (1707–1783). The problem asked whether one could, in a single stroll, cross all seven bridges of the city of Königsberg exactly once and return to a starting point. Following is a sketch of the river with its two islands and seven bridges: a. State the problem as a graph problem. b. Does this problem have a solution? If you believe it does, draw such a stroll; if you believe it does not, explain why and indicate the smallest number of new bridges that would be required to make such a stroll possible.
The fuel economy of a car is the distance which it can travel on one litre of fuel. The base fuel economy (i.e., its fuel economy when there is only one person - the driver - in the car) of a certain car is MM kilometres per litre. It was also observed that every extra passenger in the car decreases the fuel economy by 11 kilometre per litre. PP people want to take this car for a journey. They know that the car currently has VV litres of fuel in its tank. What is the maximum distance this car can travel under the given conditions, assuming that all PP people always stay in the car and no refuelling can be done? Note that among the PP people is also a driver, i.e., there are exactly PP people in the car. Solve in any programming language
Correct answer will be upvoted else Multiple Downvoted. Computer science. one maneuver, the robot should move one cell to the left or right, given that it doesn't move beyond the field of play. As such, if the robot was in the cell I, it should move to either the cell i−1 or the cell i+1, as long as it lies among 1 and n (endpoints comprehensive). The cells, in the request they are visited (counting the cell the robot is set), together make a decent way. Every cell I has a worth computer based intelligence related with it. Let c0,c1,… ,ck be the succession of cells in a decent way in the request they are visited (c0 is the cell robot is at first positioned, c1 is the cell where the robot is after its first move, etc; all the more officially, ci is the cell that the robot is at after I moves). Then, at that point, the worth of the way is determined as ac0+ac1+⋯+ack. Your errand is to work out the amount of qualities over all conceivable great ways. Since this number can be…
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
For (∃ x)(P(x,b)) Would an example of this being true if the domain was all the Avengers and x was green skin, then "b" being the Hulk would make this true. Am example of this being false would be: If the domain was all integers and x was positive, even integers and "b" was integers greater than zero.
To reduce traffic congestion in downtown Winburg, Indiana, the mayor convinces the city toset up a public transportation system. Bus-only lanes are to be established, and commuterswill be encouraged to “park and ride”; that is, to park their cars in suburban parking lots andthen take buses from there to work and back at cost of one dollar per ride. Each bus is tohave a fare machine that accepts only one dollar bills. Passengers insert a bill into the slotsas they enter the bus. Sensors inside the fare machine scan the bill, and the software in themachine uses an image recognition algorithm to decide whether the passenger has indeedinserted a valid dollar bill into the slot. It is important that the fare machine be accuratebecause, once the news gets out that any piece of paper will do the trick, fare income willplummet to effectively zero. Conversely, if the machine regularly rejects valid dollar bills,passengers will be reluctant to use the buses. In addition, the fare machine must be…