3. Give FriendsDB a new method for finding friends by their favorite food. Add a method friends_who_love(food), which returns a sorted list of all of the friends in the FriendsDB who have a specified favorite food in their set of favorite foods. Is this a good place to use a list comprehension for style points?? Sample usage should look like: >>> friend1 = Friend("sarah", 165) >> friend1.add_favorite_food("strawberries") >> friend1.add_favorite_food("falafel") >>> friend2 = Friend("dweezil", 175) >> friend2.add_favorite_food("pizza") >>> friend3 = Friend("eliza", 170) > friend4 = Friend("bimmy", 60) >» friend4.add_favorite_food("falafel")

3. Give FriendsDB a new method for finding friends by their favorite food. Add a method friends_who_love(food), which returns a sorted list of all of the friends in the FriendsDB who have a specified favorite food in their set of favorite foods. Is this a good place to use a list comprehension for style points?? Sample usage should look like: >>> friend1 = Friend("sarah", 165) >> friend1.add_favorite_food("strawberries") >> friend1.add_favorite_food("falafel") >>> friend2 = Friend("dweezil", 175) >> friend2.add_favorite_food("pizza") >>> friend3 = Friend("eliza", 170) > friend4 = Friend("bimmy", 60) >» friend4.add_favorite_food("falafel")

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

If we want to filter out the results and shows only the values of certain properties, such as Name, Status of Get-Service cmdlet, we can use this cmdlet: Group of answer choices Remove-Item Select-String Select-Object Sort-Object
Add a method to the Parking Office to return the collection of permit ids for a specific customer (getPermitIds(Customer)) I have already coded the permit id class, but I attached the class diagram for you to see. Current Java Code: package parkingsystem4;import java.util.LinkedList;import java.util.List; public class ParkingOffice { String name; String address; List<Car> cars = new LinkedList<Car>(); List<Customer> customers = new LinkedList<Customer>(); List<ParkingLot> lots = new LinkedList<ParkingLot>(); List<ParkingCharge> charges = new LinkedList<ParkingCharge>(); // Default constructor ParkingOffice(){ } // Parameterized constructor ParkingOffice(String name, String address, List<Car> parkedCars, List<ParkingLot> lots, List<ParkingCharge> charges){ this.name = name; this.address = address; this.cars = parkedCars; this.lots = lots;…
Create the compareTo method for a class that represents an individual whose first and last names are stored as two Strings. In an alphabetical list of people with last names first and then first names, one individual is "less than" another if they come before the other.(as is typical).
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 many references must you change to insert/delete a node in a single/double linked list? What are the time complexities of finding 10000th element from beginning of a linked list of size n? Understand the method such as AppentToHead, AppendToTail, Delete,...etc and be able to answer questions based on certain scenario?
HOW CAN I ADD THE FIRST NAME. LAST NAME AND EMAIL ADDRESS TO THE SEARCH LIST? OR CAN YOU USE SWITCH STATEMENT ? THE PROBLEM HERE IS THAT I WANT TO INCLUDE THE FIRST NAME LAST NAMR OR EMAIL ADDRESS TO SEARCH THE PERSON I WANT TO SEARCH void search_person(){ long int phone_1920213; printf("\n\nEnter Phone number of the person you want to search : "); scanf("%ld",&phone_1920213); FILE *fp; fp = fopen("phonebook_1920213", "rb"); if (fp == NULL) { printf("No results! The number you have searched is not of on the list. Plase try again !\n"); //print to continue using the program //press any key to continue printf("\nKINDLY PRESS ANY KEY TO CONTINUE USING THE PROGRAM!\n"); return; } else { int flag = 0; phonebook_1920213 p; while (fread(&p, sizeof(p), 1, fp) == 1) { if(p.contactnum_1920213 == phone_1920213) { printf("FIRST NAME\t\t\t\t SURNAME\t\t…
You are to implement removeHead, and removeTail and you also have to create the following functions (for visual purposes of the detail explanation, header and trailer sentinels are described as h and t respectively): IMPORTANT NOTE: For all the methods that has the pos parameter i.e. addAt, removeAt, move, make sure to access that specified position from whichever is nearer - the head or the tail - similar to what we have done in the get method. Example DoublyLinkedList: h <-> 10 <-> 30 <-> 40 <-> 50 <-> t int add(int num) This will add the element num into the last element of the linked list and return the position of the newly-added element. In the above example, having add(60) will return 5 as it is the fifth position in the list. int remove(int num) This will remove the first instance of the element and return the position of the removed element. In the above example, having remove(40) will return 3 as 40 was the third element in the linked list…
Thank you, it has the correct output now! Last thing, can this be done without using a Hashmap, but instead with the original method of using just the LinkedList in the original question? If so, please provide another solution without using hashmap to see the difference in structure of the code!
Which of the following implementation is the best in terms of time consumption when we have a music player that allows us to skip to next song, go back to previous song, and automatically goes back to the first song after playing the last one in the list? a.Singly linked list b.Circular Doubly linked list. c. Doubly linked list d.Circular Singly linked list e.All of the above have same preformance
HashMap is a parameterized class. List those of its methods that depend on the types used to parameterize it. Do you think the same type could be used for both of its parameters?
Improve the method printList to print out the details of all publications ordered on the category of the publications, and then on the title within each category. Note: currently there are only 2 categories, i.e. Book and Journal, but the project may be expended by adding other categories, e.g. Newspaper etc. Here are my four classes. public class Database {private ArrayList<Publication> publicationList; // An array list collection of publications /*** Create a new database*/public Database() {publicationList = new ArrayList<Publication>();} /*** Add a publication** @param publication The publication to be added*/public void addPublication(Publication publication) {if (publicationList.contains(publication)) {System.out.println("This publication has already been added to the list: " + publication);} else {publicationList.add(publication);}} /*** Get the total number of publications** @return The total number of publications*/public int getTotal() {return…
In JAVA, use a HashMap to count and store the frequency counts for all the words from a large text document. Then, display the contents of this HashMap with given words and their frequency in the document. Next, please create a set view of the Map and store the contents in an array. Sort this array based on key value and display it. Finally, sort the array in decreasing order by frequency and display it.