Mindtap Computing, 1 Term (6 Months) Printed Access Card For Farrell’s Java Programming, 8th
Mindtap Computing, 1 Term (6 Months) Printed Access Card For Farrell’s Java Programming, 8th
8th Edition
ISBN: 9781337091480
Author: Joyce Farrell
Publisher: Cengage Learning
bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 8, Problem 7PE

a.

Explanation of Solution

Program:

File name: “CollegeCourse.java

//Define a class named CollegeCourse

public class CollegeCourse

{

    //Declare the private variables

    private String courseID;

    private int credits; 

    private char grade;

    //Define a get method that returns the course ID

    public String getID()

    {

        //Return the value

        return courseID;

    }

    //Define a get method that returns the credit hours

    public int getCredits()

    {

        //Return the value

        return credits;

    }

    //Define a get method that returns the letter grade

    public char getGrade()

    {

        //Return the value

        return grade;

    }

    //Define a set method that takes the course ID

    public void setID(String idNum)

    {

        //Assign the value

        courseID = idNum;

    }

    //Define a set method that takes the credit hours

    public void setCredits(int cr)

    {

        //Assign the value

        credits = cr;

    }

    //Define a set method that takes the letter grade

    public void setGrade(char gr)

    {

        //Assign the value

        grade = gr;

    }

}

File name: “Student...

b.

Explanation of Solution

Program:

File name: “InputGrades.java

//Import necessary header files

import college.CollegeCourse;

import college.Student;

import javax.swing.*;

//Define a class named InputGrades

public class InputGrades

{

    //Define a main method

    public static void main(String[] args)

    {

        //Declare an array to store data of 10 students

        Student[] students = new Student[10];

        //Declare the variables and initialize the values

        int x, y, z;

        String courseEntry, entry  = "",  message;

        int idEntry, credits;

        char gradeEntry = ' ';

        boolean isGoodGrade =  false;

        final int NUM_COURSES = 5;

        //Declare an array to store five grades

        char[] grades = {'A', 'B', 'C', 'D', 'F'};

        //For loop to be executed until x exceeds 10

        for(x = 0; x < students.length; ++x)

        {

            //Create a student object

            Student stu = new Student();

            //Prompt the user to enter the student ID

entry = JOptionPane.showInputDialog(null, "For student #" +

            (x + 1) + ", enter the student ID");

            idEntry  = Integer.parseInt(entry);

            //Function call

            stu.setID(idEntry);

            //For loop to be executed until y exceeds 5

            for(y = 0; y < NUM_COURSES; ++y)

            {

                //Prompt the user to enter the course

                courseEntry = JOptionPane.showInputDialog(null,

                "For student #" + (x + 1) + ", enter course #" +

                (y + 1));

//Prompt the user to enter the credits for each //course

                entry  = JOptionPane.showInputDialog(null,

                "For student #" + (x + 1) +

                ", enter credits for course  #" + (y + 1));

                credits = Integer.parseInt(entry);

                //Assign the value false to isGoodGrade

                isGoodGrade = false;

                //While the user does not enter isGoodGrade

                while(!isGoodGrade)

                {

//Prompt the user to enter the grade for //course

                    entry  = JOptionPane.showInputDialog(null,

                    "For student #" + (x + 1) +

                    ", enter grade for course  #" + (y + 1));

                    gradeEntry = entry...

Blurred answer
Students have asked these similar questions
Using MATLAB symbolic toolbox, given these 3 equations, how would you solve for mu = function(theta), making sure that there are no mu's on the right hand side, making sure theta-dot-dot, theta-dot-squared- and N aren't in the final answer either.
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.
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Memory Management Tutorial in Java | Java Stack vs Heap | Java Training | Edureka; Author: edureka!;https://www.youtube.com/watch?v=fM8yj93X80s;License: Standard YouTube License, CC-BY