In city street grids, intersections are often defined by two integers, counting the position of horizontal and vertical streets (sometimes called streets and avenues). Imagine traveling from position (h,, vi) to (h2, v2). How many blocks do you traverse? (h,, v.) (h,, v,) Even though there are many possible routes, the distance only depends on the differences h, - h, and v2 - V1. However, you need to take the absolute value because the differences might be negative. Complete the following program that prints the number of blocks traveled, given the origin and destination of the trip (which will change as your code is tested). Distance.java 1 public class Distance 2 { public static void main(String[] args) { // These values will be changed during testing int hl = 3; int vl = 4; int h2 = 4; int v2 = 4; 4 7 9. 10 11 .. 12 codecheck-bjlo-1e-02_06 System.out.print("Distance: "); System.out.println(distance); } 13 14 15 16 }

In city street grids, intersections are often defined by two integers, counting the position of horizontal and vertical streets (sometimes called streets and avenues). Imagine traveling from position (h,, vi) to (h2, v2). How many blocks do you traverse? (h,, v.) (h,, v,) Even though there are many possible routes, the distance only depends on the differences h, - h, and v2 - V1. However, you need to take the absolute value because the differences might be negative. Complete the following program that prints the number of blocks traveled, given the origin and destination of the trip (which will change as your code is tested). Distance.java 1 public class Distance 2 { public static void main(String[] args) { // These values will be changed during testing int hl = 3; int vl = 4; int h2 = 4; int v2 = 4; 4 7 9. 10 11 .. 12 codecheck-bjlo-1e-02_06 System.out.print("Distance: "); System.out.println(distance); } 13 14 15 16 }

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Q10: Using (ode45, ode23, or ode15s), solve the below dynamic electrical system differential equation. 1. The charge Q(t) on the capacitor in the electrical circuit shown satisfies the differential equation where d²Q dQ 1 +R- + √ √e dt2 dt L = 0.5 R = 6.0 C= 0.02 and V(t) is the applied voltage. V(t) = V(t), henrys is the coil's inductance ohms is the resistor's resistance farads is the capacitor's capacitance ellee (i) Is the circuit oscillatory? (ii) If V(t) = 24 sin(10r) volts and Q(0) = 0 = Q'(0), find Q(t). (iii) Sketch the transient solution, the steady state solution, and the full solution Q(t).
Algorithms Question Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula. Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.
Given any n by n square matrix, write a program that reflects the matrix across its major diagonal. For example, 9,2,2, 1,9,2, becomes 1,1,9 9,1,1, 2,9,1, 2,2,9 Explain how you got your answer.
The distance d between a point p(x, y), where x and y are the coordinates of p, and the center of a circle (a, b), where a and b are the coordinates of the center, is given by the formula: (a, b). r d = (x – a)² + (y – b)² r The point p(x, y) is considered inside the circle if d r. (x, y)' (x', y') Write a Java class called CirclePointthat: a. Reads from the user 2 integer values x and y represent the coordinates of the point p, b. Reads from the user 2 integer values a and b represent the coordinates of the center of the circle, c. Reads from the user a real value r represents the radius of the circle, d. Calculates and prints the distance d (rounded to 2 decimal places) between the point p and the center of the circle, and e. Checks and prints whether the point is inside, on or outside the circle. NOTE: if the radius value is negative, an error message should be shown. Sample Run 1: ==================== Enter the coordinates of the point: 5 7 Enter the coordinates of the center of…
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Miles between Adjacent Towns Town A B C DE Destination Origin A 40 60 50 10 70 B 20 55 40 50 10 D 60 E 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem.
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Town Origin A B C D E A 40 Miles between Adjacent Towns C D E B 60 10 50 20 - 70 55 - 88811 40 50 10 Destination | | || 88 60 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem. Illustrate your work by using a table.…
4x1+4x2+6x3+9x4=03x1+3x5=26x2+5x4+7x5=-46x1+8x4+2x5=54x5+7x2+6x3+8x1=-10Represent the set of equations in a matrix equation, Ax=b, where A is a square matrix and x and b are column vectors. Write the line of code to define matrix A for this problem matlab/octave language
Dingyu is playing a game defined on an n X n board. Each cell (i, j) of the board (1 2, he may only go to (2, n).) The reward he earns for a move from cell C to cell D is |value of cell C – value of cell D|. The game ends when he reaches (n, n). The total reward - is the sum of the rewards for each move he makes. For example, if n = 1 2 and A = 3 the answer is 4 since he can visit (1, 1) → (1, 2) → (2, 2), and no other solution will get a higher reward. A. Write a recurrence relation to express the maximum possible reward Dingyu can achieve in traveling from cell (1, 1) to cell (n, n). Be sure to include any necessary base cases. B. State the asymptotic (big-O) running time, as a function of n, of a bottom-up dynamic programming algorithm based on your answer from the previous part. Briefly justify your answer. (You do not need to write down the algorithm itself.)
Q. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it. .
You are given six two-dimensional points shown in the table below. Point x coordinate y coordinate Pi 0.1831 0.1085 p2 0.9624 0.1916 p3 0.0732 0.9594 p4 0.2572 0.6066 p5 0.4476 0.7871 0.2292 0.9489 Use the Euclidean distance to compute the distance matrix M for the six points. Show the results of the complete linkage version of the basic agglomerative hierarchical clustering algorithm. That is, for each iteration of the algorithm, you need to show the found closest two clusters and the updated distance matrix M.
Rahul is a maths genius so he came up with a game and as raj is Rahul's best friend so Rahul decided to play the game with raj. Rahul gives raj two numbers LL and RR and asks raj to find the count of numbers in the range from LL to RR (LL and RR inclusive) which are a digit palindromic. A number is a digit palindromic if its first digit is the same as its last digit. As raj is not very good at maths so your task is to help Raj find out how many numbers are a digit palindromic in the range LL to RR. For example if LL = 88 and RR = 2525 .The following numbers are a digit palindromic in the range of LL to RR: 8, 9, 11, and 22. If LL = 12511251 and RR = 12661266. The digit palindromic numbers are 1251 and 1261. Input format The first line contains an integer denoting the number of test cases. Each test case is described by a single line that contains two integers LL and RR. Output format For each test case output, an integer denoting how many a digit palindromic numbers are there in the…
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is continued as long as necessary to obtain a single digit. For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yields 3, a single digit and also the digital root of 39. Input File: The input file will contain a list of positive integers, one per line. The end of the input will be indicated by an integer value of zero. Output File: For each integer in the input, output its digital root on a separate line of the output. Example Input: 24 39…