in python write a function where it makes a dictionary from given text file. If no value is present then it is an empty set. should work for any textfile. data with no spaces are keys, data after the tab space is the value def new_dict (textfile): return {} textfile input node1 node2 expected output {'node1': {'node2'}, 'node2': set()} should work with this text file as well: A B C B A C C A B D E E D F G G F H H G I I H G J J I K L L K M M L

in python write a function where it makes a dictionary from given text file. If no value is present then it is an empty set. should work for any textfile. data with no spaces are keys, data after the tab space is the value def new_dict (textfile): return {} textfile input node1 node2 expected output {'node1': {'node2'}, 'node2': set()} should work with this text file as well: A B C B A C C A B D E E D F G G F H H G I I H G J J I K L L K M M L

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Please answer it in Python write a function word_vers_dictionary(word), which takes a word (string) and returns the corresponding dictionary. For example: >>>word_vers_dictionary("tasses ") #return => {'a': 1, 's': 3, 'e': 1, 't': 1} Using the mot_vers_dictionnaire function, write a function is_anagramme(letters, word) that sends True if the string letters is an anagram of the word word, False otherwise. . For example : >>> is_anagramme("tusla", "hi") True >>> is_anagramme("salus", "salut") False
Creation of a python function named b_length that bins a list of strings into a dictionary where the key is an int length of a given string and the associated values are a set of strings of the key’s length found in the original list. How it should work correctly in a test: assert b_length(["your", "quick", "code"]) == {3: {"your", "code"}, 5: {"quick"}} assert b_length(["the", "the", "code"]) == {3: {"the", "code"}}
Write a python program... Write a function called merge2(d1,d2) that takes two dictionaries as input parameters. This function will create a new dictionary that contains everything from the two input dictionaries and return it. The same key might appear in both input dictionaries. In the output dictionary, the value for each key will be a list that has all values corresponding to this key in the two input dictionaries. Sample run,>>> d1 = {'a': 100, 'b': 200, 'c':300}>>> d2 = {'a': 300, 'b': 200, 'd':400} >>> d3 = merge2(d1,d2)>>> display(d3)a, [100,300]b, [200,200]c, [300]d, [400]
Write a function in python, cannot use isalpha or .get named count_letters that takes as a parameter a string and returns a dictionary that tabulates how many of each letter is in that string. The string can contain characters other than letters, but only the letters should be counted. The string could even be the empty string (just ""). Lower-case and upper-case versions of a letter should be part of the same count. The keys of the dictionary should be upper-case letters. If a letter does not appear in the string, then it would not get added to the dictionary. For example, if the string is "AaBb" then the dictionary that is returned should contain these key-value pairs: {'A': 2, 'B': 2}
Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5).The key is the name of an ingredient, and the vlaue is its existingamount. ingr is a list of tuples, where each tuple represents the requiredamount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each itemin the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10}ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2 more apples for this recipe.Note that it is possible for an…
Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5).The key is the name of an ingredient, and the vlaue is its existingamount. ingr is a list of tuples, where each tuple represents the requiredamount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each itemin the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10}ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2 more apples for this recipe.Note that it is possible for an…
Python. Write a function letter_count(L) that takes a list of strings and returns a dictionary D with keys as letters and values as counts of those letters.
this code should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
In this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The textfile is named inputfilename.txt am trying to read for the matrix 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0 def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f = open(inputfilename, 'r') # Read the number of vertices from the first line of the file n =…
Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5). The key is the name of an ingredient, and the vlaue is its existing amount. ingr is a list of tuples, where each tuple represents the required amount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each item in the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10} ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2 more apples for this recipe. Note that it…
Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
Modify the following program to read dictionary items from a file and write the inverted dictionary to a file: characters = {'Bugs':['Rabbit', 1940, 'boy'], 'Garfield': ['Cat', 1978, 'boy'], 'Tweety': ['Bird', 1942, 'girl'], 'Sandy': ['Squirrel', 1999, 'female']} print("Printing the original dictionary") print(characters) print("") def invert_dict(characters): inverse = dict() for key in characters: val = characters[key] for list_item in val: if list_item not in inverse: inverse[list_item] = [key] else: inverse[list_item].append(key) return inverse my_invert = invert_dict(characters) print("Printing the inverted dictionary") print(my_invert) Include the following: 1) The input file for your original dictionary (with at least six items).2) The Python program to read from a file, invert the dictionary, and write to a different file.3) The output file for your inverted dictionary.…