• If x = -0.8 , then [x – 1] =%3D1. -22. -13. -0.84. 11 O2 O3 O4 O

Answered: • If x = -0.8 , then [x – 1] = 1. -2 2.…

Engineering

Computer Science

• If x = -0.8 , then [x – 1] = 1. -2 2. -1 3. -0.8 4. 1 1 2 O 3 4

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter4: Making Decisions

Section: Chapter Questions

Problem 8E: In the game Rock paper Scissors, two players simultaneously choose one of three options: rock,...

See similar textbooks

Similar questions

I want to add one green leaf on the right side of the flower how can I do this?? What should I add to my code for this? Thanks for help My code n=800;r=linspace(0,1,n);theta=linspace(0,2*pi,n);[R,THETA]=ndgrid(r,theta);% define the number of petals we want per cycle. Violets have 5!petalNum=5;x = 1 - (1/2)*((5/4)*(1 - mod(petalNum*THETA, 2*pi)/pi).^2 - 1/4).^2;% update the formula for phi to stop the spiralling effectphi = (pi/2)*exp(-2*pi/(8*pi));y = 1.95653*(R.^2).*(1.27689*R - 1).^2.*sin(phi);R2 = x.*(R.*sin(phi) + y.*cos(phi));X=R2.*sin(THETA);Y=R2.*cos(THETA);Z=x.*(R.*cos(phi)-y.*sin(phi));% color code for blueviolet RGB 138,43,226% Indigo rgb value (75,0,130)mapSize=20;blue_map=linspace(138,75,mapSize)';blue_map(:,2)=linspace(43,0,mapSize)';blue_map(:,3)=linspace(226,130,mapSize)';% and a pretty bit in the middlegold_map=[255 215 0; 250 210 0];% combine to form a full flower mapviolet_map=[gold_map; blue_map];% Now lets plot it and try and pick an attractive…
It will simulate the diffusion of heatthrough a square metal plate. The plate starts off at 0 deg., but the 4 ×4 pixel square in the centeris kept at 100 deg.Now a cell in the interior has 4 neighbors: the upper, lower, left, and right neighbor. The updateformula for an interior point (other than the center square) is therefore given by:u′i,j = ui,j + k((ui,j+1 −ui,j ) + (ui,j−1 −ui,j ) + (ui−1,j −ui,j ) + (ui+1,j −ui,j ))= ui,j + k(ui,j+1 + ui,j−1 + ui−1,j + ui+1,j −4ui,j )The boundaries have to be updated separately using 8 different equations: 4 for each of the edges,and 4 for each corner. Here is the update formula for a cell on the top edge that is not on a corner:u′i,n−1 = ui,n−1 + k((ui,n−2 −ui,n−1) + (ui−1,n−1 −ui,n−1) + (ui+1,n−1 −ui,n−1))= ui,n−1 + k(ui,n−2 + ui−1,n−1 + ui+1,n−1 −3ui,n−1)Here is the update formula for a cell in the top left corner:u′0,n−1 = u0,n−1 + k((u0,n−2 −u0,n−1) + (u1,n−1 −u0,n−1))= u0,n−1 + k(u0,n−2 + u1,n−1 −2u0,n−1) Program:
Rock-paper-scissors is a game usually played between two people, in which each player simultaneously forms one of three shapes with an outstretched hand. These shapes are rock (a closed fist), paper (a flat hand), and scissors (a fist with the index finger and middle finger extended, forming a V). The code described above is A. both a digital and an analog code. B. an analog code. C. a digital code. D. neither a digital nor an analog code. Two user interface designers are working on the interface for a collaborative text editor. They are discussing the design of a proposed new feature: a button to irreversibly delete the current version and all past versions of a document. Designer A says, “Let's make a red button with the words ‘Delete permanently’ on it. Red means danger.” Designer B says, “No, let’s make a button with a drawing of a piece of paper going up in flames.” Which of the following best describes the designers' proposals? A. Designer A’s proposed sign…
: Design and implement a text-based Minesweeper game. Minesweeper is the classicsingle-player computer game where an NxN grid has B mines (or bombs) hidden across the grid. Theremaining cells are either blank or have a number behind them. The numbers reflect the number ofbombs in the surrounding eight cells. The user then uncovers a cell. If it is a bomb, the player loses.If it is a number, the number is exposed. If it is a blank cell, this cell and all adjacent blank cells (up toand including the surrounding numeric cells) are exposed. The player wins when all non-bomb cellsare exposed. The player can also flag certain places as potential bombs. This doesn't affect gameplay, other than to block the user from accidentally clicking a cell that is thought to have a bomb.(Tip for the reader: if you're not familiar with this game, please play a few rounds on line first.)
Create an algorithm that gives the formula that computes the numberof dots needed for a given input "layer". Assume that this can accommodate an “infinite” number of dots. Example:layer:1 dots: 1layer:2 dots: 3layer:3 dots:6
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. every cell of the network contains a non-negative integer. Each turn, a player should play out every one of the accompanying activities all together. Pick a beginning cell (r1,c1) with non-zero worth. Pick a completing cell (r2,c2) to such an extent that r1≤r2 and c1≤c2. Lessening the worth of the beginning cell by some sure non-zero integer. Pick any of the most limited ways between the two cells and either increment, lessening or leave the upsides of cells on this way unaltered. Note that: a most limited way is one that goes through the most un-number of cells; all cells on this way barring the beginning cell, yet the completing cell might be altered; the subsequent worth of every cell should be a non-negative integer; the cells are changed freely and not really by a similar worth. On the off chance that the beginning and finishing cells are something very…
Write how the breadth-first search (BFS) algorithm can be applied in the following real-life application areas. a) Navigation systemsb) Web Crawler (web browsers)c) Social Networks (Facebook, etc.)
You are given a grid of size n ×m and within that grid there is a horizontal rod (arbitrary widthbut height of 1). You aim is to locate it. The only thing you can use to find the location of the rod is makequeries of the form IsPresent (x1, y1, x2, y2) where x1 ≤x2, y1 ≤y2. This returns True if part of the rod ispresent in the grid from (x1, y1) to (x2, y2) and False if not. See figures below. Design an algorithm whichuses queries O(log(n +m)) times to find the location of the rod, i.e., the leftmost coordinates and rightmostcoordinates. Hint: consider using binary search in your algorithm.
PLEASE PLEASE SHOW CALCULATIONS Using the Vigenere cipher given in class: ADQYS MIUSB OXKKT MIBHK IZOOO EQOOG IFBAG KAUMFVVTAA CIDTW MOCIO EQOOG BMBFV ZGGWP CIEKQ HSNEWVECNE DLAAV RWKXS VNSVP HCEUT QOIOF MEGJS WTPCHAJMOC HIUIX Determine the Keys that would be needed to decipher the given cipher given the following deductions made in class Key of length 6; alphabet 1: AIKHOIATTOBGEEERNEOSAI alphabet 2: DUKKEFUAWEMGKWDWSUFWJU alphabet 3: QSTIQBMAMQBWQVLKVTMTMI alphabet 4: YBMZOAFCOOFPHEAXPQEPOX alphabet 5: SOIOOGVICOVCSVASHOGCC alphabet 6: MXBOGKVDIGZINNVVCIJHH
code Connect6State.java according to the following instructions Class Connect6State java.lang.Object Connect6State public class Connect6State extends java.lang.Object Connect6State - A representation of a Connect6 (http://en.wikipedia.org/wiki/Connect6) game state. We assume a square grid board size specified to be a positive integer less than or equal to 26. Size 19 is common. The first and second players place pieces on the board that are black and white, respectively. Each piece is placed in an unoccupied grid position. On the first turn, the first player places one piece. Afterwards, players alternate placing two pieces per turn. Play continues until either one player completes a consecutive line of 6 or more of their pieces or no play is possible. The player with 6 or more pieces in a horizontal, vertical, or diagonal line is the winner. If no legal play is possible, the game is a draw. Field Summary Fields Modifier and Type Field Description static int…
Python Language Q2: Ginormous Campus The campus is pretty big. There are n buildings scattered around it, numbered from 0 to n-1. These buildings are so far away from each other that the only way to get from one to another is to take a campus bus. There are m campus bus routes. The i-th one (0 <= i < m) takes you from building u_i to building v_i (but not the other way around). These buses run very frequently. Professor Zingaro is deciding where to hold his CS lectures. He believes a building x is accessible from a building y if you can get from y to x taking at most two buses. For his students’ convenience, he wants to hold his lectures in the most accessible building. Help him out by telling him how many buildings the most accessible building is accessible from. In addition, list all buildings that are the most accessible. Input The first line of the input contains two space-separated integers n and m, denoting the number of buildings and bus routes, respectively. m lines…
Which of the following three lists has the largest SD? You should be able to answer without computing the SD. 40, 41, 42, 43, 44, 45, 46 40, 41, 42, 43, 44 40, 41, 42, 43, 44, 45, 46, 100