must be done in java and used for file name public class Main like in second pic Reference Semantics MysteryWrite the output of the following program, as it would appear on the console.import java.util.*;// for Arrays classpublic class BasicPoint {int x;int y;public BasicPoint(int initialX, int initialY) {x = initialX;y = initialY;}public class ReferenceMystery {public static void main(StringO args) {BasicPoint p = new BasicPoint(11, 22);int[] a = {33, 44};int n = 55;+ Arrays.toString(a) + " " + n);System.out.println(p.x + "," + p.y +mystery(p, a, n);System.out.println(p.x ++ p.y + "+ Arrays.toString(a) ++ n);a[0] = a[1];p.x = p.y;mystery(p, a, n);System.out.printin(p.x + "," + p.y + " " + Arrays.toString(a) + " " + n);public static int mystery(BasicPoint p, int[] a, int n) {n = 0;a[0] = a[0] + 11;a[1] - 77;p.X = p.x + 33;System.out.println(p.x + "," + p.y + " " + Arrays.toString(a) + " " + n);return n; 1 v class Main {public static void main(String[] args) {H N M 4

Your output of the java program is given below as you required.

Write the output of the following program, as it would appear on the console. import java.util.*; // for Arrays class public class BasicPoint { int x; int y; public BasicPoint(int initialx, int initialY) { x = initialx; y = initialY; public class ReferenceMystery { public static void main(String args) { BasicPoint p = new BasicPoint(11, 22); int a = {33, 44}; int n - 55: System.out.println(p.x + "," + p.y + "" mystery(p, a, n); System.out.printin(p.x + "," + p.y + Arrays.toString(a) + "" + n); Arrays.toString(a) + " " + n); a[0] = a[1]; p.x = p.y; mystery(p, а, n); System.out.printin(p.x + "," + p.y + "" + Arrays.toString(a) + " " + n); public static int mystery(BasicPoint p, int0 a, int n) { n = 0; a[0] = a[0] + 11; a[1] - 77; p.x - p.x + 33; System.out.println(p.x + "," + p.y + "" + Arrays.toString(a) + "" + n); return n; }

Write the output of the following program, as it would appear on the console. import java.util.*; // for Arrays class public class BasicPoint { int x; int y; public BasicPoint(int initialx, int initialY) { x = initialx; y = initialY; public class ReferenceMystery { public static void main(String args) { BasicPoint p = new BasicPoint(11, 22); int a = {33, 44}; int n - 55: System.out.println(p.x + "," + p.y + "" mystery(p, a, n); System.out.printin(p.x + "," + p.y + Arrays.toString(a) + "" + n); Arrays.toString(a) + " " + n); a[0] = a[1]; p.x = p.y; mystery(p, а, n); System.out.printin(p.x + "," + p.y + "" + Arrays.toString(a) + " " + n); public static int mystery(BasicPoint p, int0 a, int n) { n = 0; a[0] = a[0] + 11; a[1] - 77; p.x - p.x + 33; System.out.println(p.x + "," + p.y + "" + Arrays.toString(a) + "" + n); return 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

