LAD AS. IMENT 2) author_book.py Use the previous project as a model. This time, use a variable called readings, of the dictionary data type (instead of users). It stores your favorite authors and book titles, as key-value pairs. Initialize the dictionary with 3 authors and book titles. • • Like the previous program, this one should display a command menu and let the user view, add, edit and delete dictionary entries. • With the new program, you need to adapt the variable names, user-facing messages and capitalization strategies to fit the new content. NOTE: test data needs to use the same capitalization strategy as the program. COMMAND MENU view - View readings add Add a reading edit Edit a reading del Delete a reading Exit program exit Command: edit Enter author's name: G.W. Bush Current book title is 41: Portrait of My Father. Enter new title for G.W. Bush: Decision Points G.W. Bush title was edited to Decision Points. Command:

LAD AS. IMENT 2) author_book.py Use the previous project as a model. This time, use a variable called readings, of the dictionary data type (instead of users). It stores your favorite authors and book titles, as key-value pairs. Initialize the dictionary with 3 authors and book titles. • • Like the previous program, this one should display a command menu and let the user view, add, edit and delete dictionary entries. • With the new program, you need to adapt the variable names, user-facing messages and capitalization strategies to fit the new content. NOTE: test data needs to use the same capitalization strategy as the program. COMMAND MENU view - View readings add Add a reading edit Edit a reading del Delete a reading Exit program exit Command: edit Enter author's name: G.W. Bush Current book title is 41: Portrait of My Father. Enter new title for G.W. Bush: Decision Points G.W. Bush title was edited to Decision Points. Command:

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

