public class Main{public static void main(String args[]){static_out obj1 - new static_out();static_out obj2 = new static_out();int a - 2;obj1. add(a, a + 1);obj2.add(5, a);System.out.println(obj1.x +}4 -679+ obj2.y);121314class static_out{static int x;static int y;void add(int a, int b){x = a + b;y - x + b;15 -16171819 -20I21222324O 77.466.4O 79O 97O12 mt un o70 0 0o 234111 111 111 12 2222

Classes and objects in java: Java is an object-oriented programming language and makes use of…

public class Main 2- public static void main(String args[]) 3 static_out obji - new static_out(); static_out obj2 - new static_out(); int a - 2; obj1. add(a, a + 1); obj2.add(5, a); System.out.println(obj1.x + " " + obj2.y); 6. 9. 10 11 12 13 14 class static_out 15- static int x; static int y; void add(int a, int b) { x - a + b; y - x + b; 16 17 18 19 - 20 I 21 22 23 } 24 O 77.4 О 66.4 O 79 O 97 1.

public class Main 2- public static void main(String args[]) 3 static_out obji - new static_out(); static_out obj2 - new static_out(); int a - 2; obj1. add(a, a + 1); obj2.add(5, a); System.out.println(obj1.x + " " + obj2.y); 6. 9. 10 11 12 13 14 class static_out 15- static int x; static int y; void add(int a, int b) { x - a + b; y - x + b; 16 17 18 19 - 20 I 21 22 23 } 24 O 77.4 О 66.4 O 79 O 97 1.

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

import java.util.Scanner; public class LabProgram {    // Recursive method to draw the triangle public static void drawTriangle(int baseLength, int currentLength) { if (currentLength <= 0) { return; // Base case: stop when currentLength is 0 or negative } // Calculate the number of spaces needed for formatting int spaces = (baseLength - currentLength) / 2; if (currentLength == baseLength) { // If it's the first line, don't output spaces before the first '*' System.out.println("*".repeat(currentLength) + " "); } else { // Output spaces and asterisks System.out.println(" ".repeat(spaces) + "*".repeat(currentLength) + " "); } // Recursively call drawTriangle with the reduced currentLength drawTriangle(baseLength, currentLength - 2); }       public static void drawTriangle(int baseLength) { drawTriangle(baseLength, baseLength); } public static…
public class LabProgram { public static void main(String args[]) { Course course = new Course(); String first; // first name String last; // last name double gpa; // grade point average    first = "Henry"; last = "Cabot"; gpa = 3.5; course.addStudent(new Student(first, last, gpa)); // Add 1st student    first = "Brenda"; last = "Stern"; gpa = 2.0; course.addStudent(new Student(first, last, gpa)); // Add 2nd student    first = "Jane"; last = "Flynn"; gpa = 3.9; course.addStudent(new Student(first, last, gpa)); // Add 3rd student    first = "Lynda"; last = "Robison"; gpa = 3.2; course.addStudent(new Student(first, last, gpa)); // Add 4th student course.printRoster(); }    } // Class representing a student public class Student { private String first; // first name private String last; // last name private double gpa; // grade point average…
Rewrite the private static int recurseMax method without using Java API public class Recursion{   public static void main(String[] args){       // My tests (DO NOT MODIFY!)       int[] a = {3,2,6,4,15,7,9,8,6};       p(recurseSum(a));               // Sum should be 60       p(recurseMax(a));               // Max should be 15       // End of tests!   }     // Recursive methods below here...   public static int recurseSum(int[] a){       // TODO: This is the wrapper method. You must complete this AND implement helper method       int total = recurseSum(a, a.length);       return total;   }   private static int recurseSum(int[] a, int i){       if (i <= 0)            return 0;        return (recurseSum(a, i - 1) + a[i - 1]);   }     public static int recurseMax(int[] a){             int max = recurseMax(a, a.length);       return max;   }   private static int recurseMax(int[] a, int i){       if(i == 1)           return a[0];       return Math.max(a[i-1], recurseMax(a, i-1));   }   //…
please write it in C language. import java.util.*; public class EightQDfs { final int X = 4; void dispSol(int brd[][]) { for(int i = 0; i < X ; i++) { for(int j=0 ; j < X ; j++) { System.out.print(" " + brd[i][j]) + " "); System.out.println(); } } boolean isSafe(int brd[][] , int r , int c) //r is for row and c is column { int i , j; for(i = 0 ; i < c ; i++) if(brd[r][i] == 1) return false; for(i = r ; j = c ; i >=0 && j >= 0 ;i-- ,j--) if(brd[i][j] == 1) return false; for(i = r , j = c ; j >= 0 && i < X ; i++ , j--) if(brd[i][j] == 1) return false; return true; } boolean EQsolved(int brd[][] , int c) { if(c >= X) return true; for(int i= 0; i < X ;i++) { if(isSafe(brd , i , c)) { brd[i][c] = 1; if(EQsolved(brd , c + 1) == true ) return true; brd[i][c] = 0 ; } } return false; } boolean…
public class LabProgram { public static void main(String args[]) { Course cis162 = new Course(); int beforeCount; String toDrop; // Example students for testing cis162.addStudent(new Student("Henry", "Nguyen", 3.5)); cis162.addStudent(new Student("Brenda", "Stern", 2.0)); cis162.addStudent(new Student("Lynda", "Robison", 3.2)); cis162.addStudent(new Student("Sonya", "King", 3.9)); toDrop = "Stern"; beforeCount = cis162.countStudents(); cis162.dropStudent(toDrop); System.out.println("Course size: " + beforeCount + " students"); System.out.println("Course size after drop: " + cis162.countStudents() + " students"); } } import java.text.DecimalFormat; // Class representing a student public class Student { private String first; // first name private String last; // last name private double gpa; // grade point average // Student class constructor public Student(String f, String l, double g) {…
public class Main { public static void main(String[] args) { System.out.println("Your factorial is: " + factorial(9)); }} public static int factorial(int number) { if (number == 0) { return 1; } return number * factorial(number -1); } i need help fixing this code involving recursion
Help with java Please import java.util.*; public class Recursion{ public static void main(String args[]){ Scanner input = new Scanner(System.in); String exp = input.nextLine(); System.out.println(solver(exp.split(" "))); } public static double solver(String[] expression){ double result = 0; if(expression.length == 3){result = add(Double.parseDouble(expression[0]),Double.parseDouble(expression[2]));} else if(expression.length == 5){result = add(Double.parseDouble(expression[0]),Double.parseDouble(expression[2]),Double.parseDouble(expression[4]));} else if(expression.length == 7){result = add(Double.parseDouble(expression[0]),Double.parseDouble(expression[2]),Double.parseDouble(expression[4]),Double.parseDouble(expression[6]));} else if(expression.length == 9){result = add(Double.parseDouble(expression[0]),Double.parseDouble(expression[2]),Double.parseDouble(expression[4]),Double.parseDouble(expression[6]),Double.parseDouble(expression[8]));} else if(expression.length == 11){result =…
Please convert this code into C language (#include <stdio.h>Main.javaimport java.util.*;class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);ArrayList<Plane> planes = new ArrayList<Plane>();while (true) {System.out.print("\nAdd a plane (a)?\nRemove a plane (r)?\nSearch for plane (s)? \nQuit (q) \n");String choice = sc.nextLine();if (choice.equalsIgnoreCase("q"))break;else if (choice.equalsIgnoreCase("a")) {String pname;int nos;System.out.print("Enter name of plane: ");pname = sc.nextLine();System.out.print("Enter num of seats in plane: ");nos = sc.nextInt();Plane p = new Plane(nos, pname);System.out.print("Enter no. of Passengers on Monday: ");int nop = sc.nextInt();p.addFlights(nop, "Monday");System.out.print("Enter no. of Passengers on Tuesday: ");int not = sc.nextInt();p.addFlights(not, "Tuesday");System.out.print("Enter no. of Passengers on Wednesday: ");int now = sc.nextInt();p.addFlights(now,…
JAVA public interface Interf1 { public void repeat(String s1); } Implement the above interface using lambda to accept hello world and print ten times and implement the above interface using inner class to accept hello world and print ten times
public class SumOfDiagonals { public static void main(String[] args) { String[][] s1 = {{"2", "3", "4"}, {"5", "6", "7"}, {"8", "9", "10"}}; String[][] s2 = {{"1", "2", "3"}, {"5", "6", "7"}, {"9", "10", "11"}, {"13", "14", "15"}}; String[][] s3 = {{"1", "2", "3", "4"}, {"5", "6", "7", "8"}, {"9", "10", "11", "12"}, {"13", "14", "15", "16"}}; try { sumOfDiagonals(s1); sumOfDiagonals(s2); sumOfDiagonals(s3); } catch(NumberFormatException ex) { System.out.println("Not a valid integer"); } catch(IllegalArgumentException ex) { System.out.println("Array not a square"); } } public static void sumOfDiagonals(String[][] x) { //TODO Complete this method as required in the…
Write code in Java: -Must be recursive import java.util.*; import java.lang.*; import java.io.*; //*Analysis goes here* //*Design goes here* class AllPermutation { public static void displayPermutation(String s) { //*Code goes here* } public static void displayPermutation(String s1, String s2) { //*Code goes here* } } //*Driver class should not be changed* class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); AllPermutation.displayPermutation(input.nextLine()); } }
Fill with appropriate java keywords/syntaxes in the following method overloading program. package analyze; class { method (double X, double Y, double Z){ return X * Y * Z; } double method (double M, double ) { return M / N; } public class Analyze { public static void main(String[] args) { Find fi = Find(); System.out.println( Method 1 : "+fi.method(2, 4, 6)); System.out.println("Method 2 : "+fi.method(3, 6)); } }