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

Question 9 Suppose title is the doubly-linked list object pictured below: current head Which lines of code would be necessary to correctly execute the method call title.remove (3)? Select all that apply. O current.next - current.next.next current.next = null O current.next.previous = current.previous current.previous.next = current.next current.previous = null
We need a linked list to hold information about penguins in a zoo. You will need the following integers for your IntNode (see below). I have included sample values for one of the penguins: penguin ID: 45821 penguin weight (kg): 11 penguin height (cm): 90 We now need to track the number of penguins in the zoo. I would like to propose a better way to track the size of the list. Rather than traversing the list every time you need to know its size, why not keep a variable called listSize that increments every time you add a node to the list and decrements anytime you remove an item from the list? public class penguinList { //nested class IntNode goes here private IntNode first; private int listSize; //...the methods of penguinList class go here } Now, you just need to increment the listSize instance variable in every method that adds a node to the list. If you have any methods that removes a node from the list, decrement the listSize instance variable in those methods instead.…
For this question, you will be given all the code necessary except the parameter. This method needs to take in a List of any type of number (Float, Integer, Double, etc). This parameter will need to make use of a wildcard. You can find documentation for the List datastructure at: https://docs.oracle.com/javase/8/docs/api/java/util/List.html Be sure to either name your parameter 'list' or rename the variable in the method! Your Answer: Feedback 1 public double sumofList(/*TODO add parameters*/) { Your feedback will appear here when you check your answer. double s = 0.0; for (Number n : list){ s += n.doubleValue(); 4 return s; Check my answer! Reset Next exercise
Please choose the correct answer
7- question What keys and values are contained in the following map after execution of the following piece of code? Map map = new HashMap (); map.put (8, "Eight"); map.put (41, "Forty-one"); map.put (8, "Ocho"); map.put (18, "Eighteen"); map.put (50, "Fifty"); map.put (132, "OneThreeTwo"); map.put (28, "Twenty-eight"); map.put (79, "Seventy-nine"); map.remove ( 41); map.remove (28); map.put (28, "18"); map.remove (18); a. {8=Eight, 41=Forty-one, 8=0cho, 18=Eighteen, 50=Fifty, 132=OneThreeTwo, 28=Twenty-eight, 79=Seventy-nine, 28=18} b. {8=Eight, 8=Ocho, 50=Fifty, 132=OneThreeTwo, 79=Seventy-nine, 28=18} c. {50=Fifty, 132=DOneThreeTwo, 8=Ocho, 28=18, 79=Seventy-nine} d. {8=Eight, 50=Fifty, 132=OneThreeTwo, 79=Seventy-nine, 28=18}
Please make sure to follow what is given!!!
Write a function in C++ that takes a pointer to an array as one parameter, and the length of the array as the second parameter. The function shall calculate the longest contiguous streak of odd numbers present in the array. You do not need to handle negative length arrays. Use Example: int. main(){ int array[] = {1,2,3,4,5,7,9}; std::cout << "Number Odd: << numOdd(array, 7); std::cout << std::endl; } Output: 3
I need help with this questions. Thank you
Create different book objects (at least 5 books) and store them in a LinkedList sorted bybook barcode value. Generate a unique random integer value for the barcode.o Iterate through the LinkedList and print out the books’ detailso Create a second LinkedList object containing a copy of the above LinkedList, but inreverse order.
Based on the code from the last two questions, create a new LinkedList. Add 2 values to the LinkedList (there is an add method that accepts data as an argument, called add). Then call the removeFront method created in the previous question.
Java Programming This week's project involves a text file with that holds all of the novel Don Quixote*, by Miguel Cervantes. The text file has been heavily processed. It contains only lowercase letters, spaces, and new lines. That is a good format for counting words. Write code that reads through the text file one word at a time using a Scanner, and the next() method. Put the words into a HashMap, where the words are used as keys, and the values are Integers used to keep track of how many times the words occur in the text. If the text was "one fish two fish red fish blue fish one two three" then the HashMap would look like this: key value "one".... 2 "fish"... 4 "two".... 2 "red".... 1 "blue"... 1 "three".. 1 Once you have created such a HashMap for the whole of the text you can write logic that prints out the answers to these questions: How many times does each of…
in my code there is a syntax error. i am trying to take out each character from inputted string and store each character into a linked list. i keep getting a syntax error stating that "non static method insertFirst(char) cannot be referenced in a static context" I have no idea why this is happening and i need help. I cannot change anything in the link and linkedlist objects i have instructions to rely rigidly to the textbooks code and i cannot change the data types. i would prefer you to explain the problem and solution in words. language is in Java CODE MAIN FUNCTION import java.util.Scanner;/*** Write a description of class test here.** @author (your name)* @version (a version number or a date)*/public class test{// instance variables - replace the example below with your ownpublic static void main(String[] args){Scanner input = new Scanner(System.in);linkedList list = new linkedList();char character;System.out.println("please enter a string.");String inString =…