Mindtap Programming, 1 Term (6 Months) Printed Access Card For Farrell's Java Programming, 9th
Mindtap Programming, 1 Term (6 Months) Printed Access Card For Farrell's Java Programming, 9th
9th Edition
ISBN: 9781337397117
Author: FARRELL, Joyce
Publisher: Cengage Learning
bartleby

Videos

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

Explanation of Solution

Program:

File name: “BirthdayReminder.java

//Import necessary header files

import java.util.*;

//Define a class named BirthdayReminder

public class BirthdayReminder

{

    //Define main method

    public static void main(String[] args)

    {

        //Declare the variables and initialize the values

        final int NUM_NAMES = 10;

        String sentinal = "ZZZ";

        int count = 0;

        String name = null;

        String birthdate = null;

        //Declare an array of values

        String[] names = new String[NUM_NAMES];

        String[] birthdates = new String[NUM_NAMES];

        //Create an object for Scanner class

        Scanner input = new Scanner(System.in);

        //Prompt the user to enter a name

System.out.println("Enter a name or " + sentinal + " to quit > ");

        name = input.nextLine();

/*While condition to check if the user enters the sentinel value ZZZ for a name or has entered 10 names*/

        while(name.compareTo(sentinal)!=0 && count < NUM_NAMES)

        {

            //Prompt the user to enter the birthdate

            System.out.println("Enter birthdate (mm/dd) > ");

            birthdate = input.nextLine();

            //Store the count of names and birthdate entered

            names[count] = name.trim();

            birthdates[count] = birthdate.trim();

            //Prompt the user to enter a name

System.out.println("Enter a name or " + sentinal + " to quit > ");

            name = input.nextLine();

            //Increment the count

            ++ count;

        }

        //Print the result

        System.out.println("\nCount of names is " + count);

        System.out.println("\nNames are:" + count);

        //For loop is executed until x exceeds count

        for(int x = 0; x < count; ++x)

        //Print the result

        System.out.println(names[x]) ;

        //Declare boolean variables and initialize the value

        boolean repeat = true;

        boolean found;

        //While condition to repeat the loop

        while(repeat)

        {

            //Assign false value to found

            found=false;

            //Prompt the user to enter a name

System...

Blurred answer
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
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
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
C++ Programming Tutorial 36 - Intro to Loops; Author: Caleb Curry;https://www.youtube.com/watch?v=M3o7Y0juEP0;License: Standard YouTube License, CC-BY