● Create a module called my_first_module. ● Initialise the module with NPM. ● Install lodash to this module. ● Create a script called remove_duplicates.js. ● Within this script, you will need to import lodash, and use the uniq function. ● Create the following array: [1, 2, 10, 100, 10, 2, 5, 6, 10, 1000, 7, 2, 100, 1, 5, 7, 10] ● Using lodash, print out that same array, but with all duplicates removed. ● Finally, set up your module to run the script using: > npm run rdup
Create a dictionary (order_dict) that the key is the burger number, and the value is a list of the quantities. For example: order_dict which is {'1': [10, 3, 78], '2': [35, 0, 65], '3': [9, 23, 0], '4': [0, 19, 43], '5': [43, 0, 21]} Create a dictionary (total_order_dict) that the key is the burger number, and the value is the total of the quantities for that burger. For example: total_order_dict which is {'1': 91, '2': 100, '3': 32, '4': 62, '5': 64} Use "assert to test the values of the total_order_dict For example: expected_result_ototal_order_dict = {'1': 91, '2': 100, '3': 32, '4': 62, '5': 64} assert actual_result_ototal_order_dict['1'] == expected_result_ototal_order_dict['1'] , "The actual result is not the \same as expected result for the order number 1!" (and test the other elements) The function can be like: def test_sum(): #Testing assert actual_result_ototal_order_dict['1'] == 91, "The actual result is not the \ same as expected result for the…
use py only
The function below, get_value_if_key, takes two arguments: the dictionary data_dict and a key of any type my_key. Fix the code to return the value from data_dict for key my_key if that key exists. The function should not return anything otherwise (i.e. return None).
Which of the following statements DOES NOT delete the last value in the list lst? a) 1st.pop( b) 1st.remove(-1) c) 1st = lst[:-1] d) 1st.pop(len(lst)-1)
List food_list contains words read from the first line of input. List food_allergies contains words read from the second line of input. For each element in food_list that is also in food_allergies: Output the element, followed by ' avoided'. Remove the element from food_list.
Overview This program will welcome a user to the trivia builder 3000, then prompt the user to add questions to the trivia bank. After the user indicates they are done it will print out the contents of the trivia bank. Expected Output Example 1 Welcome to the trivia builder 3000 Enter the next question: Who was the fifth Beatle? Enter the correct answer for that question: Pete Best Enter the next question: You did not enter a question, let's try again. Enter the next question: How many dimples does a golf ball have Enter the correct answer for that question: 336 Enter the next question: Done We will stop entering questions now Here is the final trivia dictionary: The question is: Who was the fifth Beatle? And the answer is: Pete Best The question is: How many dimples does a golf ball have? And the answer is: 336 Example 2 Welcome to the trivia builder 3000 Enter the next question: What was the first name for the Beatles? Enter the correct answer for that question: The Quarymen Enter the…
get_top_regions() that takes three input parameters; the 2-D list (similar to the database), the dictionary that stores information of all regions, and a non-zero positive integer x. This function returns a new dictionary that contains the information of top-x regions in terms of the total number of hospitalization cases recorded in these regions. That means these top-x regions have the largest numbers of hospitalization cases. Each {key:value} pair in this resulting dictionary stores the name of a top region as the key and the value is the total number of hospitalization cases reported in this region. The result does not need to be sorted, the regions of the resulting dictionary can appear in any order as long as the top-x regions have been identified correctly. If the value of x is less than 1, or more than the total number of unique regions, your function should print a message informing the user and return an empty dictionary. See sample outputs below. >>> topx_regions…
This program will store roster and rating information for a football team. Coaches rate players during tryouts to ensure a balanced team. (1) Prompt the user to input five pairs of numbers: A player's jersey number (0 - 99) and the player's rating (1 - 9). Store the jersey numbers and the ratings in a dictionary. Output the dictionary's elements with the jersey numbers in ascending order (i.e., output the roster from smallest to largest jersey number). Hint: Dictionary keys can be stored in a sorted list. (3 pts)Ex: Enter player 1's jersey number: 84 Enter player 1's rating: 7 Enter player 2's jersey number: 23 Enter player 2's rating: 4 Enter player 3's jersey number: 4 Enter player 3's rating: 5 Enter player 4's jersey number: 30 Enter player 4's rating: 2 Enter player 5's jersey number: 66 Enter player 5's rating: 9 ROSTER Jersey number: 4, Rating: 5 Jersey number: 23, Rating: 4 Jersey number 30, Rating: 2 ... (2) Implement a menu of options for a user to modify the roster. Each…
Campground reservations, part 3: Available campsites Excellent job! This next one's a little more challenging. Which campsites are available to reserve? We want to be able to quickly find which campsites are available. Can you help us? Given a campgrounds array, return an array with the campsite numbers of all currently unreserved (isReserved === false) campsites. Call the function availableCampsites. Dataset As a reminder, our data looks like this. It's an array with a bunch of campsite objects in it. Here is a small subset of the data to give you an idea: const campgrounds = [ { number: 1, view: "ocean", partySize: 8, isReserved: false }, { number: 5, view: "ocean", partySize: 4, isReserved: false }, { number: 12, view: "ocean", partySize: 4, isReserved: true }, { number: 18, view: "forest", partySize: 4, isReserved: false }, { number: 23, view: "forest", partySize: 4, isReserved: true }, ];
Size not printing seven after deleting rick // Create a new set with some initial values const words = new Set(['bob', 'john', 'marry', 'hilton', 'bala']); // Add some more values ('rick', 'newton', 'bala') to the set words.add('rick'); words.add('newton'); words.add('bala'); // Check if 'hilton' is in the set words.has('hilton'); // Get the size of the set words.size; // Delete 'rick' from the set words.delete('rick'); // Convert the set to an array const wordsArray = Array.from(words); //Print the set console.log(words); //Print the result to check if 'hilton' is in the set console.log(words.has('hilton')); // print the size of the set console.log(words.size); //Print the array console.log(wordsArray);
import json, datetime, csvfrom pprint import pprint Question 3 - Using the cleaned list of lists from question 1, create a dictionary of dictionaries where each key in the outer dictionary is an author whose last name starts with the letter 'S'. - Each inner dictionary should contain the number of books that author has written as 'Number of Books' - It should contain the earliest book title for that author based on year with the key 'First Book' - Finally it should contain the latest book title for that author based on year with the key 'Last Book' - If an author has only one book put the same title in both places - Return the dictionary of dictionaries def author_history(cleaned_list): Args: cleaned_list (list) Returns: dictionary of dictionaries Output: {'SafranFoer,Jonathan': {'First Book': 'ExtremelyLoudandIncrediblyClose', 'Last Book': 'ExtremelyLoudandIncrediblyClose',…