Create a Java Application that will calculate the CGPA of a student. The application should run as follows: 1. Ask for the student name 2. Ask for his registration number Then, prompt user with the following: Do you want to enter subject marks for student? Y/N if "Y" is selected then Then, prompt user with the following menu: 1. Enter subject marks (theory only) 2. Enter subject marks (theory and lab) if "1" is slected, then user is prompted as follows: 1. Enter subject name 2. Enter subject marks if "2" is slected, then user is prompted as follows : 1. Enter subject name 2. Enter subject theory marks 3. Enter subject lab marks Once done, again prompt the user with the menu: Do you want to enter subject marks for student? Y/N

Create a Java Application that will calculate the CGPA of a student. The application should run as follows: 1. Ask for the student name 2. Ask for his registration number Then, prompt user with the following: Do you want to enter subject marks for student? Y/N if "Y" is selected then Then, prompt user with the following menu: 1. Enter subject marks (theory only) 2. Enter subject marks (theory and lab) if "1" is slected, then user is prompted as follows: 1. Enter subject name 2. Enter subject marks if "2" is slected, then user is prompted as follows : 1. Enter subject name 2. Enter subject theory marks 3. Enter subject lab marks Once done, again prompt the user with the menu: Do you want to enter subject marks for student? Y/N

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Follow instructions please
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
Please help me this using recursion and java. Create a sierpenski triangle. And please comment the code. Do not create the game using hashta
I want solution with step
After completing the methods, use the main method to test them.
Please explain the questions related to the code below: //1. Why is 20 printed 3 times and why does it start with 1, but end with 2? //2. What is the base case for this recursive method and why? //3. How would you implement this using a loop? //4. What is each if statement checking? //5. Would a solution to this using loops require more or less code and would it be more or less effecient? //6. Why is recursion a good choice to solve this problem? //7. How can recursion become infinite? //8. When is recursion appropriate? /* Load the code below into a cloud compiler and run each method one at a time by removing the comments for the method. Walk through the code as a group and explore how the code works. Submit the answers to the numbered questions for credit. */ public class DemoRecur { //Simple statement designed to show control flow in recursion public static void printDemo(int x, int max) {…
can you answer this . thank you
Thank you. Plz provide a screenshot of the code. Further I want to write method 4 and called method 3(u just wrote) from method 4. Method 4: A method to count the occurrences of each value in an array takes one parameter, an array of integers returns an array containing the number of times each value occurs in the parameter array
Java programming help please. Main and other class of code is below. Thank you so so much. i have to Write a program that does the following: You have an array of integers with positive and negative values. using one ourArray object (will post code of "ourArrary" below) , and in two loops maximum, How can you reorganize the content of the array so that all negative numbers are on one side and the positive numbers are on the other side. [-3, 2, -4, 5, -6, -8,-9, 7, 13] The output should be [-3, -4, -6, -8, -9, 2, 5, 7, 13] Our array code: public class ourArray<T> implements iQueue{ private T[] Ar; private int size = 0; private int increment = 100; //default constructor @SuppressWarnings("unchecked") public ourArray () { Ar = (T[]) new Object[100]; size = 0; } //constructor that accepts the size @SuppressWarnings("unchecked") public ourArray (int n) { Ar = (T[]) new Object[n]; size = 0; } //constructor that specifies the initial capacity and the increment…
Q1. Write a recursive method to fine the factorial n for negative n as well as positive n. thrown an IllegalArgumentException if n is negative 1. Your answer must have to read the value of 'n' 3. If the number “n" is negative, then throw the exception 4. Use recursive method. 5. Test the program in main method.