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
6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]
Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4
a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]

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