How would you solve question 11 while also throwing exceptions if n is less than zero? UI Lhat rep-dent's grade point average. The user WIII typu turesents the number of scores, followed by that many integer scores. Here are two example dialogue.Enter a student record: Maria 5 72 91 84 89 78Maria's grade is 82.8Enter a student record: Jordan 4 86 71 62 90Jordan's grade is 77.25Maria's grade is 82.8 because her average of (72 + 91 + 84 + 89 + 78)/5 equals 82.8.11. Write a method called longestName that accepts a Scanner for the console and an integer n as parameters andprompts for n names, then prints the longest name (the name that contains the most characters) in the format shownbelow, which might result from a call of longestName (console, 4):name #1? Royname #2? DANEname #3? STEFANIEname #4? MarianaStefanie's name is longest12. Write the method called printTriangleType referred to in Self-Check Problem 25. This method accepts tileinte uments representing the lengths of the sides of a triangle and prints the type of triangle that these sidcsome sample calls to printTriangleType:eType (5, 7, 7);gleType (6, 6, 6);angleType (5, 7, 8);CTriangleType (2, 18, 2);

Below is the code which tells the longest name among the given strings and also tells if there is a…

Answered: Maria's grade is 82.8 because her…

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

The number of permutations of a set of n items taken r at a time is given by the followingformulan!/r!(n−r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is thefactorial of the result of n-r. The factorial of a number n can be solved using the followingformula: n!=e−nnn√ 2πn.If there are 18 people in your class and you want to divide the class into programming teams of 3members, you can compute the number of different teams that can be arranged using this formula(n!/r!(n−r)!).Write a C++ program that determines the number of potential team arrangements. You will needto use the double type for this computation. Use the Lab Template you set-up last week, properformatting, and appropriate comments in your code. The output must be labeled clearly andformatted neatly.
Question # 2Assume the followingString s,t,h,a,n,e;int i;h = “Hello”;s = “How are you?”a = “abc”;n = null;e = “”;Give the values of the following expressions, or illegal1. h.length()2. h.substring(1)3. h.toUpperCase()4. h.toUpperCase().toLowerCase()5. h.indexOf("H")6. h.startsWith("ell")7. "Tomorrow".indexOf("o")8. "Tomorrow".indexOf("o", 3)9. "Tomorrow".lastIndexOf('o')10. "a = \"" + a + "\""11. (a.length() + a).startsWith("a")12. a.length() + a.startsWith("a")13. ">>>" + a.length() + a.startsWith("a")14. a.substring(1,3).equals("bc")15. a.substring(1,3) == "bc"16. "a".compareTo("c")17.…
What is the probability that in a classroom of x people, at least 2 will be born on the same day of the year, ignoring leap year? The number of people (x) in the simulated class is given by the user. Please use the code outline that I was given: import mathimport random # create and initialize frequency table:ft = []k = 0while(k < 365) : ft.append(0) k = k+1 # Allow the user to determine class size:print("Please type in how many people are in the class: ")x= int(input()) success = 0 # Simulate:c = 0while(c < 10000) : # Step 1: re-initialize birthday frequency table (it must be re-initialized for each play-through (why?): k = 0 while(k < 365) : ft[k] = 0 k = k+1 # Step 2: randomly get x birthdays and update frequency table: k = 0 while(k < x): # your code goes here ########################## k = k+1 # Step 3: Check to see if this class has at least two people with same b-day and update success appropriately k = 0 while(k < 365):…
Write it's main. char space[3][100] = { "#.*.#******#****.****#.*.", "#***#******#*.**.*.*.#***", "#*.*#******#*********#*.*" }; int space_ind; for(space_ind = 0; space[0][space_ind];space_ind++) { if(space[0][space_ind] == '#') printf("#"); elseif (space[2][space_ind] == '.' ) continue; elseif(space[0][space_ind] == '.') printf("A"); elseif(space[1][space_ind] == '.') printf("I"); elseif(space[0][space_ind+1] == '.') printf("U"); elseif(space[1][space_ind+1] == '.') printf("O"); elseprintf("E"); if(space[0][space_ind] == '#' || space[2][space_ind] == '.' ) continue; else space_ind+=2; } return0;.
Constellation. Write it's main. char space[3][100] = { "#.*.#******#****.****#.*.", "#***#******#*.**.*.*.#***", "#*.*#******#*********#*.*" }; int space_ind; for(space_ind = 0; space[0][space_ind];space_ind++) { if(space[0][space_ind] == '#') printf("#"); elseif (space[2][space_ind] == '.' ) continue; elseif(space[0][space_ind] == '.') printf("A"); elseif(space[1][space_ind] == '.') printf("I"); elseif(space[0][space_ind+1] == '.') printf("U"); elseif(space[1][space_ind+1] == '.') printf("O"); elseprintf("E"); if(space[0][space_ind] == '#' || space[2][space_ind] == '.' ) continue; else space_ind+=2; } return0;.
Assume the followingString s,t,h,a,n,e;int i;h = “Hello”;s = “How are you?”a = “abc”;n = null;e = “”;Give the values of the following expressions, or illegal1. h.length()2. h.substring(1)3. h.toUpperCase()4. h.toUpperCase().toLowerCase()5. h.indexOf("H")6. h.startsWith("ell")7. "Tomorrow".indexOf("o")8. "Tomorrow".indexOf("o", 3)9. "Tomorrow".lastIndexOf('o')10. "a = \"" + a + "\""11. (a.length() + a).startsWith("a")12. a.length() + a.startsWith("a")13. ">>>" + a.length() + a.startsWith("a")14. a.substring(1,3).equals("bc")15. a.substring(1,3) == "bc"16. "a".compareTo("c")17.…
Question P Print person1's kids, call the incNumKids() method, and print again, outputting text as below. End each line with a newline. Sample output for below program with input 3: Kids: 3 New baby, kids now: 4 // ===== Code from file PersonInfo.java =====public class PersonInfo {private int numKids; public void setNumKids(int setPersonsKids) {numKids = setPersonsKids;} public void incNumKids() {numKids = numKids + 1;} public int getNumKids() {return numKids;}}// ===== end ===== // ===== Code from file CallPersonInfo.java =====import java.util.Scanner; public class CallPersonInfo {public static void main(String [] args) {Scanner scnr = new Scanner(System.in);PersonInfo person1 = new PersonInfo();int personsKid; personsKid = scnr.nextInt(); person1.setNumKids(personsKid); /* Your solution goes here */ }}// ===== end ===== Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this…
Please fix the code below to make it faster def countInBox(particleData, steps, lx, ly, ux, uy):for _ in range(steps):for i in range(len(particleData)):nx, ny= particleData[i][2]/particleData[i][3], particleData[i][4]/particleData[i][5]x, y = particleData[i][0], particleData[i][1]particleData[i][0] = nx * x - ny * yparticleData[i][1] = ny * x + nx * yreturn sum([1 for i in range(len(particleData)) if(lx < particleData[i][0] < ux and ly < particleData[i][1] < uy)])
bob employs a painting company that wants to use your services to help create an invoice generating system. the painters submit an invoice weekly. they charges $30 per hour worked. they also charge tax -15%. bob likes to see an invoice that display all the information- number of hours, the charge per hours, the total Before tax and total After tax. since this is an invoice, we also need to display the name of the company (painting Xperts) at the top of the invoice. display all of the information on the screen. Using Pseudocode, develop an algorithm for this problem.
The number of permutations of a set of n items taken r at a time is given by the following formulan!/r!(n−r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is the factorial of the result of n-r. The factorial of a number n can be solved using the following formula: n !=e−n nn √ 2 πn. If there are 18 people in your class and you want to divide the class into programming teams of 3 members, you can compute the number of different teams that can be arranged using this formula (n!/r!(n−r)!). When writing a C++ program that determines the number of potential team arrangements. You will need to use the double type for this computation.
Complete the function below that takes in three integers (a,b,c) and returns the number of integers between a and b (inclusive of the endpoints) that are divisible by c. Make sure it tests a and b for divisibility by c! In [ ]: defhow_many_divisible(a,b,c):counter=0# YOUR CODE HEREraiseNotImplementedError()returncounter In [ ]: assert how_many_divisible(10,20,5) == 3 assert how_many_divisible(30,77,7) == 7 PYTHON jYPYTER
Java - Programming Develop a letter-guessing game in this assignment.Requirements:1). When the game begins, generate a random letter between A and Z;2). Display a message "I have a secret letter (A to Z), can you guess what it is?";3). Read the user's answer;4). Compare the user's answer and the random secret letter generated;5). If the user answer is before the random secret letter in the alphabet, display "Incorrect. Trysomething later in the alphabet" and go to Step 2;6). If the user answer is after the random secret letter in the alphabet, display "Incorrect. Trysomething earlier in the alphabet." and go to Step 2;7). If the user answer is the same as the random secret letter, display "Well done. Want to playagain (y/n)?";8). Read the user's answer. If the answer is 'y', go to Step 1. If the answer is 'n', go to Step 9;9). Display "Thanks for playing the game. Goodbye!". The program stops.Run your program several times. Take screenshots. Submit your Java file with the screenshots

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS