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

def test_corr_coef(): list1 = [78.9, 75.8, 77.3, 74.2, 78.1, 72.8, 77.6, 77.9] list2 = [56.7, 53.1, 56.1, 55.9, 54.1, 48.6, 59.4, 54.0] assert round(corr_coef(list1, list2), 2) == 0.64 return test_corr_coef# Unit testprint (test_corr_coef) I added the print function and get this return please help.
SA5:If on a given computer, selection sort takes 4 seconds to a sort a list with N values, roughly how long will it take on the same computer to sort a list with 7N values? SA6: If on a given computer, merge sort takes 4 seconds to a sort a list with N values, roughly how long will it take on the same computer to sort a list with 7N values?
Jump to level 1 A list of fruits is searched for Pear using binary search. Fruits list: [Apple, Apricot, Berry, Grape, Lemon, Lime, Orange, Peach, Pear, Plum] What is the first fruit searched? Pick ↑ What is the second fruit searched? Pick 1 Check ✪ Next 2 3 4 5
CHALLENGE ACTIVITY 5.10.2: Simon says. "Simon Says" is a memory game where "Simon" outputs a sequence of 10 characters (R, G, B, Y) and the user must repeat the sequence. Create a for loop that compares each character of the two strings. For each matching character, add one point to user_score. Upon a mismatch, end the loop.Sample output with inputs: 'RRGBRYYBGY' 'RRGBBRYBGY' User score: 4 Use Python, please.
A summer camp ofes a moming sesnandan atemon sesin The is momiglist otis he names ofal chidenatedingthe moming sesin and he is tenonlistontinsthe names ofal chide aterdn the atemon sesin. atending boh esins is ound in istnd etums fale chewise. FOR EACH child IN norninglist (MISSING CODE> IF (1SFound (afternoonlList, child) APPEND (lunchList, child)
251e def intersection (self, source): 252e 253 254 Efficiency: 255 Returns a new set with only the values that appear in both self and source. 256 257 258 Maximum size of target Set is the smaller of the maximum sizes of 259 self and source. 260 Use: target = self.intersection(source) 261 262 Parameters: 263 source - a set (Set) 264 Returns: 265 target - a set containing one copy of all the values that appear in both self and source (Set) 266 267 268 Examples: (1,2,3) intersection (3,2,1) is (1,2,3) (1,2,3) intersection (4,5,6) is () (1,2,3,4,5,6) intersection (0,2,4,6,8) is (2,4,6) 269 270 271 272 273 274