CHALLENGE 4.4.2: Set theory methods. ACTIVITY The following program includes 10 cities that two people have visited. Write a program that creates: 1. A set all cities that contains all of the cities both people have visited. 2. A set same_cities that contains only cities found in both personl_cities and person2_cities. 3. A set different_cities that contains only cities found in only person1_cities or person2_cities. Sample output for all_cities: ['Accra', 'Anaheim', 'Bangkok', 'Bend', 'Boise', 'Buenos Aires', 'Cairo', 'Edmonton', 'Lima', 'London', 'Memphis', 'Orlando', 'Paris', 'Seoul', 'Tokyo', 'Vancouver', 'Zurich'] NOTE: Because sets are unordered, they are printed using the sorted() function here for comparison. 4252041533126.xxqy7 1 personi_cities = {'Edmonton', 'Vancouver', 'Paris', 'Bangkok', 'Bend', 'Boise', 'Memphis', 'Zurich', 'Accra', 2 person2_cities = {'Accra', 'orlando', 'Tokyo', 'Paris', 'Anaheim', 'Buenos Aires', 'London', 'Lima', 'Seoul', 4 # Use set methods to create sets all cities, same_cities, and different_cities. 6*** Your solution goes here *** 7 8 print (sorted (all_cities)) 9 print (sorted (same_cities)) 10 print (sorted (different_cities))

CHALLENGE 4.4.2: Set theory methods. ACTIVITY The following program includes 10 cities that two people have visited. Write a program that creates: 1. A set all cities that contains all of the cities both people have visited. 2. A set same_cities that contains only cities found in both personl_cities and person2_cities. 3. A set different_cities that contains only cities found in only person1_cities or person2_cities. Sample output for all_cities: ['Accra', 'Anaheim', 'Bangkok', 'Bend', 'Boise', 'Buenos Aires', 'Cairo', 'Edmonton', 'Lima', 'London', 'Memphis', 'Orlando', 'Paris', 'Seoul', 'Tokyo', 'Vancouver', 'Zurich'] NOTE: Because sets are unordered, they are printed using the sorted() function here for comparison. 4252041533126.xxqy7 1 personi_cities = {'Edmonton', 'Vancouver', 'Paris', 'Bangkok', 'Bend', 'Boise', 'Memphis', 'Zurich', 'Accra', 2 person2_cities = {'Accra', 'orlando', 'Tokyo', 'Paris', 'Anaheim', 'Buenos Aires', 'London', 'Lima', 'Seoul', 4 # Use set methods to create sets all cities, same_cities, and different_cities. 6* Your solution goes here * 7 8 print (sorted (all_cities)) 9 print (sorted (same_cities)) 10 print (sorted (different_cities))

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

Using java, answer the following questions about the code below. 1) Create a new function or method that checks to see if an int parameter is present in the list. 2) Create a main() method or JUnit tests to show that your list code functions as intended. (Code) private class Nodeint data;Node next;Node(int data) {this.data = data;this.next = null;}}private Node first;private Node last; public void addToEnd(int data){ Node newNode = new Node(data);if (first == null){first = newNode;last = newNode;} else {last.next = newNode;last = newNode;}}public void printList(){ Node current = first;while (current != null){System.out.print(current.data + " ");current = current.next;}System.out.println();}public static void main(String[] args){node list = new node();list.addToEnd(2);list.addToEnd(4);list.addToEnd(6);list.printList();}}
Question 14 papa.i wrote a map of book like Map <String, Book> (key is book name and value is Book obj.) and a list of student lists as fields in the Library class. Also I write a constructor which initiliaze empty List of student and sets Book map. How Could I write a method such as public boolean bookSearch(String name) that returns false if the Book map does not have book's name in JAVA. Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Implement the design of the Pizza class so that the following output is produced:[Your code should work for any number of parameters added in the set_toppings_info method]# Write your codes here.print("Pizza Count:", Pizza.pizza_count)print("=======================")p1 = Pizza("Chicken")p1.set_toppings_info(25, 1, 4, 0)p1.display()print("------------------------------------")p2 = Pizza("Olives")p2.set_toppings_info(15, 1.5, 0, 0)p2.display()print("------------------------------------")p3 = Pizza("Sausage")p3.set_toppings_info(50, 5, 2, 0)p3.display()print("=======================")print("Pizza Count:", Pizza.pizza_count)Output:Pizza Count: 0=======================Toppings: Chicken25 calories1 g fat4 g protein0 g carbs------------------------------------Toppings: Olives15 calories1.5 g fat0 g protein0 g carbs------------------------------------Toppings: Sausage50 calories5 g fat2 g protein0 g carbs=======================Pizza Count: 3
We have two classes; these classes are "Car" and "Price".The "car" class is a class that keeps the id and price of the car.If the "Price" class is, there will be get / set methods for the segment of the fee (For example Y segment Z segment), the number of cars, and the "Car" class list.In the "Price" class, there should be a print method to add / remove cars to the list and find the ids of Vehicles whose segments are equal to X.The segments are as follows. 0$ -15999$ -> Y Segment16000$-24999$ -> Z Segment25000$-50000$ -> T Segment It is necessary to use "Single Linked List".The program should be written in JAVA.
pet shop wants to give a discount to its clients if they buy one or more pets and at least five other items. The discount is equal to 20 percent of the cost of the other items, but not the pets.Use a class Item to describe an item, with any needed methods and a constructor public Item(double price, boolean isPet, int quantity)An invoice holds a collection of Item objects; use an array list to store them. In the Invoice class, implement methods public void add(Item anItem)public double getDiscount()Write a program that prompts a cashier to enter each price and quantity, and then a Y for a pet or N for another item. Use a price of –1 as a sentinel. In the loop, call the add method; after the loop, call the getDiscount method and display the returned value.
Q6) Answer the following: [2 Marks] a) Write a small code fragment that generates a random integer number using Random class . b) How do you check whether a given key is contained in a map? (Give a Java code example.) c) Create a class MapTester. In it, use a HashMap to implement a phone Book. In this class, implement two methods: public void enterNumber(String name, String number) public String lookupNumber(String name) The methods should use the put and get methods of the HashMap class to implement their functionality
How to pass this test case? Please public void testDao(){ MessageDao.reset(); MessageDao messageDao = MessageDao.getInstance(); Assert.assertEquals(messageDao, MessageDao.getInstance()); // test that constructor is private List<Constructor> constructors = Arrays.asList(MessageDao.class.getConstructors()); Assert.assertEquals(constructors.size(), 0); constructors = Arrays.asList(MessageDao.class.getDeclaredConstructors()); Assert.assertEquals(constructors.size(), 1); Assert.assertTrue(Modifier.isPrivate(constructors.get(0).getModifiers())); } We are supposed to fill this out in order to pass this test: package dao; import dto.MessageDto; import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; // TODO fill this out public class MessageDao implements BaseDao<MessageDto> { private static MessageDao instance = new MessageDao(); public static MessageDao getInstance() { } // TODO fill this out @Override public void put(MessageDto…
Write a java program that: (You must use either a set or a map to solve the method) You are given n pairs of strings. Two pairs (a, b) and (c, d) are identical if a = c, and b = d. Note that (a, b) is not the same as (b, a). Create a method called uniquePairs() that reads n from the user, and after reading each pair as input, outputs the number of unique pairs you currently have. Sample Input:5blue redblue greenred blueblue greenblue red Output Input:12333
I'm getting the errors in this image for the below code: class Node: def __init__(self, initial_data): self.data = initial_data self.next = None class LinkedList: def __init__(self): self.head = None self.tail = None def append(self, new_node): if self.head == None: self.head = new_node self.tail = new_node else: self.tail.next = new_node self.tail = new_node def prepend(self, new_node): if self.head is None: self.head = new_node self.tail = new_node else: new_node.next = self.head self.head = new_node def insert_after(self, current_node, new_node): if self.head is None: self.head = new_node self.tail = new_node elif current_node is self.tail: self.tail.next = new_node self.tail = new_node else: new_node.next = current_node.next…
You have a fence post located at the point (x,y) where a goat is tethered by a rope. You also have a house, which is a rectangle with diagonally opposite corners at the points bottom-left: (x1,y1) and top-right: (x2,y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope. Recall that the distance formula is: sqrt( (x2−x1)^2+(y2−y1)^2 ) The input consists of a single line containing six space-separated integer values: x, y, x1, y1, x2, and y2. You are guaranteed that x1<x2 and y1<y2, and that (x,y) is strictly outside the axis-aligned rectangle with corners at (x1,y1) and (x2,y2). Return the minimum distance from the goat’s post to the house as a floating-point value from main(). Learning Objectives Be able to create a program with a lesser template. Be able to calculate the min/max of integers. Be able to write a mathematical…
Need help writing the method: getWaitlistedIDs() – returns an array of type int[], namely the ids of students in the waitlist. public int[] getWaitlistedIDs() { // insert solution here and modify the return statement return null; } For context public class Course { public String code; public int capacity; public SLinkedList<Student>[] studentTable; public int size; public SLinkedList<Student> waitlist; public Course(String code) { this.code = code; this.studentTable = new SLinkedList[10]; this.size = 0; this.waitlist = new SLinkedList<Student>(); this.capacity = 10; } public Course(String code, int capacity) { this.code = code; this.studentTable = new SLinkedList[capacity]; this.size = 0; this.waitlist = new SLinkedList<>(); this.capacity = capacity; }
Implement solutions for the following methods: • getCourseSize() – returns the number of students registered in the course (not in the waitlist). It should maintain the public size variable that keeps track of the number of students registered. • getRegisteredIDs() – returns an array of int[], namely registered student id’s. The length of the array is the size (number of students) in the course. • getRegisteredStudents() – returns an array of type Student[], namely the registered Students. The length of the array is the current size (number of students) of the course. • getWaitlistedIDs() – returns an array of type int[], namely the ids of students in the waitlist. • getWaitlistedStudents() – returns an array of Students in the waitlist. public class Course { public String code; public int capacity; public SLinkedList<Student>[] studentTable; public int size; public SLinkedList<Student> waitlist; public Course(String code) {…