Password Verifier Program Plan: The detail of “PasswordDemo” class is shown below: In the “main()” method, Declare the required variable. Read the password input from user. Check whether the password is valid or not. If yes, Display the error message to user. Otherwise, display the valid password message to user. Exit the system. The detail of “PasswordVerifier” class is shown below: Declare and initialize the minimum password length. In the isValid() method, Declare the variable. Check whether the password is valid or not. If yes, Set the status as “true”. Otherwise, set the status as “false”. Return the status. In the hasUpperCase() method, Declare the variable. The for loop executes until length of string. If yes, Check the string has at least one uppercase character. If yes, set the status as “true”. Return the status. In the hasLowerCase() method, Declare the variable. The for loop executes until length of string. If yes, Check the string has at least one lowercase character. If yes, set the status as “true”. Return the status. In the hasDigit() method, Declare the variable. The for loop executes until length of string. If yes, Check the string contains numeric digit. If yes, set the status as “true”. Return the status.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9, Problem 5PC

Program Plan Intro

Password Verifier

Program Plan:

The detail of “PasswordDemo” class is shown below:

In the “main()” method,

Declare the required variable.

Read the password input from user.

Check whether the password is valid or not. If yes,

Display the error message to user.

Otherwise, display the valid password message to user.

Exit the system.

The detail of “PasswordVerifier” class is shown below:

Declare and initialize the minimum password length.

In the isValid() method,

Declare the variable.

Check whether the password is valid or not. If yes,

Set the status as “true”.

Otherwise, set the status as “false”.

Return the status.

In the hasUpperCase() method,

Declare the variable.

The for loop executes until length of string. If yes,

Check the string has at least one uppercase character. If yes, set the status as “true”.

Return the status.

In the hasLowerCase() method,

Declare the variable.

The for loop executes until length of string. If yes,

Check the string has at least one lowercase character. If yes, set the status as “true”.

Return the status.

In the hasDigit() method,

Declare the variable.

The for loop executes until length of string. If yes,

Check the string contains numeric digit. If yes, set the status as “true”.

Return the status.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the