Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 16, Problem 12PP
Program Plan Intro

A method “contains()”

Program plan:

  • In a file “LispList.java”, create a class “LispList”,
    • Create an object for “EmptyList”.
    • Declare the method “isEmpty()”.
    • Declare the method “head()”.
    • Declare the method “tail()”.
    • Declare the method “cons()”.
    • Declare the method “contains()”.
  • In a file “EmptyList.java”, create a class “EmptyList”,
    • Define the default constructor.
    • Define the “cons()” method to return the object of “NonEmptyList”.
    • Define the method “isEmpty()” to returns true.
    • Define the method “contains()” that returns false.
    • Define the method “head()” that returns an exception “UnsupportedOperationException”.
    • Define the method “tail()” that returns an exception “UnsupportedOperationException”.
    • Define the method “toString()” that returns empty string.
  • In a file “NonEmptyList.java”, create a class “NonEmptyList”,
    • Declare the object for “Object” and “LispList”.
    • Define the constructor that assigns the object properties.
    • Define the “cons()” method to return the object of “NonEmptyList”.
    • Define the method “contains()”,
      • Return the resultant Boolean value.
        • Define the method “isEmpty()” that returns false.
        • Define the method “head()” that returns the object properties of “Object”.
        • Define the method “tail()” that returns the object properties of “LispList”.
        • Define the method “toString()” that returns the string representation.
  • In a file “LispListTest.java”, create a class “LispListTest”,
    • Define the method “main()”,
      • Create an object for “EmptyList” to create list “1”..
      • Create an object for “NonEmptyList” to create list “2’.
      • Assign the value returned from the method “cons()” to the list “3”.
      • Print the value returned from the method “contains()” by calling with list “1”.
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” by calling with list “2”.
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “2” with different argument.
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “2” with different argument.
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” by calling with list “3”.
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “3” with an argument “A”
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “3” with an argument “D”
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “3” with an argument “C”
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “3” with an argument “K”
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “3” with an argument “K”
      • Print the expected Boolean result.
      • Print the value returned from the method “contains()” when calling by list “3” with an argument “9”
      • Print the expected Boolean result.

Blurred answer
Students have asked these similar questions
Question 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.
Consider 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.
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;

Chapter 16 Solutions

Big Java Late Objects

Knowledge Booster
Background pattern image
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