Suppose that you have the following requirements for a university database that is used to keep
track of students’ transcripts: The university keeps track of the students name, student number,
current address, phone, birth date, gender, class (‘freshman’, ‘sophomore’, … , ‘graduate’),
major department. Each department is described by a name, department code, office number
and college. Each student can study more than a course that has a course name, description,
course code, number of semester hours, level, and offering department. Finally, a grade record
refers to a student, a particular course, and the total degree of all courses he has studied.
Design the ERD for this database and implement the schema for this database application using
the suitable SQL commands. First show all the functional dependencies that should hold among
the database attributes. Then design relation schemas for the database that are each in 3NF with
clarifying the conditions you have applied to reach the 3NF. Specify the key attributes of each
relation. Note make any appropriate assumptions to render the specification complete.

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

What a backup plan that you have created in a event you encounter a situation

How many nibbles can be stored in a 16-bit word?