Question 1 (2 + 3) [CO1]Consider the following code:public class DemoClass{private double PI = 3.1416;void calculateArea(double radius){double area = PI*radius*radius;System.out.println("Area: " + area);}public static void main(String []args){calculateArea(5.0);}a) Suggest modification to the code so that the value of PI cannot be modified later. Also modify the above code sothat it can run without any error.b) Create a non-static inner class inside the DemoClass. Move the calculateArea() function inside the inner class.Now call the calcualteArea() function from the main() function.

class DemoClass{ final private double PI = 3.1416; // Use final such that PI can not be modified…

Answered: Consider the following code: public…

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

complete the missing code. public class Exercise09_04Extra { public static void main(String[] args) { SimpleTime time = new SimpleTime(); time.hour = 2; time.minute = 3; time.second = 4; System.out.println("Hour: " + time.hour + " Minute: " + time.minute + " Second: " + time.second); } } class SimpleTime { // Complete the code to declare the data fields hour, // minute, and second of the int type }
(a)consider following code:public class CyclomaticComplexityDemo {public static void main(String[] args) {// TODO Auto-generated method stubint var1 = 10;int var2 = 9;int var3 = 8; 6 int var4 = 7;if (var1 == 10){if(var2 > var3){var2 = var3;}else{if (var3 > var4){var3 = var4;}else{var4 = var1;}}}else{var1=var4;}System.out.println("Printing value for var1, var2, var3, and var4"+var1+" "+var2+" "+var3+""+var4);}}i) Find the cyclometric complexity with all the techniques.ii) Find the independent paths
public class Main5 1 public static void main(String[] args) { inta= butjwant 0 833 please help me i am begineer ir ava
For the code below: public class College extends Student { public static void main(String[ ] args) { new College( ); } public College ( ) { this(“First semester"); System.out.println( "Third year" ); } public College (string G ) { System.out.println(G); } } class Student extends S_info { public Student ( ) { System.out.println("Student No. 123"); } public Student (String S) { System.out.println(S); } } class S_info{ public S_info ( ) { System.out.println("student age: 21"); } } 1- Draw the diagram for the constructor chaining. 2- Put the values for the strings G and S. 3- Trace the output for the entire code.
PROBLEM STATEMENT: Return a number, 1 lesser than the given number. public class Decrement{public static int solution(int x){// ↓↓↓↓ your code goes here ↓↓↓↓return 0;}} Can you please use The source code i provided
Consider the following piece of code. (The numbers on the left margin denote line numbers.) line#01 public class funcRef {02 private int n;03 public funcRef (int m) {n = m;}04 public static void func (funcRef t) {t.n++;}05 public static void main (String [] args) {06 funcRef t1, t2;07 t1 = new funcRef(20);08 t2 = t1;09 System.out.print(t2.n);10 func(t1);11 System.out.print(t2.n);12 func(t1);13 System.out.print(t1.n);14 func(t2);15 System.out.print(t1.n);16 func(t2);17 System.out.print(t1.n);18 System.out.print(t1.n);19 return;20 }21 } Out of the following, tick the true statements and leave the false statements unticked.(More than one of the statements could be true. You get full marks only for marking all the statements correctly. There are no partial marks.) A. The output of the program will be 202022222222. B. When func(t1) is called in line…
2-7 Given the code below, which lines are valid and invalid.
Task 4: public class Palindrome TestWrapper final String isMsq = "IS a palindrome"; final String isNotMsq- " is NOT a palindrome"; public static void main(String args[]) new PalindromeTestWrapper(); public PalindromeTestWrapper() // your code here 1 public boolean isPalindrome ( Strings ) 1 // your code here Using the code defined above, complete the isPalindrome method so that it returns true if s is a palindrome and false if it isn't. You must use a stack in your solution algorithm.
Flight assignment runs but there is no imput values for the user to interact when running the program. Kindly fix this issue.import java.util.*; class Flight { String airlineCode; int flightNumber; char type; // D for domestic, I for international String departureAirportCode; String departureGate; char departureDay; int departureTime; String arrivalAirportCode; String arrivalGate; char arrivalDay; int arrivalTime; char status; // S for scheduled, A for arrived, D for departed public Flight(String airlineCode, int flightNumber, char type, String departureAirportCode, String departureGate, char departureDay, int departureTime, String arrivalAirportCode, String arrivalGate, char arrivalDay, int arrivalTime) { this.airlineCode = airlineCode; this.flightNumber = flightNumber; this.type = type; this.departureAirportCode = departureAirportCode; this.departureGate = departureGate;…
public class Polygon { private double sideLength; private int sides; private String shape; public double getArea () { int n sides; double a sideLength; return ((a * a * n) / (4 * Math.tan((180 / n) 3.14159 / 180))); public void setPolygon (double sl, int sd, String sh) { sides-sd; sideLength-sl; shape=sh; public Polygon (double sl, int sd, String sh) ( sides-sd; sideLengthsl; shape=sh; public String getShape () { return (shape); } public int getSides () { return (sides); } public double getLength () { return (sideLength); } Write a static method named find that takes as a parameter an array of type Polygon named list. The method should print the shapes of each polygon that has an area greater than 500 and return their count. The method prototype is public static int find (Polygon [] list); Note: assume the array is already declared, populated with data in the main method and ready to be used.

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