Provide the UML class diagram for the program below. import java.util.ArrayList; import java.util.Scanner; //Define the class Fraction class Fraction { private int n, d; public Fraction() { this.n = this.d = 0; //Initialize the values } public Fraction(int n, int d) { this.n = n; //Initialize the variables this.d = d; } //Define the getter function getNum() that returns the numerator public int getNum() { //Returns numerator return n; } //Define the getter function getDen() that returns the denominator public int getDen() { //Returns denominator return d; } //Define the boolean function isZero() that returns 0 if numerator is 0 and denominator is not equals to zero public boolean isZero() { return(getNum() == 0 && getDen() != 0); } //Define the function getSimplifiedFraction() that returns the simplified fraction public String getSimplifiedFraction() { //Decalre the string variable result to store the result String result = ""; //if the numerator and…
please help me with the following 1) make a sierpenski triangle using java and recursion. Make it similar to the code below. And please comment the code 2) Please make the follow code out put on the console. It a t square fractal import java.awt.image.*;import java.awt.Color;import java.io.*;import javax.imageio.*; public class Main{ static final int DIMENSION = 1000; static BufferedImage image = new BufferedImage(DIMENSION, DIMENSION, BufferedImage.TYPE_INT_RGB); static final int WHITE = Color.WHITE.getRGB(); static final int BLACK = Color.BLACK.getRGB(); private static void drawSquare(int x, int y, int side) { if (side <= 0) return; else { int left = x - side/2; int top = y - side/2; int right = x + side/2; int bottom = y + side/2; for (int i = left; i < right; i++) for (int j = top; j < bottom; j++) { image.setRGB(i, j, BLACK); }…
IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
write java codes to do the following: Write a recursive function to check if an integer array is negative symmetric, for example, an array of 10, 20, 30, 90, -30, -20, -10 is considered as negative symmetric, while an array of 10, 20, 30, 90, 30, 20, 10 is not considered as negative symmetric. public static boolean checkArraySym(int [ ] A, int first, int last) that receives an array A, first index, last index and checks if the array is negative symmetric
JAVA Question 2: For two integers m and n, their GCD (Greatest Common Divisor) can be computed by a recursive method. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Method body: If m is 0, the method returns n. If n is 0, the method returns m. If neither is 0, the method can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n (or m % n). The recursive method cannot have loops. Note: although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. main method: Prompt and read in two numbers to find the greatest common divisor. Call the gcd method with the two numbers as its argument. Print the result to the monitor. Example program run: Enter m: 12 Enter n: 28 GCD(12,28) = 4 And here is what I have so far, package CSCI1302;import java.util.*;public class RecursionDemo { public static void…
write easy java program. Implement a class Quiz that implements the Measurable interface. A quiz has a scoreand a letter grade (such as B+). Use the Data class of Exercise P8.1 to processan array of quizzes. Display the average score and the quiz with the highestscore (both letter grade and score).
/** * Write a Java function to determine if the elements of an array can be split into two groups such that the sum of one group is a non-zero multiple of 10 and the sum of the other group is odd. Your solution must use recursive backtracking. <code> * Example: * Given: {1, 2, 6, 3, 1} * Result: true because {1,2,6,1}, {3} is one possibility. * * Example: * Given: {4, 3, 5, 2} * Result: false * </code> */ public static boolean splitOdd10(int[] num) { }
PLZ help with the folllowig IN JAVA TRUE OR FALSE When a recursive call is encountered, computation is temporarily suspended; all of the information needed to continue the computation is saved and the recursive call is evaluated. 2.Can you have a static method in a nonstatic inner class?
JAVA Program ASAP Please modify this program and take out the main method from the program so it passes the test cases in Hypergrade. I have provided the failed test cases. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.ArrayList;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Scanner;public class FileSorting { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (true) { System.out.println("Please enter the file name or type QUIT to exit:"); String fileName = scanner.nextLine(); if (fileName.equalsIgnoreCase("QUIT")) { break; } try { ArrayList<String> lines = readFile(fileName); if (lines.isEmpty()) { System.out.println("File " + fileName + " is empty."); } else { performSorting(lines);…
C++ programming Recall that in C++, there is no check on an array index out of bounds. However, during program execution, an array index out of bounds can cause serious problems. Also, in C++, the array index starts at 0. Design and implement the class myArray that solves the array index out of bounds problem and also allows the user to begin the array index starting at any integer, positive or negative. Every object of type myArray is an array of type int. During execution, when accessing an array component, if the index is out of bounds, the program must terminate with an appropriate error message. Consider the following statements: myArray list(5); //Line1 myArray myList(2, 13); //Line 2 myArray yourList(-5, 9); //Line 3 The statement in Line 1 declares list to be an array of five components, the component type is int, and the components are: list[0], list[1], ..., list[4]; The statement in Line 2 declares myList to be an array of 11 components, the component…
Modify the given codes to remove the compilation errors. 1. public interface Carnivore { int pieces = 10; public static void eatGrass(); public int chew() { return 13; } } 2. Interface HasWings { public int getNumberOfWings(); } abstract class Insect implements HasWings { abstract int getNumberOfLegs(); } public class Dragonfly extends Insect { int getNumberOfLegs() { return 6; } }
use python Implement the design of the Student and Lawyer class derived from Person class so that the following code generates the output below:class Person: def __init__(self, name, contact): self.name = name self.contact = contact def __str__(self): s = f"Name: {self.name}\nContact: {self.contact}" return s#Write your code herejohn_cena = Student("John Cena", "9752325", 100005, "CSE")john_cena.add_courses("CSE111 Programming Language II", "CSE230 Discrete Mathematics", "EEE101 Electrical Circuits 1")print("1.=========================================================")print(john_cena)print("2.=========================================================")john_cena.show_course_list("CSE")print("3.=========================================================")john_cena.show_course_list("ECE")print("4.=========================================================")john_cena.add_courses("ARC101 Design I: Basic…