1- class Excep {2- public static void main(String[] args){3 try{int arr[]=(1,2};4int x = arr[1]/arr[0]-1;67 catch(ArithmeticException e)8- {9.System.out.printin("divide by e");10 }11 catch(ArrayIndexOutofBoundsException e)12- {13System.out.println("wrong indexing");1415 finally16- {17System.out.println("Runtime error");18 }19 }}20Answer:

Define class Excep. Define main function. Define try block. Define array arr with values 1 and 2.…

class Excep { public static void main(String[] args){ try{ int arr[]=(1,2}; int x = arr[1]/arr[0]-1; catch(ArithmeticException e) { System.out.println("divide by 0"); catch(ArrayIndexOutofBoundsException e)

class Excep { public static void main(String[] args){ try{ int arr[]=(1,2}; int x = arr[1]/arr[0]-1; catch(ArithmeticException e) { System.out.println("divide by 0"); catch(ArrayIndexOutofBoundsException e)

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

public class ShoppingListDriver{ public static void main(String[] args){ ShoppingList sl=new ShoppingList(3);sl.insert(null);sl.insert(new Item("Bread", "Carb Food", 2, 2.99));sl.insert(new Item("Seafood","Sea Food", -1, 10.99));sl.insert(new Item("Rice", "Carb Food",2, 19.99));sl.insert(new Item("Salad Dressings","Dessing", 2, 19.99));sl.insert(new Item("Eggs", "Protein",2, 3.99));sl.insert(new Item("Cheese","Protein", 2, 1.59));sl.insert(new Item("Eggs", "Protein",3, 3.99));sl.printNames();sl.print(); System.out.println("After removing Eggs:");sl.remove(new Item("Eggs","Protein",0,0));sl.printNames();sl.print(); }}
import java.util.Scanner; public class ContactList { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); ContactNode head = null; ContactNode current = null; // Read the name and phone number for three contacts and build a linked list. for (int i = 1; i <= 3; i++) { System.out.print(" " + i + ": "); String name = scnr.next(); System.out.print(" " + i + ": "); String phoneNumber = scnr.next(); ContactNode newContact = new ContactNode(name, phoneNumber); if (head == null) { head = newContact; current = head; } else { current.insertAfter(newContact); current = newContact; } } // Output each contact. current = head; for (int i = 1; current != null; i++) { System.out.print("Person " + i + ": "); current.printContactNode();…
public class ArrayMerge { static void arrayMerge(int a[], int b[]){ int c[] = new int[50]; int k = 0; for(int i = 0; i < a.length; i++) { c[k++] = a[i]; } for(int i = 0; i < b.length; i++) { c[k++] = b[i]; } for(int i = 0; i < k; i++) { System.out.println(c[i]); } } public static void main(String[] args) { int a[] = { 18, 36, 41, 78, 56 }; int b[] = { 10, 37, 44 }; arrayMerge(a,b); } } Calculate the algorithm step number and algorithm time complexity of the above program?
Ex. If the input is: 4 plates 100 spoons 200 cups 150 forks 200 the output is: 200 forks 150 cups 200 spoons 100 plates Inventory.java import java.util.Scanner; public class Inventory {public static void main (String[] args) {Scanner scnr = new Scanner(System.in);InventoryNode headNode;InventoryNode currNode;InventoryNode lastNode; String item;int numberOfItems;int i; // Front of nodes listheadNode = new InventoryNode();lastNode = headNode; int input = scnr.nextInt(); for(i = 0; i < input; i++ ) {item = scnr.next();numberOfItems = scnr.nextInt();currNode = new InventoryNode(item, numberOfItems);currNode.insertAtFront(headNode, currNode);lastNode = currNode;} // Print linked listcurrNode = headNode.getNext();while (currNode != null) {currNode.printNodeData();currNode = currNode.getNext();}}} InventoryNode.java public class InventoryNode {private String item;private int numberOfItems;private InventoryNode nextNodeRef; // Reference to the next node public InventoryNode()…
Complete the method loadBuses(String bfile) that reads information bus information from afile (bfile contains the filename) . Each row in the file should trigger the creation of aninstance of bus or an appropriate subclass, according to the data in table 1. All buses createdshould be added to an arraylist. LoadBuses should return the populated arraylist. public ArrayList<Bus> loadBuses(String bfile ) { Scanner bscan = null; ArrayList<Bus> blist = new ArrayList<Bus>(); return blist; }
JAVA PROGRAMMING I need an expert to write Test application to run the MyArrayStack<T> class. import java.util.Arrays; interface MyStack<T> {public void push(T o);public T pop() throws StackEmptyException;public T peek();public boolean isEmpty();public int size();} class MyArrayStack<T> implements MyStack<T>{private static final int DEFAULT_STACK_SIZE = 100;T[] stackArray;int top = 0; public MyArrayStack() {this(DEFAULT_STACK_SIZE);}public MyArrayStack(int defaultSize) {top = 0;stackArray = (T[])new Object[defaultSize];} public void push(T o) {if (size() == stackArray.length) expandCapacity();stackArray[top] = o;top++;}private void expandCapacity() {stackArray = Arrays.copyOf(stackArray, stackArray.length*2);System.out.println("StackArray size is automatically expanded:" + stackArray.length);} public T pop() throws StackEmptyException {if (isEmpty()) throw new StackEmptyException("Stack is empty");top--;T o = stackArray[top];stackArray[top] = null;return o;}…
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));   }   //…
Beginner Java import java.util.Arrays;import java.util.Scanner; Arrays and scanner required. Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example:               100.5 65 pizza 100 45.75 70 5.8 5 Also suppose that you have two integers n and m that are both positive. For example: n = 5 and m = 10 Write a static method: public static double partialSum(Scanner s, int n, int m) that takes a Scanner and two integers n and m as arguments and returns the sum of the integers read by the Scanner that are divisible by n and not divisible by m. In the above example, the integers divisible by 5 and not divisible by 10 are 65 and 5, so the result would be 70. If the Scanner is empty, or no tokens are valid integers, the result should be 0. You can assume the Scanner is not null. It is probably easiest to test your method by creating a Scanner with a String instead of System.in. The starter code for an example of how to do this is…
Write an application that displays the strings in the provided array alphabetically in ascending order import java.util.*; public class StringSort {    public static void main(String[] args)    {       String[] values =  {"mouse", "dog", "cat", "horse", "cow",          "moose", "tiger", "lion", "elephant", "bird", "hamster",          "guinea pig", "leopard", "aardvark", "hummingbird"};    } }     I need help with this!
Please make it run out like the EXPECT PICTURES Don’t use try catch // Step 1: Import Java classes Arrays, Random, and Scanner import java.util.Arrays; import java.util.InputMismatchException; import java.util.Random; import java.util.Scanner; /** * A class to generate a random int array then call static * methods to sort and display the array elements. * * Step 2: Enter your name for @author and today's date for @version * @author * @version */ public class StaticMethodApp { public static void main(String[] args) { Scanner in = new Scanner(System.in); System.out.print("Enter an integer: "); // Step 3: While the next input token is not an integer // Read the input token // Display a message // Sample message, assuming the input is Java // Not an integer: "Java" // Display the same promt again…
For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, mport java.util.Scanner; public class Compare { public static void main(String args[]) {final int SIZE_LIST = 4;int[] keysList = new int[SIZE_LIST];int[] itemsList = new int[SIZE_LIST];int i;Scanner input = new Scanner(System.in); keysList[0] = input.nextInt();keysList[1] = input.nextInt();keysList[2] = input.nextInt();keysList[3] = input.nextInt(); itemsList[0] = input.nextInt();itemsList[1] = input.nextInt();itemsList[2] = input.nextInt();itemsList[3] = input.nextInt(); /* Your code goes here */ System.out.println();} }
import java.util.Scanner; public class LabProgram { public static Roster getInput(){ /* Reads course title, creates a roster object with the input title. Note that */ /* the course title might have spaces as in "COP 3804" (i.e. use nextLine) */ /* reads input student information one by one, creates a student object */ /* with each input student and adds the student object to the roster object */ /* the input is formatted as in the sample input and is terminated with a "q" */ /* returns the created roster */ /* Type your code here */ } public static void main(String[] args) { Roster course = getInput(); course.display(); course.dislayScores(); }} public class Student { String id; int score; public Student(String id, int score) { /* Student Employee */ /* Type your code here */ } public String getID() { /* returns student's id */…