Problem Statement Given four points of the form: x1,y1,x2,y2x3, y3,x4,y4 - create a program that will determine the intersection of the line segment containing segment containing (x3,y3) and (x4,y4) Input Input starts with a number N and is followed by N pairs of line segments (represented by 8 integers) Output A set of N pairs of points indicating the intersection of the N pairs of segments. In case the line segments don't intersect - then the output points do not form two lines / or intersects more than once then the output will be "invalid input". Limits 1
Problem Statement Given four points of the form: x1,y1,x2,y2x3, y3,x4,y4 - create a program that will determine the intersection of the line segment containing segment containing (x3,y3) and (x4,y4) Input Input starts with a number N and is followed by N pairs of line segments (represented by 8 integers) Output A set of N pairs of points indicating the intersection of the N pairs of segments. In case the line segments don't intersect - then the output points do not form two lines / or intersects more than once then the output will be "invalid input". Limits 1
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...
Related questions
Question
![Problem Statement
Given four points of the form: x1,y1,x2,y2, x3, y3,x4,y4 - create a program that will determine the intersection of the line segment containing (x1,y1) and (x2, y2) and the line
segment containing (x3,y3) and (x4,y4)
Input
Input starts with
number N and is followed by N pairs of line segments (represented by 8 integers)
Output
A set of N pairs of points indicating the intersection of the N pairs of segments. In case the line segments don't intersect - then the output will be, "do not intersect". If the
points do not form two lines / or intersects more than once then the output will be "invalid input".
Limits
1<N< 20
-100 ≤ A ≤ 100
Notes
Problems will have test cases that are not listed in their specification. Your solution must produce the right output for these hidden test cases.
Sample Input #1
5
-3 1 0 4 2 0-4 3
-3 1 0 4 2 0 4 -1
-3 10 4 -3 1 1 5
-3 1-3 1-3 1 2 5
0 1 0 4 1 1 1 4
Sample Output #1
-22
do not intersect
invalid input
invalid input
do not intersect
Copy
Copy](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4ef6d085-3ef4-47f1-9be9-46b7c5504b5e%2Fe5a5de3a-7a69-4e91-b18c-5bf6140a91b3%2Fepdyofd_processed.png&w=3840&q=75)
Transcribed Image Text:Problem Statement
Given four points of the form: x1,y1,x2,y2, x3, y3,x4,y4 - create a program that will determine the intersection of the line segment containing (x1,y1) and (x2, y2) and the line
segment containing (x3,y3) and (x4,y4)
Input
Input starts with
number N and is followed by N pairs of line segments (represented by 8 integers)
Output
A set of N pairs of points indicating the intersection of the N pairs of segments. In case the line segments don't intersect - then the output will be, "do not intersect". If the
points do not form two lines / or intersects more than once then the output will be "invalid input".
Limits
1<N< 20
-100 ≤ A ≤ 100
Notes
Problems will have test cases that are not listed in their specification. Your solution must produce the right output for these hidden test cases.
Sample Input #1
5
-3 1 0 4 2 0-4 3
-3 1 0 4 2 0 4 -1
-3 10 4 -3 1 1 5
-3 1-3 1-3 1 2 5
0 1 0 4 1 1 1 4
Sample Output #1
-22
do not intersect
invalid input
invalid input
do not intersect
Copy
Copy
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY