If you are in a city and have to walk from where you are, having planar coordinates (0,0), to a destination having planar coordinates (x, y), then there are two ways of computing the distance you have to travel. One is called the euclidean distance, rl=√x² + y² Note that this distance might require you to cut across lawns and through buildings. There is another way to measure distance called the taxi-cab distance, r2 = |x|+|y| which is the distance a taxi-cab would have to travel along the city blocks. Write a program which reads the destination coordinates, (x, y), and calls a single function, distance (), which computes both the euclidean distance and the taxi-cab distance. The main program (not the function) must then print both distances to the screen. Here is a sample input/output: Enter x and y: 3 4 The destination coordinates are (3.0000, 4.0000) The euclidean distance is 5.0000 The taxicab distance is 7.0000 For marking purposes run your program twice using destinations: (2,4) and (-3,4).

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
icon
Related questions
Question
Plz solve the question using c programming without changing or adding any other library other than the library # include < stdio.h >, the second photo is a sample of how the coding should look like
#include<stdio.h>
#include<math.h>
float f(float x);
float df (float x):
void newton (float x1, float tol, float* add_root, int" add_iter);
int main(void) {
float x1, tol, root;
int iter;
FILE" fout = fopen("rootsout.txt", "a");
printf("Enter the starting guess and the desired tolerance: ");
scanf("%f%f", 8x1, Stol);
newton (x1, tol, Broot,&iter);
fprintf(fout, "After %d iterations the estimated root near XF is: f\n", iter, x1, root);
fclose(fout);
return;
float (float x){
float yi
y = sin(x)-2.0*exp(-x);
return y;
float df (float x){
float yi
y = cos(x)+2.€*exp(-x);
return y;
}
}
void newton (float x1, float tol, float" add_root, int* add_iter){
float x2;
int iter=;
while(1){
x2 = x1 *(x1)/df(x1);
if (fabs (x2-x1)<tol){
break;
}
x2=x2;
"add_root = x2;
add_iter = iter;
return;
Transcribed Image Text:#include<stdio.h> #include<math.h> float f(float x); float df (float x): void newton (float x1, float tol, float* add_root, int" add_iter); int main(void) { float x1, tol, root; int iter; FILE" fout = fopen("rootsout.txt", "a"); printf("Enter the starting guess and the desired tolerance: "); scanf("%f%f", 8x1, Stol); newton (x1, tol, Broot,&iter); fprintf(fout, "After %d iterations the estimated root near XF is: f\n", iter, x1, root); fclose(fout); return; float (float x){ float yi y = sin(x)-2.0*exp(-x); return y; float df (float x){ float yi y = cos(x)+2.€*exp(-x); return y; } } void newton (float x1, float tol, float" add_root, int* add_iter){ float x2; int iter=; while(1){ x2 = x1 *(x1)/df(x1); if (fabs (x2-x1)<tol){ break; } x2=x2; "add_root = x2; add_iter = iter; return;
If you are in a city and have to walk from where you are, having planar coordinates (0,0),
to a destination having planar coordinates (x, y), then there are two ways of computing the
distance you have to travel. One is called the euclidean distance,
r1 = √x² + y²
Note that this distance might require you to cut across lawns and through buildings.
There is another way to measure distance called the taxi-cab distance,
r2 = |x|+|y|
which is the distance a taxi-cab would have to travel along the city blocks.
Write a program which reads the destination coordinates, (x, y), and calls a single function,
distance (), which computes both the euclidean distance and the taxi-cab distance. The main
program (not the function) must then print both distances to the screen.
Here is a sample input/output:
Enter x and y: 3 4
The destination coordinates are (3.0000, 4.0000)
The euclidean distance is 5.0000
The taxicab distance is 7.0000
For marking purposes run your program twice using destinations: (2,4) and (-3,4).
Transcribed Image Text:If you are in a city and have to walk from where you are, having planar coordinates (0,0), to a destination having planar coordinates (x, y), then there are two ways of computing the distance you have to travel. One is called the euclidean distance, r1 = √x² + y² Note that this distance might require you to cut across lawns and through buildings. There is another way to measure distance called the taxi-cab distance, r2 = |x|+|y| which is the distance a taxi-cab would have to travel along the city blocks. Write a program which reads the destination coordinates, (x, y), and calls a single function, distance (), which computes both the euclidean distance and the taxi-cab distance. The main program (not the function) must then print both distances to the screen. Here is a sample input/output: Enter x and y: 3 4 The destination coordinates are (3.0000, 4.0000) The euclidean distance is 5.0000 The taxicab distance is 7.0000 For marking purposes run your program twice using destinations: (2,4) and (-3,4).
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Random Class and its operations
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education