Code in C + In this lab we will be reinforcing our understanding of a number of concepts in C...arrays, struct, conditions, loops and loop controls - Allow the user to enter multiple pairs of x and y coordinates on a 2 dimensional graph (these numbers may be considered unitless) along with a text label for that set of points. You must use a "struct" data type to define how these are stored. - The x and y coordinates should be type "float" or "double" - Allow multiple data points to be entered by the user, so the first thing the user must ask is how many coordinates  will be entered. Since multiple entries will be made you must create an array of that "struct" type. - Once all of the coordinates and labels are entered, calculate the distance between each set of points (you DO NOT have to store all of the distances!!!).  In this lab you may use "math.h" (it may be useful). - Determine which coordinates are closest to each other out of all of the pairs. - Determine which coordinates are furthest from each other out of all of the pairs. NOTE!!!! There will be a  value for efficiency. Please contemplate the BEST way to do this MOST efficiently. Brute-force is fine, but do better somehow!!! - Output the text label, and their corresponding relative distances, for the two closest coordinates and two most distant coordinates (if there is a tie, it is OK to report the last one with the "Winning" proximities...no need to report both or all of them....however, if you would like to handle ties it may be a fun exercise)   Data scrubbing 1. users must enter positive coordinates for both x and y and, of course, they must be actual numbers. 2. a text label must be entered for each set of coordinates and the label CANNOT be used more than once (although a pair of coordinates CAN be used more than once!!!) 3. the user must declare that they intend to enter more than 1 set of coordinates (if they don't, there's not much use for this program)   Math for the calculation of distance between tps://www.mathsisfun.com/algebra/distance- A nice explanation of an "array of structs" that may prove helpful https://overiq.com/c-programming-101/array-of-structures-in-c/ (Links to an external site.) This may also come in handy if you choose to do it this way.... https://www.tutorialspoint.com/cprogramming/c_nested_loops.htm

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Code in C +

In this lab we will be reinforcing our understanding of a number of concepts in C...arrays, struct, conditions, loops and loop controls

- Allow the user to enter multiple pairs of x and y coordinates on a 2 dimensional graph (these numbers may be considered unitless) along with a text label for that set of points. You must use a "struct" data type to define how these are stored.

- The x and y coordinates should be type "float" or "double"

- Allow multiple data points to be entered by the user, so the first thing the user must ask is how many coordinates  will be entered. Since multiple entries will be made you must create an array of that "struct" type.

- Once all of the coordinates and labels are entered, calculate the distance between each set of points (you DO NOT have to store all of the distances!!!).  In this lab you may use "math.h" (it may be useful).

- Determine which coordinates are closest to each other out of all of the pairs.

- Determine which coordinates are furthest from each other out of all of the pairs.

NOTE!!!! There will be a  value for efficiency. Please contemplate the BEST way to do this MOST efficiently. Brute-force is fine, but do better somehow!!!

- Output the text label, and their corresponding relative distances, for the two closest coordinates and two most distant coordinates (if there is a tie, it is OK to report the last one with the "Winning" proximities...no need to report both or all of them....however, if you would like to handle ties it may be a fun exercise)

 

Data scrubbing

1. users must enter positive coordinates for both x and y and, of course, they must be actual numbers.

2. a text label must be entered for each set of coordinates and the label CANNOT be used more than once (although a pair of coordinates CAN be used more than once!!!)

3. the user must declare that they intend to enter more than 1 set of coordinates (if they don't, there's not much use for this program)

 

Math for the calculation of distance between tps://www.mathsisfun.com/algebra/distance-

A nice explanation of an "array of structs" that may prove helpful

https://overiq.com/c-programming-101/array-of-structures-in-c/ (Links to an external site.)

This may also come in handy if you choose to do it this way....

https://www.tutorialspoint.com/cprogramming/c_nested_loops.htm

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY