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

Trending nowThis is a popular solution!

- Write a short paper (1 page/about 500 words) summarizing what we as System Admins can do to protect the CIA of our servers. Outline the overall steps for configuring and securing Linux servers Consider and describe how a mixed Operating System environment will affect what you have to do to protect the company assets Describe at least three technologies that will help to protect CIA of data on Linux systems Required Resourcesarrow_forwardusing r language Estimate the MSE of the level k trimmed means for random samples of size 20 generated from a standard Cauchy distribution. (The target parameter θis the center or median; the expected value does not exist.) Summarize the estimates of MSE in a table for k= 1,2,...,9arrow_forwardusing r language Estimate the MSE of the level k trimmed means for random samples of size 20 generated from a standard Cauchy distribution. (The target parameter θis the center or median; the expected value does not exist.) Summarize the estimates of MSE in a table for k= 1,2,...,9arrow_forward
- using r language The data law82 in bootstrap library contains LSAT and GPA for 82 law schools. Compute a 95% bootstrap t confidence interval estimates for the correlation statisticsarrow_forwardusing r language The data law82 in bootstrap library contains LSAT and GPA for 82 law schools. Compute a 95% bootstrap t confidence interval estimates for the correlation statisticsarrow_forwardusing r langauge The data law82 in bootstrap library contains LSAT and GPA for 82 law schools. Compute and compare the three 95% bootstrap confidence interval estimates for the correlation statistics.arrow_forward
- What is the number of derangements of size k from the set {1,2,...n} to the set {1,2,...n} so that f(x) != x exactly k times with 1 <= k <= narrow_forwardTrace a State Space Tree introduced in the Chapter 5.1 using algorithms depth_first_search (page 205), checknode (page 207), and expand (page 210). Assume that State Space Tree is a two-level full binary tree (root is level 0). Node #2 (according to notation used in the Figure 5.1, page 204) is non-promising. Count the number of steps performed by each of those three algorithms. Consider execution of instructions like "visit node" or execution of "promising function" as one step, "write a solution" as an exit call. Note: no need to print or a draw a whole tree. Just provide three numbers as an answerarrow_forwardParking Tickets Table St ID L_Name ☐ F_Name Phone_No St_Lic Lic_No Ticket# Date Code Fine 38249 38249 82453 Green 82453 Green 82453 Green Brown Thomas 111-7804 FL BRY 123 15634 10/17/06 2 $25 Brown Thomas 111-7804 FL BRY 123 16017 11/13/06 1 $15 Sally 391-1689 AL TRE 141 14987 10/05/06 3 $100 Sally 391-1689 AL Sally 391-1689 AL TRE 141 TRE 141 16293 11/18/06 1 $15 17892 12/13/06 2 $25 The functional dependencies are: St_ID → L_Name, F_Name, Phone_No, St_Lic, Lic_No St_Lic → Lic_No Code → Fine St_ID, Ticket # → Date 1. In what normal form is the relation?| 2. Convert PARKING TICKET to a set of 3NF relations.arrow_forward
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageProgramming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning
- Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,EBK JAVA PROGRAMMINGComputer ScienceISBN:9781305480537Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning




