For this problem, you are given a mostly-working version of the Friend and FriendsDB classes from hw6 and hw7, and we will add new method to FriendsDB -- group friends_by_food. group_friends_by_food returns a dictionary mapping from each of the favorite foods enjoyed by any friend to a list of the friends who enjoy that food, sorted in alphabetical order. (You can use the friends_who_love method to generate these lists.) A sample run should look like this: >>> friend1 = Friend ("sarah", 165) >>> friend1.add_favorite_food("strawberries") >>> friend2 - Friend("dweezil", 175) >>> friend2.add_favorite_food ("pizza") >>> friend3 = Friend("bimmy", 60) >>> friend3.add favorite_food("pizza") >>> friend3.add favorite_food ("strawberries") >>> db = FriendsDB() >>> db.add friend(friend1) >>> db.add_friend(friend2) >>> db.add friend(friend3) >>> db.group_friends by_food() {'strawberries': ['bimmy', 'sarah'], 'pizza': ['bimmy', 'dweezil']}

For this problem, you are given a mostly-working version of the Friend and FriendsDB classes from hw6 and hw7, and we will add new method to FriendsDB -- group friends_by_food. group_friends_by_food returns a dictionary mapping from each of the favorite foods enjoyed by any friend to a list of the friends who enjoy that food, sorted in alphabetical order. (You can use the friends_who_love method to generate these lists.) A sample run should look like this: >>> friend1 = Friend ("sarah", 165) >>> friend1.add_favorite_food("strawberries") >>> friend2 - Friend("dweezil", 175) >>> friend2.add_favorite_food ("pizza") >>> friend3 = Friend("bimmy", 60) >>> friend3.add favorite_food("pizza") >>> friend3.add favorite_food ("strawberries") >>> db = FriendsDB() >>> db.add friend(friend1) >>> db.add_friend(friend2) >>> db.add friend(friend3) >>> db.group_friends by_food() {'strawberries': ['bimmy', 'sarah'], 'pizza': ['bimmy', 'dweezil']}

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

Create a graphical system that will allow a user to add and removeemployees where each employee has an employee id (a six-digitnumber), an employee name, and years of service. Use the hashcodemethod of the Integer class as your hashing function, and use oneof the Java Collections API implementations of hashing.
Implement a __setitem__ function that also supports negative indices. For example: W = L2(Node(10, Node(20, Node(30))))print W[ 10, 20, 30 ] W[1]=25print W[ 10, 25, 30 ] W[-1]=35print W[ 10, 25, 35 ] Complete the code: def L2(*args,**kwargs): class L2_class(L): def __getitem__(self, idx): <... YOUR CODE HERE ...> def __setitem__(self, idx, value): <... YOUR CODE HERE ...> return L2_class(*args,**kwargs) W = L2(Node(10, Node(20, Node(30))))print(W)W[1]=25print(W)W[-1]=35print(W)
Consider records for patients at a medical facility. Each record contains an integer identification for a patient and strings for the date, the reason for the visit, and the treatment prescribed. Design and implement the class PatientRecord so that it overrides the method hashCode. Write a program that tests your new class. Design a class PatientDataBase that stores instances of PatientRecord, as described above. The class should provide at least three query operations, as follows. Given a patient identification and date, the first operation should return the reason for the visit, and the second operation should return the treatment. The third query operation should return a list of dates, given a patient identification.
Consider records for patients at a medical facility. Each record contains an integer identification for a patient and strings for the date, the reason for the visit, and the treatment prescribed. Design and implement the class PatientRecord so that it overrides the method hashCode. Write a program that tests your new class. Design a class PatientDataBase that stores instances of PatientRecord, as described above. The class should provide at least three query operations, as follows. Given a patient identification and date, the first operation should return the reason for the visit, and the second operation should return the treatment. The third query operation should return a list of dates, given a patient identification. Implement the class PatientDataBase. Using a hash table to store the patient records. Write a program that demonstrates and tests this class. JAVA PROGRAM
Consider records for patients at a medical facility. Each record contains an integer identification for a patient and strings for the date, the reason for the visit, and the treatment prescribed. Design and implement the class PatientRecord so that it overrides the method hashCode. Write a program that tests your new class. Design a class PatientDataBase that stores instances of PatientRecord, as described above. The class should provide at least three query operations, as follows. Given a patient identification and date, the first operation should return the reason for the visit, and the second operation should return the treatment. The third query operation should return a list of dates, given a patient identification. Implement the class PatientDataBase. Use a hash table to store the patient records. Write a program that demonstrates and tests this class.
Sort by reverse domain: Write a data type Domain that represents domain names,including an appropriate compareTo() method where the natural order is in order ofthe reverse domain name. For example, the reverse domain of cs.princeton.edu isedu.princeton.cs. This is useful for web log analysis. Hint: Use s.split("\\.") tosplit the string s into tokens, delimited by dots. Write a client that reads domain names from standard input and prints the reverse domains in sorted order
In this task, two hash tables should should be implemented. You can follow the followinginstructions:- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it…
Given the following Java functions, transcribe it into a Python 3 program. /*** Removes the mapping for this key from this hash table if present.*/public Object remove(Object key) {Entry e = removeEntryForKey(key);return (e == null ? e : e.value);}
Given the following Java functions, transcribe it into a Python 3 program. /*** Associates the specified value with the specified key in this hash table.* If the hash table previously contained a mapping for this key, the old* value is replaced.*/public Object put(Object key, Object value) {int hash = hash(key);int i = indexFor(hash, table.length); for (Entry e = table[i]; e != null; e = e.next) {if (e.hash == hash && eq(k, e.key)) {Object oldValue = e.value;e.value = value;return oldValue;}}addEntry(hash, k, value, i);return null;} /*** Add a new entry with the specified key, value and hash code to* the specified bucket. It is the responsibility of this* me…
Using a Generic class that implements the Comparator interface, write a workingprogram that compares the performance of any two IPL teams in terms of the following:1) Points per match= PTS/PLD2) Form= (# of Ws)/33) Net Run Rare= Net RRYou can use the following data to make comparisons between any two teams of yourchoice: You can hard code the data associated with the two teams you have chosen. Hence, no needto take any inputs from the user. Upon running the program, the program should simplyoutput the three comparison results.Additionally, please mention the names of the two chosen teams in the beginning of theprogram in a comment.
There’s a somewhat imperfect analogy between a linked list and a railroad train, where individual cars represent links. Imagine how you would carry out various linked list operations, such as those implemented by the member functions insertFirst(), removeFirst(), and remove(int key) from the LinkList class in this hour. Also implement an insertAfter() function. You’ll need some sidings and switches. You can use a model train set if you have one. Otherwise, try drawing tracks on a piece of paper and using business cards for train cars.
Create a new concrete class that implements MyMap using open addressing with linear probing. For simplicity, use f(key) = key % size as the hash function, where size is the hash-table size. Initially, the hash-table size is 4. The table size is doubled whenever the load factor exceeds the threshold (0.5). Test your new MyHashMap class using the code at https://liveexample.pearsoncmg.com/test/Exercise27_01.txt Class Name: Exercise27_01 If you get a logical or runtime error, please refer https://liveexample.pearsoncmg.com/faq.html MyHashMap.java located here https://liveexample.pearsoncmg.com/html/MyHashMap.html? MyMap.java located here https://liveexample.pearsoncmg.com/html/MyMap.html IMPORTANT Please do not take answers from Chegg or the rest of the internet, they are all wrong (I checked them). Please only provide a solution if you know the answer. I need to submit the code to Revel, I do not need the entire code, I need to submit the code enclosed between // BEGIN…