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 }
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
Related questions
Question
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 (h1, v1) to (h2, v2). How many blocks do you traverse?
*Description*: The diagram shows a grid representing streets and avenues. Two points are marked on the grid: \((h_1, v_1)\) and \((h_2, v_2)\). Several possible routes between these points are drawn in different colors (blue, green, and red), illustrating that there are multiple paths to travel the same distance. However, irrespective of the route taken, the total distance in blocks remains the same.
2. **Calculating the Distance**
Even though there are many possible routes, the distance only depends on the differences \( h_2 - h_1 \) and \( v_2 - v_1 \). However, you need to take the absolute value because the differences might be negative.
3. **Programming Challenge**
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).
```java
Distance.java
public class Distance
{
public static void main(String[] args)
{
// These values will be changed during testing
int h1 = 3;
int v1 = 4;
int h2 = 4;
int v2 = 4;
// Calculate the distance
int distance = Math.abs(h2 - h1) + Math.abs(v2 - v1);
System.out.print("Distance: ");
System.out.println(distance);
}
}
```
This code snippet calculates the distance between two points on a grid by summing the absolute differences of their respective coordinates. The printed distance reflects the total number of blocks traveled.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd772767f-fd91-4ca5-b737-b5766e3fef0a%2F2fe938ba-cdd1-4259-88fc-2c9ec945825b%2Ftyhzpt1.png&w=3840&q=75)
Transcribed Image Text:### Understanding Distance in a City Street Grid
1. **City Street Grid Distances**
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_1, v_1)\) to \((h_2, v_2)\). How many blocks do you traverse?
*Description*: The diagram shows a grid representing streets and avenues. Two points are marked on the grid: \((h_1, v_1)\) and \((h_2, v_2)\). Several possible routes between these points are drawn in different colors (blue, green, and red), illustrating that there are multiple paths to travel the same distance. However, irrespective of the route taken, the total distance in blocks remains the same.
2. **Calculating the Distance**
Even though there are many possible routes, the distance only depends on the differences \( h_2 - h_1 \) and \( v_2 - v_1 \). However, you need to take the absolute value because the differences might be negative.
3. **Programming Challenge**
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).
```java
Distance.java
public class Distance
{
public static void main(String[] args)
{
// These values will be changed during testing
int h1 = 3;
int v1 = 4;
int h2 = 4;
int v2 = 4;
// Calculate the distance
int distance = Math.abs(h2 - h1) + Math.abs(v2 - v1);
System.out.print("Distance: ");
System.out.println(distance);
}
}
```
This code snippet calculates the distance between two points on a grid by summing the absolute differences of their respective coordinates. The printed distance reflects the total number of blocks traveled.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education