3759302350484.qx3zqy7LAB1.17.1: LAB: Input and formatted output: Right-facing arrow0/10ACTIVITYLabProgram.javaLoad default template...1 import java.util.Scanner;3 public class LabProgram {public static void main(String[] args) {Scanner scnr = new Scanner(System.in);int baseChar;int headChar;46.7.8/* Type your code here. */1011 }12Run your program as often as you'd like, before submitting for grading. Below, type any neededinput values in the first box, then click Run program and observe the program's output in theDevelop modeSubmit modesecond box.Enter program input (optional)If your code requires input values, provide them here.LabProgram.java(Your program)Output (shown below)Input (from above)Run programProgram output displaved here Help/FAQGiven two input integers for an arrowhead and arrow body, print a right-facing arrow.Ex: If the input is:0 1the output is:110o 0001110o 00011110000011111375930 2350484.qx3zgy7LAB1.17.1: LAB: Input and formatted output: Right-facing arrowACTIVITY0/10LabProgram.javaLoad default template..1 import java.util.Scanner;3 public class LabProgram {public static void main(String args) {Scanner scnr new Scanner(System.in);int baseChar;int headChar;4.7.8/* Type your code here. /1011 }12

import java.util.*;import java.lang.*;import java.io.*; class LabProgram{ public static void main…

Answered: 1 11 00000111 000001111 00000111 11

Engineering

Computer Science

1 11 00000111 000001111 00000111 11

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

do the changes in this program according to the given instruction like coaches instead of teachers,sports name instead of courses etc, import java.util.*;class CourseManager{//toatl students each section can holdstatic int max_Students;//mapping of each sections w.r.t to courseHashMap<String,ArrayList<Section> > courses ; //constructor for CourseManagerpublic CourseManager(int max){max_Students = max;courses = new HashMap<>();}//class Person which will be used by teacher and students to inherit its propertiesstatic class Person{String name;int age;public Person(String name , int age ){this.name = name;this.age = age;}}//teacher classstatic class Teacher extends Person{int id;public Teacher(int id , String name , int age ){super(name , age );this.id = id;}}//student classstatic class Student extends Person{int id;public Student(int id , String name , int age ){super(name , age );this.id = id;}}//section classstatic class Section{int section;String course ;Teacher…
In java, Implement a method that removes all duplicates. Keep the first instance of the element but remove all subsequent duplicate elements.public void removeDuplicates() see the picture for the right output. Given files: Demo6.java public class Demo6 { public static void main(String[] args) { MyLinkedList<String> list = new MyLinkedList<>(); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); for (int x = 0; x < list.size(); x += 1 + x/3) { System.out.println("Removing element at index: " + x); list.remove(x); } System.out.println("Result"); System.out.println(list); System.out.println("Shuffling"); list.shuffle(7777); System.out.println(list); System.out.println("Removing duplicates (keeping first instance)"); list.removeDuplicates(); System.out.println(list); }} TestBench.java import java.util.AbstractList; public class TestBench { public static…
Rewrite the following piece of java code using iterator pattern. And change the operation inside the for loop to another operation of your own. And What was the advantage of using the iterator ? import java.util.Iterator String[ ] originalData = { "one", "two", "three", "four", "five" }; List<String> strings = new ArrayList<>(Arrays.asList(originalData)); for ( int i=0; i<strings.size(); i++) { // process strings.get(i): here, just printSystem.out.println(strings.get(i));}
Assume that the SampleQueue class, with the given code below, is used in the TestSampleQueue that is also shown below. Show the output of the TestSampleQueue. Do the exercise without using a computer (i.e. Make amanual trace of the program):// SampleQueue classimport java.lang.*;import java.util.*;public class SampleQueue<T> {private LinkedList<T> list;public SampleQueue() {list = new LinkedList<T>();}public void setList(LinkedList<T> list) {this.list = list;}public void clear() {list.clear();}public boolean isEmpty() {return list.isEmpty();}public T firsElement() {return list.getFirst();}public T dequeue() {return list.removeFirst();}public void enqueue(T element) {list.addLast(element);}public LinkedList<T> getList() {return list;}public String toString() {return list.toString();}} // end of SampleQueue class
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 complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } c) Implement a comparator called CompareCarsByMakeThenDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenDescendingMPG should return a value that will cause quicksort to sort an array of cars in ascending order by make and, when two cars have the same make, in descending order by mpg.
I need help with this Java problem to output as it's explained in this image below: Ex: If input is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84 List after removing 84: 61 72 LabProgram.java code below (Needs editing) import java.util.Scanner; import java.io.PrintWriter; public class LabProgram { // Prints the SortedNumberList's contents, in order from head to tail public static void printList(SortedNumberList list) { Node node = list.head; while (null != node) { System.out.print(node.getData() + " "); node = node.getNext(); } System.out.println(); } public static void main(String[] args) { Scanner scnr = new Scanner(System.in); String inputLine; // Read the line of input numbers inputLine = scnr.nextLine(); // Split on space character String[] terms = inputLine.split(" "); // Insert each value and show the…
1 IN JAVA ----- Write a method of public class called "isInputOneValid" that verifies if a string parameter called "inputOne" is included inside an array called "tableOne". Return as a boolean (if valid, return true, if not, false)
I need a help in making a method that will Input a text that will be converted to Huffman code and Input a Huffman code that will be converted to its text equivalent.You can try this sample Character input: HAAHAABAAACACAAAABABABEBEBBAABEEBBCCCCCAAAAAAACCCDDDDDDAAADDDDDEEEEEEDDADDDADDEEEEEEEECCCEEEEEEEEEEDDEEEEEEEEEEBBEEEEEFFGGHAHHEEHHA Huffman.java import java.util.PriorityQueue;import java.util.Scanner;import java.util.Comparator;import java.util.ArrayList; class HuffmanNode { int data; char c; HuffmanNode left; HuffmanNode right;} class MyComparator implements Comparator<HuffmanNode> { public int compare(HuffmanNode x, HuffmanNode y) { return x.data - y.data; }} public class Huffman { public static void printCode(HuffmanNode root, String s) { if (root.left == null && root.right == null && Character.isLetter(root.c)) { System.out.println(s + "tttt"+ s.length()); return; } printCode(root.left, s + "0");…
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. Use the following files: Question.java /** A question with a text and an answer.*/public class Question{ private String text; private String answer; /** Constructs a question with empty text and empty answer. */ public Question() { text = ""; answer = ""; } /** Sets the answer for this question. @param correctResponse the answer */ public void setAnswer(String correctResponse) { answer = correctResponse; } /** Checks a given response for correctness. @param response the response to check @return true if the response was correct, false otherwise */ public boolean checkAnswer(String response) { return response.equals(answer); } /** Add a line of text to…
Here is --Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","tea"]] Example 2: Input: strs = [""] Output: [[""]]. Asap.
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print: 7 9 11 10 10 11 9 7 import java.util.Scanner; public class CourseGradePrinter {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);final int NUM_VALS = 4;int [] courseGrades = new int[NUM_VALS];int i; for (i = 0; i < courseGrades.length; ++i) {courseGrades[i] = scnr.nextInt();} /* Your solution goes here */ P.S. The answer came out wrong the first try 7 9 11 10 10 11 9 7Enter