A method “merge()” 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 “merge()”. 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 “merge()” that returns object that are passed to this function as an argument. 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 “isEmpty()” that returns false. Define the method “merge()”, Return the object created for “NonEmptyList”. 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”. Create the fourth list with the value returned from the method “merge()” that merges list “3” and “2”. Print the actual list “4” and then the expected list “4”. Print the actual output of merging List “2” and “3” and then the expected output. Print the actual output of merging List “1” and “2” and then the expected output. Print the actual output of merging List “2” and “1” and then the expected output. Print the actual output of merging List “2” and “2” and then the expected output. Print the actual output of merging List “1” and “1” and then the expected output.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 11PP

Program Plan Intro

A method “merge()”

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 “merge()”.

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 “merge()” that returns object that are passed to this function as an argument.

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 “isEmpty()” that returns false.

Define the method “merge()”,

Return the object created for “NonEmptyList”.

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”.

Create the fourth list with the value returned from the method “merge()” that merges list “3” and “2”.

Print the actual list “4” and then the expected list “4”.

Print the actual output of merging List “2” and “3” and then the expected output.

Print the actual output of merging List “1” and “2” and then the expected output.

Print the actual output of merging List “2” and “1” and then the expected output.

Print the actual output of merging List “2” and “2” and then the expected output.

Print the actual output of merging List “1” and “1” and then the expected output.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…

Show the correct stereochemistry when needed!! mechanism: mechanism: Show the correct stereochemistry when needed!! Br NaOPh diethyl ether substitution