Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)

11th Edition

ISBN: 9780134671710

Author: Y. Daniel Liang

Publisher: PEARSON

See similar textbooks

Videos

Textbook Question

Chapter 13, Problem 13.20PE

(Algebra: solve quadratic equations) Rewrite Programming Exercise 3.1 to obtain imaginary roots if the determinant is less than 0 using the Complex class in Programming Exercise 13.17. Here are some sample runs:

Enter a, b, c: 1 3 1 Chapter 13, Problem 13.20PE, (Algebra: solve quadratic equations) Rewrite Programming Exercise 3.1 to obtain imaginary roots if , example 1

The roots are –0.381966 and –2.61803

Enter a, b, c: 1 2 1 Chapter 13, Problem 13.20PE, (Algebra: solve quadratic equations) Rewrite Programming Exercise 3.1 to obtain imaginary roots if , example 2

The root is –1

Enter a, b, c: 1 2 3 Chapter 13, Problem 13.20PE, (Algebra: solve quadratic equations) Rewrite Programming Exercise 3.1 to obtain imaginary roots if , example 3

The roots are –1.0 + 1.4142i and –1.0 + 4142i

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 13, Problem 13.19PE

Chapter 13, Problem 13.21PE

Students have asked these similar questions

Dijkstra's Algorithm (part 1). Consider the network shown below, and Dijkstra’s link-state algorithm. Here, we are interested in computing the least cost path from node E (note: the start node here is E) to all other nodes using Dijkstra's algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the "Step 0" row in the table below showing the link state algorithm’s execution by matching the table entries (i), (ii), (iii), and (iv) with their values. Write down your final [correct] answer, as you‘ll need it for the next question.

4. |z + 5 - 5i| = 7

14. dz, C: |z❘ C: |z❘ = 0.6 ze² - 2iz H

Chapter 13 Solutions

Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)

Ch. 13.2 - Prob. 13.2.1CP Ch. 13.2 - The getArea() and getPerimeter() methods may be...Ch. 13.2 - True or false? a.An abstract class can be used...Ch. 13.3 - Prob. 13.3.1CP Ch. 13.3 - Prob. 13.3.2CP Ch. 13.3 - Prob. 13.3.3CP Ch. 13.3 - What is wrong in the following code? (Note the...Ch. 13.3 - What is wrong in the following code? public class...Ch. 13.4 - Can you create a Calendar object using the...Ch. 13.4 - Prob. 13.4.2CP

Ch. 13.4 - How do you create a Calendar object for the...Ch. 13.4 - For a Calendar object c, how do you get its year,...Ch. 13.5 - Prob. 13.5.1CP Ch. 13.5 - Prob. 13.5.2CP Ch. 13.5 - Prob. 13.5.3CP Ch. 13.5 - Prob. 13.5.4CP Ch. 13.6 - Prob. 13.6.1CP Ch. 13.6 - Prob. 13.6.2CP Ch. 13.6 - Can the following code be compiled? Why? Integer...Ch. 13.6 - Prob. 13.6.4CP Ch. 13.6 - What is wrong in the following code? public class...Ch. 13.6 - Prob. 13.6.6CP Ch. 13.6 - Listing 13.5 has an error. If you add list.add...Ch. 13.7 - Can a class invoke the super.clone() when...Ch. 13.7 - Prob. 13.7.2CP Ch. 13.7 - Show the output of the following code:...Ch. 13.7 - Prob. 13.7.4CP Ch. 13.7 - What is wrong in the following code? public class...Ch. 13.7 - Show the output of the following code: public...Ch. 13.8 - Prob. 13.8.1CP Ch. 13.8 - Prob. 13.8.2CP Ch. 13.8 - Prob. 13.8.3CP Ch. 13.9 - Show the output of the following code: Rational r1...Ch. 13.9 - Prob. 13.9.2CP Ch. 13.9 - Prob. 13.9.3CP Ch. 13.9 - Simplify the code in lines 8285 in Listing 13.13...Ch. 13.9 - Prob. 13.9.5CP Ch. 13.9 - The preceding question shows a bug in the toString...Ch. 13.10 - Describe class-design guidelines.Ch. 13 - (Triangle class) Design a new Triangle class that...Ch. 13 - (Shuffle ArrayList) Write the following method...Ch. 13 - (Sort ArrayList) Write the following method that...Ch. 13 - (Display calendars) Rewrite the PrintCalendar...Ch. 13 - (Enable GeometricObject comparable) Modify the...Ch. 13 - Prob. 13.6PE Ch. 13 - (The Colorable interface) Design an interface...Ch. 13 - (Revise the MyStack class) Rewrite the MyStack...Ch. 13 - Prob. 13.9PE Ch. 13 - Prob. 13.10PE Ch. 13 - (The Octagon class) Write a class named Octagon...Ch. 13 - Prob. 13.12PE Ch. 13 - Prob. 13.13PE Ch. 13 - (Demonstrate the benefits of encapsulation)...Ch. 13 - Prob. 13.15PE Ch. 13 - (Math: The Complex class) A complex number is a...Ch. 13 - (Use the Rational class) Write a program that...Ch. 13 - (Convert decimals to fractious) Write a program...Ch. 13 - (Algebra: solve quadratic equations) Rewrite...Ch. 13 - (Algebra: vertex form equations) The equation of a...

Additional Engineering Textbook Solutions

Find more solutions based on key concepts

T F C-string-handling functions accept as arguments pointers to strings (array names or pointer variables), or ...

Starting Out with C++ from Control Structures to Objects (9th Edition)

Why is the study of database technology important?

Database Concepts (8th Edition)

Determine the slope and deflection of end A of the cantilevered beam. E = 200 GPa and I = 65.0(106) mm4. F121

Mechanics of Materials (10th Edition)

ICA 2-1 For each of the following situations, indicate whether you think the action is ethical or unethical or ...

Thinking Like an Engineer: An Active Learning Approach (4th Edition)

Stock Commission Kathryn bought 600 shares of stock at a price of 21.77 per share. She must pay her stockbroker...

Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)

This optional Google account security feature sends you a message with a code that you must enter, in addition ...

SURVEY OF OPERATING SYSTEMS

Knowledge Booster

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.