Define a function called create_numbers_dictionary (numbers) which takes a list of integers as a parameter and creates a dictionary by looping though each element in the list. The function returns the dictionary that records the frequencies of the numbers 1 to 6 (inclusive) appearing in the parameter list. For example: Test Result 11 a_dict = create_numbers_dictionary ([3, 2, 2, 3, 2, 4, 5, 4, 1]) for key in sorted (a_dict): 23 print(key, a_dict [key]) 32 print (type (a_dict)) 42 51 60 a_dict = create_numbers_dictionary ([3, 4, 1, 4, 2, 6, 3, 4, 2, 1]) {1: 2, 2: 2, 3: 2, 4: 3, 5: 0, 6: 1} print(a_dict) print (type(a_dict [2]))

Define a function called create_numbers_dictionary (numbers) which takes a list of integers as a parameter and creates a dictionary by looping though each element in the list. The function returns the dictionary that records the frequencies of the numbers 1 to 6 (inclusive) appearing in the parameter list. For example: Test Result 11 a_dict = create_numbers_dictionary ([3, 2, 2, 3, 2, 4, 5, 4, 1]) for key in sorted (a_dict): 23 print(key, a_dict [key]) 32 print (type (a_dict)) 42 51 60 a_dict = create_numbers_dictionary ([3, 4, 1, 4, 2, 6, 3, 4, 2, 1]) {1: 2, 2: 2, 3: 2, 4: 3, 5: 0, 6: 1} print(a_dict) print (type(a_dict [2]))

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

Write a function named dictMax which takes two arguments: a dictionary and a list. Your function must look for the keys provided in the list argument, within the dictionary argument and return the maximum of the corresponding values. For example: dictMax({1:3, 3:2, 4:5, 2:6, 7:-1, 6:-3}, [3,2,6]) will return 6, because key 3 in the dictionary corresponds to value 2, key 2 to value 6 and key 6 to value -3, and among 2, 6 and -3, the maximum is 6. If a key does not exist in the dictionary, you should omit it. If none of the keys exist in the dictionary, you should return None.
Merge2AscListsRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list – X-list and Y-list should both be empty after the call. The function should: ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function). ► Not use any global variables or static local variables. ► Not use any looping constructs (for, while, do-while, ...). ► Be directly (not indirectly) recursive. ► Not create any new nodes, destroy any existing nodes or copy/replace the data item of any node. ► Not make temporary copies of the data involved using any other storage structures (arrays, stacks, queues, etc.). ► Use (if ever needed) no more than a small number of pointers to hold certain link addresses. ○ Not make temporary copies of the…
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possible
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: SinglyLinkedListNode pointer head: a reference to the head of a list int data: the data value for the node to insert Returns SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail. Constraints Sample Input STDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values…
Instructions are given within the quotations for each function. 1)def remove_duplicate_sorted(t): """ this function returns a new list generated from t that has t's elements without duplicates and is sorted from smallest to largest. """ return [] 2)def list_to_dictionary(t): """ t is a list of values (values could be str, list, tuple, set, dictionary), create and return a dictionary such that the key is len(v) for some v in t, and the value is a list of values [v1, v2, ...] from t (in the order they appeared in t) whose len(vi) is the key. for example: if t = [(1,2,3), "abc", [1, 2], (), ""] then return value of this function should be: {3: [(1, 2, 3), 'abc'], 2: [[1, 2]], 0: [(), '']} """ return {} 3)def run(): """ This function repeatedly ask user to enter a string and store them in a list and print it out. It also passes this list to remove_duplicate_sorted() function and list_to_dictionary() function and print out the results of the function calls. """ return if __name__ ==…
• Create a function which takes a tuple and returns a dictionary which is a histogramto count how many times each number exists in the tuple:• The main program must take the dictionary, transform the items into a list,use sort () to order the list (in ascending order) and after that display the list. def histo_n (x):'' '(tuple) -> dictReturns a dictionaryPrecondition: the tuple contains integers>>> t = (1,2, -3,3,4, -3,3,3)>>> histo_n (t){1: 1, 2: 1, 3: 3, 4: 1, -3: 2}'' ' Subject: Python Programming
Write a Python function countEvens that consumes an integer N and a nested list representing a matrix of arbitrary size (but larger than NxN). The function returns the number of even numbers in the NxN sub-matrix of the first N rows and columns. Note: You may assume the list argument passed to the function is a nested list of integers, but it may be larger than NxN!
Write a function called list_to_dict(lst) that takes a 2-D list of sales records of this form.[["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75]]Your function will store the sales information in a dictionary, where each {key:value} pair of the dictionary stores {a unique customer: [ a list of all products purchased by this customer, total cost of these products]}, and returns the dictionary. Sample run,sales = [ ["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75],["customer2", "milk", 4.35], ["customer3", "egg", 3.6], ["customer4", "bread", 4.5],["customer1", "milk", 4.35], ["customer2", "egg", 3.6], ["customer4", "milk", 4.35] ]>>> record = list_to_dict(sales)>>> display(record)customer1 : [['bread', 'egg', 'milk'], 16.1]customer2 : [['bread', 'milk', 'egg'], 12.45]customer3 : [['egg'], 3.6]customer4 : [['bread', 'milk'], 8.85]
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…
in C++... kth Element Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. PLEASE DON'T reject this question, this is the whole question that I have... so please do it however u can, Thank you!