Suppose a computer's login mechanism first asks for a user name, and rejects the login if the name is not one of those in its password file. If the login name is in the password file, then the system prompts for the password, and admits the user to the system if (and only if) the password is correct. Henrietta the Hacker has a list of 10,000 commonly used login names, and a list of 100,000 commonly used passwords. On this computer, there are 100 accounts that have both a login name on the first list and a password on the second list. For simplicity, assume that no other accounts have either a login name or password on these lists. Henrietta has written code that can attempt 1000 logins per second on this computer. This program repeatedly chooses a random login name from the first list, until it finds one that is not rejected. It then repeatedly and randomly picks a password from the second list and uses it in conjunction with the found login name.

Required:
Compute the expected number of seconds it will take Henrietta to break into some account on the machine.

[a] create a class called “cycle” which has two instance integer variables as properties, “numberofwheels” and “weight.” create a constructor with two parameters, using the same variable names in the parameter list. assign each variable to numberofwheels” and “weight” respectively. write a separate application to test the class and display its properties. note: do not change the names of the instance variables or the variables listed in the constructor’s parameter list. [b] edit your class cycle by adding a default constructor which will assign the default values of 100 to represent the numberofwheels, and 1000 to represent the weight, by invoking a call to the other constructor. modify your application created in [a] to test the class.

Write a modular program (no classes yet, just from what you learned last year), that allows two players to play a game of tic-tac-toe. use a two-dimensional char array with 3 rows and 3 columns as the game board. each element of the array should be initialized with an asterisk (*). the program should display the initial board configuration and then start a loop that does the following: allow player 1 to select a location on the board for an x by entering a row and column number. then redisplay the board with an x replacing the * in the chosen location. if there is no winner yet and the board is not yet full, allow player 2 to select a location on the board for an o by entering a row and column number. then redisplay the board with an o replacing the * in the chosen location. the loop should continue until a player has won or a tie has occurred, then display a message indicating who won, or reporting that a tie occurred. player 1 wins when there are three xs in a row, a column, or a diagonal on the game board. player 2 wins when there are three ox in a row, a column, or a diagonal on the game board. a tie occurs when all of the locations on the board are full, but there is no winner. input validation: only allow legal moves to be entered. the row must be 1, 2, or 3. the column must be 1, 2 3. the (row, column) position entered must currently be empty (i. e., still have an asterisk in it).

Competent nonverbal communication involves interacting with others in a manner that is appropriate for which of the following? select all that apply. situation task individuals