} import java.io.*; public class Test RandomAccessFile ( public static void main(String[] args) throws IOException ( try ( RandomAccessFile inout new RandomAccessFile("inout.dat", "Ew"); { inout.setLength (0); for (int i = 0; i < 200; i++) inout.writeInt(i); System.out.println("Current file length is " + inout.length()); inout.seek (0); System.out.println("The first number is " + inout.readInt ()); inout.seek (1 * 4); System.out.println("The second number is " + inout.readInt ()); inout.seek (9 * 4); System.out.println("The tenth number is" + inout.readInt ()); inout.writeInt (555); inout.seek (inout.length()); inout.write Int (999); System.out.println("The new length is " + inout.length()); inout. seek (10 * 4); System.out.println("The eleventh number is " + inout.readInt ()); Output:

} import java.io.; public class Test RandomAccessFile ( public static void main(String[] args) throws IOException ( try ( RandomAccessFile inout new RandomAccessFile("inout.dat", "Ew"); { inout.setLength (0); for (int i = 0; i < 200; i++) inout.writeInt(i); System.out.println("Current file length is " + inout.length()); inout.seek (0); System.out.println("The first number is " + inout.readInt ()); inout.seek (1 4); System.out.println("The second number is " + inout.readInt ()); inout.seek (9 * 4); System.out.println("The tenth number is" + inout.readInt ()); inout.writeInt (555); inout.seek (inout.length()); inout.write Int (999); System.out.println("The new length is " + inout.length()); inout. seek (10 * 4); System.out.println("The eleventh number is " + inout.readInt ()); Output:

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 &&…
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; } }
Please sort out the following JAVA code....line by line. Run the code in Netbeans and provide screenshots to verify that it runs successfully. CODE: import java.io.*; import java.util.*; public class experiment { public static void main(String args[]) { Scanner in=new Scanner(System.in); int time[]=new int[10]; float weight[]=new float[10]; String get; char ch; int i=0; do{ try { System.out.print("\nEnter the time in seconds:"); time[i]=in.nextInt(); System.out.print("\nEnter the weight in kilograms:"); weight[i]=in.nextFloat(); i++; } catch(Exception e) { System.out.print("\nInvalid type"); } System.out.print("\n-----------------"); System.out.print("\n|Time\t|Weight\t|"); System.out.print("\n-----------------"); for(int x=0;x<i;x++) { System.out.print("\n|"+time[x]+"\t|"+weight[x]+"\t|"); System.out.print("\n-----------------"); } if(i==10) { for(int x=0;x<9;x++) { time[x]=time[x+1]; weight[x]=weight[x+1]; } i--; } System.out.print("\nDo you want to continue?(y/n) ");…
Write a program FindDuplicate.java that reads n integer arguments from the command line into an integer array of length n, where each value is between is 1 and n, and displays true if there are any duplicate values, false otherwise java FindDuplicate 2 10 8 5 4 1 3 6 7 9false java FindDuplicate 4 5 2 1 2true
Write a Java class that populates an array of 20 random ints between 0 and 100. Write two methods: 1) a method returning the largest value, and 2) a method returning the array sorted in descending order.
This is the implementation of the Caesar cipher (Section5.3 in the textbook), which we discussed in class. Caesar cipher is a simple approach toencoding messages by shifting each letter in a message along the alphabet by aconstant amount.Your code will be similar to Listing 5.1, but you must use CircularArrayQueue.javainstead of the Java API queue. //5.1 import java.util.*;public class Codes { public static void main(String[] args) { int[] key = {5, 12, -3, 8, -9, 4, 10}; Integer keyValue; String encoded = "", decoded = ""; String message = "All programmer are playwrights and all "+"computers are lausy actors."; Queue<Integer> encodingQueue = new LinkedList<Integer>(); Queue<Integer> decodingQueue = new LinkedList<Integer>(); for (int scan=0; scan < key.length; scan++) { encodingQueue.add(key[scan]); decodingQueue.add(key[scan]); } for (int scan=0; scan < message.length();…
Write a client program that allows the user to add up any number of non-zero fractions. The program should display the running total as an exact fraction (in simplified form as numerator / denominator), and as an approximate double value. The user can finish by entering a fraction that represents 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…
Write a JAVA program that reads an array from input file and invokes twodifferent methods Sort and Max ,that sorts the elements of the array and findsthe Max element and writes out the resulted array in to output file . Usetwo interfaces for methods and throw Exception Handling for Out Of Boundindex for the array.
FOR JAVA, with StdDraw, and StdRandom Write a static method histogram() that takes an array a[ ] of int values and an integer M as arguments and returns an array of length M whose ith entry is the number of times the integer i appeared in the argument array. If the values in a[ ] are all between 0 and M–1, the sum of the values in the returned array should be equal to a.length.
Write in JAVA, JUST CHANGE THE SWAP PART I don't want int i and j in (public static void swap(int[] array, int i, int j)) this part. I want you to do it by writing( public static void swap(int[] array){ Just initialize i and j somewhere else please. How can you do that? public class SelectionSort {public static void main(String[] args) {int[] intarray = {20, 35, -15, 7, 55, 1, -22};for(int lastUnsorted = intarray.length-1;lastUnsorted > 0;lastUnsorted--){// if largest is in 0th index// we start from the 1st index// if 1st is greater than it, swap the elementint largest=0;for(int i=1; i<=lastUnsorted; i++){if(intarray[i] > intarray[largest]){largest = i;}}swap(intarray, largest, lastUnsorted);}for(int i=0; i<intarray.length; i++){System.out.println(intarray[i]);}}public static void swap(int[] array, int i, int j){if(i == j){return;}int temp = array[i];array[i] = array[j];array[j] = temp;}}
Write a Java program which reads a string from the user and calls a method findVowels() from the main() method which passes the string as argument and prints the number of occurrences of each vowel (i.e., a, e, i, o, and u) present in that string. Read the string from the user using the Scanner class. Sample input:The quick brown fox jumps over the lazy dogSample output:a: 1e: 3i: 1o: 4u: 2Sample input:Merry Christmas!Sample output:a: 1e: 1i: 1o: 0u: 0
Write a program in java rect(int a, int b) that looks like this: 1233321 222222 123321 444444 123321 666666 123321 888888 and so on...