1.1. Test to see if the unsorted set contains the value 10.1.2. Test to see if the sorted set contains the value 5.1.3. Remove the element 10 from the unsorted set.1.4. Test to see if the unsorted set still contains the value 10.1.5. Add the value 8 to the sorted set.1.6. Test to see if the sorted set contains the value 8.1.7. Display the unsorted set.1.8. Display the sorted set. (The sorted set should now have two more values than theunsorted set.)1.9. Add all values from the sorted set to the unsorted set by callingunsortedSet.addAll(sortedSet).1.10. Display both sets and confirm they have the same contents, just in a different order.Sample program output follows.Your code must use the values listed above, even if they differ from the sample output.Does the unsorted set contain 10? trueDoes the sorted set contain 5? falseRemoving 10 from unsorted set.Does the unsorted set contain 10? falseAdding 5 to sorted set.Does the sorted set contain 5? trueThe unsorted set is:[34, 22, 60, 30]The sorted set is: [5, 10, 22, 30, 34, 60]Adding all from sorted set to unsorted set.The unsorted set is: [34, 5, 22, 10, 60, 30]The sorted set is: [5, 10, 22, 30, 34, 60] Please enter the following code into a Java file.import java.util.*;public class SetDemo {int count[]public static void main(String args[]) {{34, 22,10,60,30,22};Set unsortedSet = new HashSet();try {for(int i = 0; i < count.length; i++) {unsortedSet.add(count[i]);}}}=System.out.println("The unsorted set is: + unsortedSet);11TreeSet sorted Set = new TreeSet(unsortedSet);System.out.println("The sorted set is:System.out.println("TheSystem.out.println("Thecatch(Exception e) {}+ sorted Set);first element of the set is: "+ (Integer) sorted Set.first());last element of the set is: "+ (Integer)sortedSet.last());Run the program to confirm it works as expected. Then, expand the program to do thefollowing steps in order. For each test, display the result of the test to the console.

We have to add some modules in the given java code which will pritn the desired output.

1.1. Test to see if the unsorted set contains the value 10. 1.2. Test to see if the sorted set contains the value 5. 1.3. Remove the element 10 from the unsorted set. 1.4. Test to see if the unsorted set still contains the value 10. 1.5. Add the value 8 to the sorted set. 1.6. Test to see if the sorted set contains the value 8. 1.7. Display the unsorted set. 1.8. Display the sorted set. (The sorted set should now have two more values than the unsorted set.) 1.9. Add all values from the sorted set to the unsorted set by calling unsortedSet.addAll(sortedSet). 1.10. Display both sets and confirm they have the same contents, just in a different order. Sample program output follows. Your code must use the values listed above, even if they differ from the sample output. Does the unsorted set contain 10? true Does the sorted set contain 5? false Removing 10 from unsorted set. Does the unsorted set contain 10? false Adding 5 to sorted set. Does the sorted set in 5? true The unsorted set is: [34, 22, 60, 30] The sorted set is: [5, 10, 22, 30, 34, 60] Adding all from sorted set to unsorted set. The unsorted set is: [34, 5, 22, 10, 60, 30] The sorted set is: [5, 10, 22, 30, 34, 60]

1.1. Test to see if the unsorted set contains the value 10. 1.2. Test to see if the sorted set contains the value 5. 1.3. Remove the element 10 from the unsorted set. 1.4. Test to see if the unsorted set still contains the value 10. 1.5. Add the value 8 to the sorted set. 1.6. Test to see if the sorted set contains the value 8. 1.7. Display the unsorted set. 1.8. Display the sorted set. (The sorted set should now have two more values than the unsorted set.) 1.9. Add all values from the sorted set to the unsorted set by calling unsortedSet.addAll(sortedSet). 1.10. Display both sets and confirm they have the same contents, just in a different order. Sample program output follows. Your code must use the values listed above, even if they differ from the sample output. Does the unsorted set contain 10? true Does the sorted set contain 5? false Removing 10 from unsorted set. Does the unsorted set contain 10? false Adding 5 to sorted set. Does the sorted set in 5? true The unsorted set is: [34, 22, 60, 30] The sorted set is: [5, 10, 22, 30, 34, 60] Adding all from sorted set to unsorted set. The unsorted set is: [34, 5, 22, 10, 60, 30] The sorted set is: [5, 10, 22, 30, 34, 60]

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

Enhanced binary search BinarySearchDemo.java package chapter7; import java.util.Scanner; /** This program demonstrates the binary search method in the ArrayTools class. */ public class BinarySearchDemo { public static void main(String[] args) { // The values in the following array are sorted // in ascending order. int numbers[] = {101, 142, 147, 189, 199, 207, 222, 234, 289, 296, 310, 319, 388, 394, 417, 429, 447, 521, 536, 600}; int result, searchValue; String input; // Create the console input objects. Scanner keyboard = new Scanner(System.in); do { // Get a value to search for. System.out.print("Enter a value to search for: "); searchValue = keyboard.nextInt(); // Search for the value result = binarySearch(numbers, searchValue); // Display the results. if (result == -1) System.out.println(searchValue + " was not found."); else { System.out.println(searchValue + " was found at " + "element " + result); } // Consume the remaining newline. keyboard.nextLine(); // Does the user want…
Enhanced binary search BinarySearchDemo.java package chapter7; import java.util.Scanner; /** This program demonstrates the binary search method in the ArrayTools class. */ public class BinarySearchDemo { public static void main(String[] args) { // The values in the following array are sorted // in ascending order. int numbers[] = {101, 142, 147, 189, 199, 207, 222, 234, 289, 296, 310, 319, 388, 394, 417, 429, 447, 521, 536, 600}; int result, searchValue; String input; // Create the console input objects. Scanner keyboard = new Scanner(System.in); do { // Get a value to search for. System.out.print("Enter a value to search for: "); searchValue = keyboard.nextInt(); // Search for the value result = binarySearch(numbers, searchValue); // Display the results. if (result == -1) System.out.println(searchValue + " was not found."); else { System.out.println(searchValue + " was found at " + "element " + result); } // Consume the remaining newline. keyboard.nextLine(); // Does the user want…
import ADTs.QueueADT;import DataStructures.ArrayStack;import ADTs.StackADT;import DataStructures.LinkedQueue;import java.util.Scanner; /**** @author Qiong*/public class RepeatStrings {public static void main(String[] argv) throws Exception{final int SIZE = 3;Scanner keyboard = new Scanner(System.in);QueueADT<String> stringQueue;//stringQueue = new CircularArrayQueue<String>(SIZE);stringQueue = new LinkedQueue<String>();StackADT<String> stringStack;stringStack = new ArrayStack<String>(SIZE);String line;for (int i = 0; i < SIZE; i++){System.out.print("Enter a line of text which includes only 3 words > ");line = keyboard.nextLine();//TODO enque the new element//TODO push the new element}System.out.println("\nOrder is: ");for (int i = 0; i < SIZE; i++){// TODO Remove an element in the order in which we input strings// Save it to the String variable, named lineSystem.out.println(line);}System.out.println("\nOpposite order is: ");for (int i = 0; i <…
sortsearchassigncodeex1.java sort, search for a specific student package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 {     //         public static void fillArray(Scanner inputFile, int[] arrIn){     int indx = 0; //Complete code                   {       arrIn[indx] = inputFile.nextInt();       indx++;     } } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static void displayArray(int[] arrIn){     for(int indx=0; indx<arrIn.length;indx++)        System.out.printf("student %2d sID: %5d\n",(indx+1),arrIn[indx]); } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static int searchArray(int[] arrIn, int sValue){     int retValue = -1; // if the value is not found method will return -1     for(int indx=0; //Complete code ;indx++)        if(arrIn[indx] == sValue) retValue = indx;     return retValue; }…
sortLecNotes sortsearchassigncodeex1.java sort, search for a specific student package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 {     //         public static void fillArray(Scanner inputFile, int[] arrIn){     int indx = 0; //Complete code                   {       arrIn[indx] = inputFile.nextInt();       indx++;     } } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static void displayArray(int[] arrIn){     for(int indx=0; indx<arrIn.length;indx++)        System.out.printf("student %2d sID: %5d\n",(indx+1),arrIn[indx]); } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static int searchArray(int[] arrIn, int sValue){     int retValue = -1; // if the value is not found method will return -1     for(int indx=0; //Complete code ;indx++)        if(arrIn[indx] == sValue) retValue = indx;     return retValue; }…
Find the index of the first negative numberIntegerListUtils.java import java.util.ArrayList; public class IntegerListUtils {    /** * Finds the index of the first negative number in the list. *   * @param numbers a list of integers * @return the index of the first negative number, or -1 if no negative number found */ public static int findIndexOfFirstNegative(ArrayList<Integer> numbers) { // complete this method    }}
Main.java 1 class DictionaryEntry 2 - { 3 4 5 6 7 8 9- 10 11 12 13 14 15 String word; String definition; Dictionary Entry(String w, String def) {this word=new String (w); // Clone the strings this definition = new String(def); } class TestMyDictionary public static void main(String[] args) { } DictionaryEntry [] Dico = new DictionaryEntry [10]; Dico [0]=new Dictionary Entry("Java" "A modern object-oriented Type here to search programming language"); Dico [1]=new DictionaryEntry ("C++" "An effective object oriented programming language"); Dico [2] = new DictionaryEntry("FORTRAN, "FORTRAN stands for FORmula TRANSIation. Often used for simulation."); O JL I S Et Run O $ Output
INSTRUCTION: make this a flowchart import java.util.HashSet;import java.util.Scanner;import java.util.Set; public class elements { public static void main(String args[]) { Scanner sc = new Scanner(System.in); // Creating two sets Set<Integer> set1 = new HashSet<Integer>(); Set<Integer> set2 = new HashSet<Integer>(); System.out.println("Enter the element of set A [max-5 elements]: "); for (int i = 0; i < 5; i++) { int num = sc.nextInt(); set1.add(num); } System.out.println("Enter the element of set B [max-5 elements]: "); for (int i = 0; i < 5; i++) { int num1 = sc.nextInt(); set2.add(num1); } // creating a menu of opeartions System.out.println("a. Identify elements of set"); System.out.println("b. Check Union"); System.out.println("c. Check Difference"); System.out.println("d. Check Intersection"); System.out.println("e. Check Subset"); System.out.println("f. If set A and B are…
BooksMan import java.util.HashMap; import java.util.ArrayList; class Book{ String title, ISBN; ArrayList authors; public Book (String title, String ISBN, String authors){ this.title = title; this.ISBN = ISBN; this.authors = new ArrayList(); if (authors != null) { String [] authorArray = authors.split(", "); for (int i = 0; i < authorArray.length; i++) { this.authors.add(authorArray[i]); } } } public String getISBN() { return ISBN; } public String getTitle() { return title; } public ArrayList getAuthors() { return authors; } } public class Main { public static HashMap buildMap(Book[] s) { HashMap books = new HashMap(); if (s != null) { // TODO Write the statements here: to manage each book from the parameter array reference to the hashmap } return books; } public static void main(String argv[]) { Book[] bookArray = new Book[4]; for (int i = 0; i < 4; i++) {…
import java.util.Scanner; public class ModifyArray { public swapArrayEnds(10, 20, 30, 40) { for (i = 0; i < (arrVals.length / 2); ++i) { tempValue = arrVals[i]; // Do swap //*please fix code// arrVals[i] = arrVals[arrVals.length - 1 - i]; arrVals[arrVals.length - 1 - i] = tempValue; Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. public static void main (String [] args) { Scanner scnr = new Scanner(System.in); int numElem = 4; int[] sortArray = new int[numElem]; int i; int userNum; for (i = 0; i < sortArray.length; ++i) { sortArray[i] = scnr.nextInt(); } swapArrayEnds(sortArray); for (i = 0; i < sortArray.length; ++i) { System.out.print(sortArray[i]); System.out.print(" "); } System.out.println(""); }}
USING THE FOLLOWING METHOD SWAP CODE: import java.util.*; class ListIndexOutOfBoundsException extends IndexOutOfBoundsException { public ListIndexOutOfBoundsException(String s) { super(s); } } class ListUtil { public static int maxValue(List<Integer> aList) { if(aList == null || aList.size() == 0) { throw new IllegalArgumentException("List cannot be null or empty"); } int max = aList.get(0); for(int i = 1; i < aList.size(); i++) { if(aList.get(i) > max) { max = aList.get(i); } } return max; } public static void swap(List<Integer> aList, int i, int j) throws ListIndexOutOfBoundsException { if(aList == null) { throw new IllegalArgumentException("List cannot be null"); } if(i < 0 || i >= aList.size() || j < 0 || j >= aList.size()) { throw new ListIndexOutOfBoundsException("Index out…
void getInput(){for(int i =0; i < studentName.length; i++){System.out.print("Student name: ");studentName[i] = keyboard.nextLine();System.out.print("Studnet ID: ");midTerm1[i] = keyboard.nextInt();}keyboard.close();} Can't put full student name becuase nextLine();