Introduction to Programming with C++, 3rd edition
3rd Edition
ISBN: 9780133377477
Author: Y. Daniel Liang
Publisher: Pearson Academic Computing
expand_more
expand_more
format_list_bulleted
Question
Chapter 3, Problem 29PE
Program Plan Intro
Create a code that asksthe user to input 3 points or measures in the code (p0, p1, and p2), shows p2 is on which side of the line.
Program Plan:
Develop a program in C++ that asks the user to input three points or measures in the code (p0, p1, and p2) and finds if p2 is at the left or right side of the line or on the line p0 to p1.
The conditions for deciding are as follows.
ï‚· If (xl - x0) * (y2 - y0) - (x2 - x0) * (y1 - y0) > 0, p2 is on the left side.
ï‚· If (xl - x0) * (y2 - y0) - (x2 - x0) * (y1 - y0) = 0, p2 is on the same side.
ï‚· If (xl - x0) * (y2 - y0) - (x2 - x0) * (y1 - y0) < 0, p2 is on the right side.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
It is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far.
(a) Developcode for filter processes. Declare the channels and use asynchronous message passing.
Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.
It is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far.
(a) Developcode for filter processes. Declare the channels and use asynchronous message passing.
Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.
It is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far.
(a) Developcode for filter processes. Declare the channels and use asynchronous message passing.
Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.
Chapter 3 Solutions
Introduction to Programming with C++, 3rd edition
Ch. 3 - List six relational operators.
Ch. 3 - Prob. 2CPCh. 3 - Show the printout of the following code:
Ch. 3 - Write an if statement that assigns 1 to x if y is...Ch. 3 - Write an if statement that increases pay by 3 if...Ch. 3 - Prob. 6CPCh. 3 - Write an if statement that increases pay by if...Ch. 3 - Prob. 8CPCh. 3 - Prob. 9CPCh. 3 - Suppose Show the output, if any, of the following...
Ch. 3 - What is wrong in the following code?...Ch. 3 - Show the output of the following code:
Ch. 3 - Which of the following statements are equivalent?...Ch. 3 - Prob. 14CPCh. 3 - Are the following statements correct? Which one is...Ch. 3 - Prob. 16CPCh. 3 - Are the following statements equivalent?Ch. 3 - Prob. 18CPCh. 3 - a. How do you generate a random integer i such...Ch. 3 - Write an expression that obtains a random between...Ch. 3 - Prob. 21CPCh. 3 - (a) Write a Boolean expression that evaluates to...Ch. 3 - (a) Write a Boolean expression for x54.5. (b)...Ch. 3 - To test whether is between 10 and 100, which of...Ch. 3 - Are the following two expressions the same?
Ch. 3 - What is the value of the expression
Ch. 3 - Suppose, when you run the program, you enter the...Ch. 3 - Write a Boolean expression that evaluates to true...Ch. 3 - Write a Boolean expression that evaluates to true...Ch. 3 - Write a Boolean expression that evaluates to true...Ch. 3 - Write a Boolean expression that evaluates to true...Ch. 3 - What data types are required for a switch...Ch. 3 - What is y after the following switch statement is...Ch. 3 - What is x after the following if-else statement is...Ch. 3 - Suppose that, when you run the following program,...Ch. 3 - Rewrite the following if statements using the...Ch. 3 - Rewrite the following conditional expressions...Ch. 3 - List the precedence order of the Boolean...Ch. 3 - True or false? All the binary operators except =...Ch. 3 - Evaluate the following expressions:...Ch. 3 - ...Ch. 3 - (Algebra: solve quadratic equations) The two roots...Ch. 3 - (Check numbers) Write a program that prompts the...Ch. 3 - (Algebra: solve 22 linear equations) You can use...Ch. 3 - (Check temperature) Write a program that prompts...Ch. 3 - (Find future dates) Write a program that prompts...Ch. 3 - (Health application: BMI) Revise Listing 3.2,...Ch. 3 - Prob. 7PECh. 3 - (Financial application: monetary units) Modify...Ch. 3 - (Find the number of days in a month) Write a...Ch. 3 - (Game: addition quiz) Listing 3.4,...Ch. 3 - (Cost of shipping) A shipping company uses the...Ch. 3 - (Game: heads or tails) Write a program that lets...Ch. 3 - Prob. 13PECh. 3 - (Game: lottery) Revise Listing 3.7, Lottery.cpp,...Ch. 3 - (Game: scissor, rock, paper) Write a program that...Ch. 3 - (Compute the perimeter of a triangle) Write a...Ch. 3 - (Science: wind-chill temperature) Programming...Ch. 3 - (Game: addition for three numbers) Listing 3.4,...Ch. 3 - (Geometry: point in a circle?) Write a program...Ch. 3 - (Geometry: point in a rectangle?) Write a program...Ch. 3 - (Game: pick a card) Write a program that simulates...Ch. 3 - (Geometry: intersecting point) Two points on line...Ch. 3 - (Geometry: points in triangle'?) Suppose a right...Ch. 3 - (Use the operators) Write a program that prompts...Ch. 3 - (Geometry: two rectangles) Write a program that...Ch. 3 - (Geometry: two circles) Write a program that...Ch. 3 - Prob. 27PECh. 3 - (Financials: currency exchange) Write a program...Ch. 3 - Prob. 29PECh. 3 - (Financial: compare costs) Suppose you shop for...Ch. 3 - Prob. 31PECh. 3 - (Algebra: slope-intercept form) Write a program...Ch. 3 - (Science: day of the week)) Zeller's congruence is...Ch. 3 - Prob. 34PECh. 3 - (Business: check ISBN-10) An lSBN-10...Ch. 3 - (Palindrome number) Write a program that prompts...
Knowledge Booster
Similar questions
- It is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far. (a) Developcode for filter processes. Declare the channels and use asynchronous message passing. Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.arrow_forwardIt is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far. (a) Developcode for filter processes. Declare the channels and use asynchronous message passing. Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.arrow_forwardI need help: Challenge: Assume that the assigned network addresses are correct. Can you deduce (guess) what the network subnet masks are? Explain while providing subnet mask bits for each subnet mask. [Hint: Look at the addresses in binary and consider the host ids]arrow_forward
- I would like to know if my answer statment is correct? My answer: The main difference is how routes are created and maintained across different networks. Static routing establishes router connections to different networks from the far left and far right. The Dynamic routing focus emphasizes immediate connection within the router while ignoring the other connections from different networks. Furthermore, the static routing uses the subnet mask to define networks such as 25.0.0.0/8, 129.60.0.0/16, and 200.100.10.0/30, which correspond to 255.0.0.0, 255.255.0.0, and 255.255.255.252. On the other hand, dynamic routing uses the wildcard mask to inverse the subnet mask, where network bits become 0 and host bits become 1, giving us 0.0.0.255, 0.0.255.255, and 0.0.0.3. Most importantly, the CLI commands used for Static and Dynamic routing are also different. For static routing, the “IP route” corresponds with the network, subnet mask, and next-hop IP address. In contrast, dynamic routing uses…arrow_forward1. [30 pts] Match the items on the left with the memory segment in which they are stored. Answers may be used more than once, and more than one answer may be required. 1. Static variables 2. Local variables 3. Global variables 4. Constants 5. Machine Instructions 6. malloc() 7. String Literals Answer A. Code B. Static C. Heap D. Stackarrow_forwardBuild an Android App that shows a list of your favorite books' details. The App should have a set of java files that implement an adapter with RecyclerView. The details of the java files you need to create are described below. RecycleViewExample RHONDA BYRNE 2016 Listen to Your Heart: The London Adventure Ruskin Bond 2010 Business of Sports: The Winning Formula for Success Vinit Karnik 2022 A Place Called Home Preeti Shenoy 2018 Vahana Masterclass Alfredo Covelli 2016 The Little Book of Encouragement Dalai Lama 2021 Platform Scale: For A Post-Pandemic World Sangeet Paul Choudary 2021 Unfinished Priyanka Chopra Jonas 2018 1. The first java file should contain a data field which is in this case: Book_name, Author_name, Publication_year. 2. The second java file contains BookViewHolder. 3. The third java file contains the BookAdapter which is act as a bridge between the data items and the View inside of RecycleView. 4. The Mainactivity java file will contain some samples data to display.…arrow_forward
- module : java Question3: (30 MARKS) Passenger Rail Agency for South Africa Train Scheduling System Problem Statement Design and implement a train scheduling system for Prasa railway network. The system should handle the following functionalities: 1. Scheduling trains: Allow the addition of train schedules, ensuring that no two trains use the same platform at the same time at any station. 2. Dynamic updates: Enable adding new train schedules and canceling existing ones. 3. Real-time simulation: Use multithreading to simulate the operation of trains (e.g., arriving, departing). 4. Data management: Use ArrayList to manage train schedules and platform assignments. Requirements 1. Add Train Schedule, Cancel Scheduled Train, View Train Schedules and Platform Management 2. Concurrency Handling with Multithreading i.e Use threads to simulate train operations, Each…arrow_forwardQuestion D.4: FIFO Page Replacement Consider the following page reference string: e, c, b, e, a, g, d, c, e, g, d, a Considering 4 frames, fill in the following table and then answer how many page faults would occur with the FIFO page replacement algorithm. RS: reference string; FO: frame 0, F1: frame 1, etc. Hint: all frames are initially empty, so your first unique pages will all cost one fault each. Time 1234567891011 12 RS e cb e agd ce g d a FO F1 F2 F3 Page fault? b) Total # page faults: c) Briefly (1-2 sentences) explain Belady's Anomaly that can occur in FIFO Page Replacement.arrow_forwardConsider a system that uses a fixed-partition scheme, with equal partitions of size 2" bytes, and the main memory has 2¹8 bytes. A process table is maintained with a pointer to the resident partition for each resident process. How many bits are required for the pointer in the process table? Show all your steps.arrow_forward
- Use the same semaphore notation shown above to describe how we can ensure the execution order of the following process execution graph: P6 P2 P7 P1 P3 P4 P5 Use all of the following semaphores in your answer: s1=0; s2=0; s3=0; s4=0; s5=0; s6=0;arrow_forwardConsider the set of process: Process ID Arrival Time Burst Time P1 0 5 P2 0 10 P3 + 15 P4 18 10 P5 22 20 a) Draw the GANTT chart for the Round Robin time quantum -5) scheduling algorithm. Use the same implementation you used for the programming assignmenti.e. the processes should always run in PID order. Assume there is no context-switch overhead. Show your work for partial credit. b) Write your answer to the following performance metrics given your above CANTT charts. Show your work for partial credit. Average Response time: Average Wating time: Average Turnaround time:arrow_forwardConsider a file currently consisting of 10 blocks. Assume that the file control block and the new block information to be added are already in memory. Calculate how many disk I/O operations are required for the linked allocation strategy, if, for one block, the following conditions hold: HINTS: 1) ignore disk I/O associated with the file control block. 2) each read and each write is an explicit disk I/O. 3) assume a pointer to the end of the list for linked allocation a. The block is added at the beginning. b. The block is added in the middle. c. The block is added at the end. d. The block is removed from the beginning. e. The block is removed from the middle. f. The block is removed from the end.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
COMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE L
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT