Find output for the given statements Program plan: Create a class “Car”, Define the method “m1()” that prints the string “car 1”. Define the method “m2()” that prints the string “car 2”. Define the method “toString()” that returns the string “vroom”. Create a class “Truck” that extends the super class “Car”, Define the method “m1()”, Print the string “truck 1”. Define the method “m1()”, Call the super class method “m2()”. Define the method “toString()”, Return the concatenated string which is obtained by calling super class method “toString()”. Define the method “main()”, Create the object for the class “Truck”. Print the information about the object of “Truck” class. Call the method “m1()” using the object of “Truck” class. Call the method “m2()” using the object of “Truck” class.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9.2, Problem 9SCP

Program Plan Intro

Find output for the given statements

Program plan:

Create a class “Car”,

Define the method “m1()” that prints the string “car 1”.

Define the method “m2()” that prints the string “car 2”.

Define the method “toString()” that returns the string “vroom”.

Create a class “Truck” that extends the super class “Car”,

Define the method “m1()”,

Print the string “truck 1”.

Define the method “m1()”,

Call the super class method “m2()”.

Define the method “toString()”,

Return the concatenated string which is obtained by calling super class method “toString()”.

Define the method “main()”,

Create the object for the class “Truck”.

Print the information about the object of “Truck” class.

Call the method “m1()” using the object of “Truck” class.

Call the method “m2()” using the object of “Truck” class.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

3A) Generate a hash table for the following values: 11, 9, 6, 28, 19, 46, 34, 14. Assume the table size is 9 and the primary hash function is h(k) = k % 9. i) Hash table using quadratic probing ii) Hash table with a secondary hash function of h2(k) = 7- (k%7) 3B) Demonstrate with a suitable example, any three possible ways to remove the keys and yet maintaining the properties of a B-Tree. 3C) Differentiate between Greedy and Dynamic Programming.

What are the charts (with their title name) that could be use to illustrate the data? Please give picture examples.

A design for a synchronous divide-by-six Gray counter isrequired which meets the following specification.The system has 2 inputs, PAUSE and SKIP:• While PAUSE and SKIP are not asserted (logic 0), thecounter continually loops through the Gray coded binarysequence {0002, 0012, 0112, 0102, 1102, 1112}.• If PAUSE is asserted (logic 1) when the counter is onnumber 0102, it stays here until it becomes unasserted (atwhich point it continues counting as before).• While SKIP is asserted (logic 1), the counter misses outodd numbers, i.e. it loops through the sequence {0002,0112, 1102}.The system has 4 outputs, BIT3, BIT2, BIT1, and WAITING:• BIT3, BIT2, and BIT1 are unconditional outputsrepresenting the current number, where BIT3 is the mostsignificant-bit and BIT1 is the least-significant-bit.• An active-high conditional output WAITING should beasserted (logic 1) whenever the counter is paused at 0102.(a) Draw an ASM chart for a synchronous system to providethe functionality described above.(b)…