Java Programming, Loose-leaf Version
Java Programming, Loose-leaf Version
8th Edition
ISBN: 9781337685917
Author: Joyce Farrell
Publisher: Cengage Learning
bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 8, Problem 3PE

a.

Explanation of Solution

Program:

File name: “CarCareChoice.java

//Import necessary header files

import javax.swing.*;

//Define a class named CarCareChoice

public class CarCareChoice

{

    //Define a main method

    public static void main (String[] args)

    {

        //Declare a Boolean variable and initialize the value

        boolean isMatch = false;

        //Declare a list of available services

        String[] items =  { "oil change", "tire rotation",

         "battery check", "brake inspection"};

        //Declare an array of values

        int[] prices = {25, 22, 15, 5};

        //Declare the variables

        int x;

        int matchIndex = 0;

        //Prompt the user to enter a selection

        String menu = "Enter selection:";

        for(x = 0; x < items.length; ++x)

        menu += "\n   " + items[x];

        //Show input dialog box

        String selection = JOptionPane...

b.

Explanation of Solution

Program:

File name: “CarCareChoice2.java

//Import necessary header files

import javax.swing.*;

//Define a class named CarCareChoice2

public class CarCareChoice2

{

    //Define a main method

    public static void main (String[] args)

    {

        //Declare a Boolean variable and initialize the value

        boolean isMatch = false;

        //Declare a list of available services

        String[] items =  { "oil change", "tire rotation",

         "battery check", "brake inspection"};

        //Declare an array of values

        int[] prices = {25, 22, 15, 5};

        //Declare the variables

        int x;

        int matchIndex = 0;

        //Prompt the user to enter a selection

        String menu = "Enter selection:";

        for(x = 0; x < items.length; ++x)

            menu += "\n   " + items[x];

        //Show input dialog box

String selection = JOptionPane...

Blurred answer
Students have asked these similar questions
Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)
Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)
Design a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)
Knowledge Booster
Background pattern image
Computer Science
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.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Dictionaries - Introduction to Data Structures (Episode 8); Author: NullPointer Exception;https://www.youtube.com/watch?v=j0cPnbtp1_w;License: Standard YouTube License, CC-BY