What will be the output of the given program class A { int m-20, n-D30; void display() System.out.println(m); class B extends A{ int n-40; void display () System.out.println(n); class Main| { public static void main(String[] args) { B o=new B((); int k=o.n; System.out.println(k);

What will be the output of the given program class A { int m-20, n-D30; void display() System.out.println(m); class B extends A{ int n-40; void display () System.out.println(n); class Main| { public static void main(String[] args) { B o=new B((); int k=o.n; System.out.println(k);

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

Write a client program that loops around getting two fractions from the user,output their sum, and state whether or not they are equal. Keep looping until the first fraction entered is a zero fraction. import java.util.ArrayList;import java.util.Scanner; //Define the class Fractionclass Fraction{private int n, d;public Fraction(){//Initialize the valuesthis.n = this.d = 0;}public Fraction(int n, int d){//Initialize the variablesthis.n = n;this.d = d;}//Define the getter function getNum() that returns the numeratorpublic int getNum(){//Returns numeratorreturn n;}//Define the getter function getDen() that returns the denominatorpublic int getDen(){//Returns denominatorreturn d;}//Define the boolean function isZero() that returns 0 if numerator is 0 and denominator is not equals to zeropublic boolean isZero(){return(getNum() == 0 && getDen() != 0);}public boolean isequals(Object c){Fraction f = (Fraction) c;return(Integer.compare(n,f.n))==0 &&…
Using Jcreator, open, compile, and run java and observe its runtime. Write your observation regarding how encapsulation works for the program and the data it processed. Limit your paper to a single paragraph with at least 50 words or five (5) sentences. Source code: public class EncapTest { private String name; private String idNum; private int age; public int getAge() { return age; } public String getName() { return name; } public String getIdNum() { return idNum; } public void setAge( int newAge) { age = newAge; } public void setName(String newName) { name = newName; } public void setIdNum( String newId) { idNum = newId; }} public class RunEncap { public static void main(String args[]) { EncapTest encap = new EncapTest(); encap.setName("James"); encap.setAge(20); encap.setIdNum("12343ms"); System.out.print("Name : " + encap.getName() + " Age : " + encap.getAge()); }}
(A) Write a program for the Online Turing Machine Simulator to simulate a Turing Machine with one tape that recognizes the language O. Language O {w | w ∈ {a, b}* and a(w) <= b(w)} a(w) = number of a's in a string w. b(w) = number of b's in a string w. (B) Test the Turing Machine with one tape for: one string from the language O one string from the language M or language N Language M M = {w | w ∈ {a, b}* and a(w) == b(w)}. a(w) = number of a's in a string w. b(w) = number of b's in a string w. Language N N = {w | w ∈ {a, b}* and a(w) >= b(w)}. a(w) = number of a's in a string w. b(w) = number of b's in a string w.
public class Soru32{ // Returns length of LCS for X[0..m-1], Y[0..n-1] static void lcs(String X, String Y, int m, int n) { int[][] L = new int[m+1][n+1]; // Following steps build L[m+1][n+1] in bottom up fashion. Note // that L[i][j] contains length of LCS of X[0..i-1] and Y[0..j-1] for (int i=0; i<=m; i++) { for (int j=0; j<=n; j++) { if (i == 0 || j == 0) L[i][j] = 0; else if (X.charAt(i-1) == Y.charAt(j-1)) L[i][j] = L[i-1][j-1] + 1; else L[i][j] = Math.max(L[i-1][j], L[i][j-1]); } } // Following code is used to print LCS int index = L[m][n]; int temp = index; // Create a character array to store the lcs string char[] lcs = new char[index+1]; lcs[index] = '\u0000'; // Set the terminating character // Start from the right-most-bottom-most…
public class Soru32{ // Returns length of LCS for X[0..m-1], Y[0..n-1] static void lcs(String X, String Y, int m, int n) { int[][] L = new int[m+1][n+1]; // Following steps build L[m+1][n+1] in bottom up fashion. Note // that L[i][j] contains length of LCS of X[0..i-1] and Y[0..j-1] for (int i=0; i<=m; i++) { for (int j=0; j<=n; j++) { if (i == 0 || j == 0) L[i][j] = 0; else if (X.charAt(i-1) == Y.charAt(j-1)) L[i][j] = L[i-1][j-1] + 1; else L[i][j] = Math.max(L[i-1][j], L[i][j-1]); } } // Following code is used to print LCS int index = L[m][n]; int temp = index; // Create a character array to store the lcs string char[] lcs = new char[index+1]; lcs[index] = '\u0000'; // Set the terminating character // Start from the right-most-bottom-most…
2. Using Java notation, suppose A is the alphabet {'a','b','c' }List the labels of all strings in A* from among thefollowing. a. "" b. "aa" c. "bb" d. "abc"e. "abcd" f. "aaaaaaaa..." (an infinite string ofa's) -> (THIS IS THE PROBLEM #3) <- 3. For alphabet A of the last problem, how many length 4stringsare there in A*?a. 3 b. 4 b. 12 c. 27 d. 81 e. 64 f. 128
From Big Java 6th edition P9.7: "In this problem, you will model a circuit consisting of an arbitrary configuration of resistors. Provide a superclass Circuit with a instance method getResistance. Provide a subclass Resistor representing a single resistor. Provide subclasses Serial and Parallel, each of which contains an ArrayList<Circuit>. A Serial circuit models a series of circuits, each of which can be a single resistor or another circuit. Similarly, a Parallel circuit models a set of circuits in parallel; using Ohm's Law to compute the combined ressistance." I managed to create appropriate subclasses off of the Circuit superclass. But from here, I'm stuck! How do I compute the combined resistance? and how would I get the method to read the values off of the ArrayList<Circuit>? And does that Circuit refer to the Circuit Class I created, or would that require input for resister amounts?
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Please help debug this: Debugging Exercise 4-3, Farrell, Joyce, Java Programming, 9th edition, Cengage Learning public class DebugBox { private int width; private int length; private int height; private FixDebugBox() { length = 1; width = 1; height = 1; } public DebugBox(int width, int length, int height) { width = width; length = length; height = height; } public void showData() { System.out.println("Width: " + width + " Length: " + length + " Height: " + height); } public double getVolume() { double vol = length - width - height; return vol; } }
Consider the following code in Java 8:public interface Runnable{void run() ;}public final class Caller {public static void call (String before, String after, Runnable r) (System.out.println(before);r. run() ;System.out.println(after);} }public class MyClass{public static void main(String args[]) (Caller.call("BEFORE", "AFTER",); } }Complete the blark line with some code so that the program prints the folowing to the output: BEFOREHi there!AFTER
Write a java program that can examine school children on multiplication. The kid has to select which multiplication table he wants to be tested in.- Display 10 random questions every time,- Display whether the answers are right or wrong,- Show the correct answers for wrong answers and- calculate the total score (out of 10) ((((It is just AN EXERCISE NOT AN EXAM)))) Thanks
Consider class IntArrayStack that has two instance variables: int[] data and int top. Implement an instance method inside the IntArrayStack, called popBottom(),that extracts and returns as output the element at the bottom of the stack. All other elements in the stack must remain unchanged and in the same order.