MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs
MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs
5th Edition
ISBN: 9780135472460
Author: REGES, Stuart, Stepp, Marty
Publisher: PEARSON
bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 8, Problem 1E

Explanation of Solution

“quadrant” method:

//definition of "Point" class

public class Point

{

    //declare the required variables

    int x;

    int y;

    //definition of "quadrant" method

    public int quadrant()

    {

        //check "x" and "y" is greater than 0

        if (x > 0 && y > 0)

        {

            //return "1"

            return 1;

        }

/*check "x" is less than 0 and "y" is greater than 0*/

        else if (x < 0 && y > 0)

        {

            //return "2"

            return 2;

        }

        //check "x" and "y" is less than 0

        else if (x < 0 && y < 0)

        {

            //return "3"

            return 3;

        }

/*check "x" is greater than 0 and "y" is less than 0*/

        else if (x > 0 && y < 0)

        {

            //return "4"

            return 4;

        }

        //otherwise

        else

        {

            //return "0"

            return 0;

        }

    }

}

Explanation:

  • In the above program, the “Point” is the class name,
  • Inside the “Point” class, declare the “x” and “y” variables and the accessor method, the “quadrant” is the method name
    • If the “x” and “y” are greater than 0, then return 1 to the called method.
    • If the “x” is less than 0 and “y” is greater than 0, then return 2 to the called method.
    • If the “x” and “y” are less than 0, then return 3 to the called method.
    • If the “x” is greater than 0 and “y” is less than 0, then return 4 to the called method.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…
2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…
8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]

Chapter 8 Solutions

MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs

Ch. 8.2 - Prob. 11SCPCh. 8.2 - Prob. 12SCPCh. 8.2 - Prob. 13SCPCh. 8.2 - Prob. 14SCPCh. 8.2 - Prob. 15SCPCh. 8.2 - Prob. 16SCPCh. 8.3 - Prob. 17SCPCh. 8.3 - Prob. 18SCPCh. 8.3 - (You must complete Self-Check Problem 7 before...Ch. 8.3 - Prob. 20SCPCh. 8.3 - Prob. 21SCPCh. 8.4 - Prob. 22SCPCh. 8.4 - Prob. 23SCPCh. 8.4 - Prob. 24SCPCh. 8.4 - Prob. 25SCPCh. 8.4 - Prob. 26SCPCh. 8.4 - Prob. 27SCPCh. 8.4 - How does encapsulation allow you to change the...Ch. 8.5 - Prob. 29SCPCh. 8.5 - Prob. 30SCPCh. 8.5 - Prob. 31SCPCh. 8 - Prob. 1ECh. 8 - Add the following mutator method to the Point...Ch. 8 - Add the following accessor method to the Point...Ch. 8 - Add the following accessor method to the Point...Ch. 8 - Add the following accessor method to the Point...Ch. 8 - Add the following accessor method to the Point...Ch. 8 - Add the following mutator method to the TimeSpan...Ch. 8 - Add the following mutator method to the TimeSpan...Ch. 8 - Add the following mutator method to the TimeSpan...Ch. 8 - Add the following mutator method to the Stock...Ch. 8 - Suppose the following BankAccount class has been...Ch. 8 - Add a toString method to the BankAccount class...Ch. 8 - Add a transfer method to the BankAccount class...Ch. 8 - Prob. 14ECh. 8 - Add the following accessor method to your Line...Ch. 8 - Add the following constructor to your Line...Ch. 8 - Add the following accessor method to your Line...Ch. 8 - Write a class called Rectangle that represents a...Ch. 8 - Add the following constructor to your Rectangle...Ch. 8 - Add the following accessor methods to your...Ch. 8 - Add the following method to your Rectangle...Ch. 8 - Add the following method to your Rectangle...Ch. 8 - Add the following method to your Rectangle...Ch. 8 - Prob. 2PPCh. 8 - Prob. 3PP
Knowledge Booster
Background pattern image
Computer Science
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
6 Stages of UI Design; Author: DesignerUp;https://www.youtube.com/watch?v=_6Tl2_eM0DE;License: Standard Youtube License