Display a specified message for the entered date Program plan: Import necessary package. Create a class “PastPresentFuture”, Define the method “main ()”, Declare the necessary variables. Create an object for “LocalDate” class. Create “Scanner” object. Assign the month value returned from the method “getMonthValue()”. Assign the day value returned from the method “getDayOfMonth()”. Assign the month value returned from the method “getYear()”. Prompt the user to enter the month, day, and year. Get the month, day and year from the user. Check whether the year is a today’s year, If it is true, print the related message. Otherwise, check whether the month is today’s month, If it is true, print the related message. Otherwise, check whether the day is same as today, If it is true, print the related message. Otherwise, print the month related message.

Question

After playing our giving implementation, your task is to implement Dinning Philosophers with semaphore in C, by including and Your implementation will require creating five philosophers, each identified by a number 0.4. Each philosopher will run as a separate thread. Create threads using Pthreads as discussed in the Lecture slides on Chapter 4 and Practice Lab on Threads. Your solution needs to accomplish the following: Implement in C (15 points) 1. dp1.c - You are to provide your solution to this assignment as a single C program named 'dp1.c using semaphore. Explain in you code (as comments) that the dead lock will happen or not. If there is a possible deadlock, you can simply solve the deadlock by pick the fork in order like the first solution in our slides. Solve Deadlock by Footman (15 points) 1. Here is a new solution to overcome the deadlock. The Dining Philosophers decide to hire a footman whose task to allow only four philosophers to sit on the table. When entering and…

Answer 1

Question

Chapter 5, Problem 5PE

a.

Program Plan Intro

Display a specified message for the entered date

Program plan:

Import necessary package.

Create a class “PastPresentFuture”,

Define the method “main ()”,

Declare the necessary variables.

Create an object for “LocalDate” class.

Create “Scanner” object.

Assign the month value returned from the method “getMonthValue()”.

Assign the day value returned from the method “getDayOfMonth()”.

Assign the month value returned from the method “getYear()”.

Prompt the user to enter the month, day, and year.

Get the month, day and year from the user.

Check whether the year is a today’s year,

If it is true, print the related message.

Otherwise, check whether the month is today’s month,

If it is true, print the related message.

Otherwise, check whether the day is same as today,

If it is true, print the related message.

Otherwise, print the month related message.

b.

Program Plan Intro

Display a specified message for the entered date

Program plan:

Import necessary package.

Create a class “PastPresentFuture2”,

Define the method “main ()”,

Declare the necessary variables.

Create an object for “LocalDate” class.

Create another instance variable for “LocalDate” class.

Create “Scanner” object.

Assign the month value returned from the method “getMonthValue()”.

Assign the day value returned from the method “getDayOfMonth()”.

Assign the month value returned from the method “getYear()”.

Prompt the user to enter the month, day, and year.

Get the month, day and year from the user.

Assign the values in a date format.

Check whether the entered date is a past date,

If it is true, print the related message that indicates the past date.

Otherwise, check whether the date is the current date,

If it is true, print the related message that indicates the current date.

Otherwise, print the month related message that indicates the future date.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

After playing our giving implementation, your task is to implement Dinning Philosophers with semaphore in C, by including and Your implementation will require creating five philosophers, each identified by a number 0.4. Each philosopher will run as a separate thread. Create threads using Pthreads as discussed in the Lecture slides on Chapter 4 and Practice Lab on Threads. Your solution needs to accomplish the following: Implement in C (15 points) 1. dp1.c - You are to provide your solution to this assignment as a single C program named 'dp1.c using semaphore. Explain in you code (as comments) that the dead lock will happen or not. If there is a possible deadlock, you can simply solve the deadlock by pick the fork in order like the first solution in our slides. Solve Deadlock by Footman (15 points) 1. Here is a new solution to overcome the deadlock. The Dining Philosophers decide to hire a footman whose task to allow only four philosophers to sit on the table. When entering and…

8.4 Self-Bias Configuration 20. Determine Zi. Zo. and A,, for the network of Fig. 8.73 if gf, = 3000 μS and gos = 50 μs. 21. Determine Z, Zo, and A, for the network of Fig. 8.73 if the 20-uF capacitor is removed and the parameters of the network are the same as in Problem 20. Compare results with those of Problem 20. +12 V 3.3 ΚΩ HE C₂ Vo Z Zo C₁ 10 ΜΩ Z₁ 1.1 ΚΩ Cs 20 µF FIG. 8.73 Problems 20, 21, 22, and 59.

21. Determine Zi, Zo, and A, for the network of Fig. 8.73 if the 20-μF capacitor is removed and the parameters of the network are the same as in Problem 20. Compare results with those of Problem 20. +12 V 3.3 ΚΩ +6 C₂ C₁ Z₁ 10 ΜΩ 1.1 ΚΩ Cs 20 μF FIG. 8.73 Zo