Problem 6 (TOP 3) Write a function called top3(d) that takes a dictionary as its single input parameter. The input dictionary will always have integers for its values. The function will find the three largest values in the dictionary and return a list of value-key pairs (as a list) for these three values. The output of the returned list will be in decreasing order of values iterate through the list finding the three greatest integers in the dictionary and then print them out (along with their keys). {'a': 100, top3(d) >>> d = 'b': 400, 'c':зөө, 'd': 500, 'e':250'} >>> big3 >>> print(big3) [ [500, 'd'], [400, 'b'], [300, 'c'] ] Page 4 of 5 You can assume that (1) the dictionary has at LEAST three key:value pairs and that (2) the values in the dictionary are UNIQUE. Note: the output has a value-key ordering instead of key-value ordering.

Problem 6 (TOP 3) Write a function called top3(d) that takes a dictionary as its single input parameter. The input dictionary will always have integers for its values. The function will find the three largest values in the dictionary and return a list of value-key pairs (as a list) for these three values. The output of the returned list will be in decreasing order of values iterate through the list finding the three greatest integers in the dictionary and then print them out (along with their keys). {'a': 100, top3(d) >>> d = 'b': 400, 'c':зөө, 'd': 500, 'e':250'} >>> big3 >>> print(big3) [ [500, 'd'], [400, 'b'], [300, 'c'] ] Page 4 of 5 You can assume that (1) the dictionary has at LEAST three key:value pairs and that (2) the values in the dictionary are UNIQUE. Note: the output has a value-key ordering instead of key-value ordering.

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 17SA

See similar textbooks

Similar questions

Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
Problem Statement: Consider an input string PAL of letters ‘P’, ‘A’, and ‘L’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called PAL_TAB. The number of each of these letters is unknown. We have a function, called SWAP(PAL, i, j), which places the ith letter in the jth entry of string PAL and the jth letter in the ith entry of PAL. Note that SWAP(PAL, i, j) is defined for all integers i and j between 0 and length(PAL) – 1, where length(PAL) is the number of letters of PAL. 1. Using our algorithmic language, write an algorithm, called Sort_PAL, which sorts the letters in the array PAL_TAB in a way that all P’s appear first, followed by all A’s, and followed by all L’s. The algorithm Sort_PAL should have one parameter: The array PAL_TAB. Also, your solution is correct only if the four constraints below are satisfied: - Constraint 1: Each letter (‘A’, ‘L’, or ‘P’) is evaluated only once. - Constraint 2: The function SWAP(PAL, i, j) is…
7. using c++, Write a void function that accepts an integer array a and a integer SizeA, and an integer n, and adds n to every element in that array. Be sure to develop an appropriate name for your function.
Problem Statement Given a list_of_strings (which are all lowercase letters), define and implement a function sorted_common_chars that returns a sorted list of the characters that are in all the strings within the list (including duplicates). For example, if the same character occurs three times in three different strings provided, that character should occur three times in your returned list. If the same character occurs two times in one string and three times in another string, that character should be included twice in the returned list. Sample Input sorted_common_chars(["cool","lock","cook"]) Sample Output ['c', 'o'] Sample Input sorted_common_chars(["mom","mummy"]) Sample Output ['m', 'm']
3 Write a function to generate a date string given numeric values for month, day, and year, and a language. The valid languages are "US English", "British English", "French", and "German". If US English is specified the returned string should be in the format of month day, year. For all other languages, the returned string should use the European standard of day month year. In this problem, we are going to rework the internal data representation. Instead of using lists for the months, use a dictionary with the following specification: keys 1-12 return a tuple containing the month strings for each language. An example tuple ("January", "Janvier", "Januar") Use a key for each language. The value associated with the language key should be the index to use with the month tuple. Given the example tuple above the "German" key should return a value of 2. You can assume that the numeric inputs to the function are valid. Example outputs: January 25, 2022 25 Januar 2022 Write a test function…
(python) 19. If the function has two lists (list1 and list2) and does the following for the return: return [list1, list2] What was returned from this function? a. A new list with data of list1 and list2 combined b. A new list with 2 elements: list1 and list2 c. A new tuple with the data of list1 and list2 combined d. A new tuple with 2 elements: list1 and list2
1. c++ problem Use a set to store a list of exclude words. Read lines from the user and count the number of each of the exclude words that the user types.
NEED CODING IN PYTHON OR JAVASCRIPT BUT NOT C++ consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The…
Write a C++ function to find the norm of a matrix. The norm is defined as the square root of the sum of squares of all elements in the matrix Note: the use of pointers is not allowed and code should be simple.The user should input the matrix he wants.We cannot initialize the matrix on our own.
(a) Write a function matrix_multiply(mat1, mat2) that takes two matrices and returns the result of the matrix multiplication between mat1 and mat2. If the two matrices are not compatible with multiplication, then None should be returned. (b) Write a function print_sums(list1, list2) that takes two equal-length lists of numbers and prints all the sums of the corresponding elements. Thus the first line is the sum of the first element of list1 and the first element of list2, the second line is the sum of the second elements, and so on.
For each of the following problems, all functions should be implemented using a call stack. Problem 2: Write a program that defines two integer array that are pre-sorted and the same size (e.g., [3, 7, 9, 11, 15, 21] and [1, 4, 6, 14, 18, 19]) and a function merge that takes the two arrays (and their size) as inputs and populates a single array of twice the size of either input array that contains the elements of both arrays in ascending order. In the example arrays given, then output would be [1, 3, 4, 6, 7, 9, 11, 14, 15, 18, 19, 21]. Have your 'main' function (not the merge function) print out the final array using a comma as a delimiter.