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.

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 1: Faro Shuffle A faro shuffle involves splitting a deck of cards into two piles, then taking cards exactly alternating between the two piles. Write a function (faro-shuffle lst0 lst1),which consumes two (listof Any). The function produces a list which contains all the items in 1st0 and 1st1, interleaved. That is, the first item in the result is the first item from 1st0, the second is the first item from 1st1, the third is the second item from 1st0, the fourth is the second item from 1st1, and so on. If 1st0 and 1stl are not of equal length, the extra items should be included at the end. Here are some examples: 1 (check-expect (faro-shuffle (list "a" "b" "c") (list "A" "B" "C")) (list "a" "A" "b" "B" "c" "C")) 3 (check-expect (faro-shuffle (list 1 3 5) (list 2 4 6 8 10)) (list 1 2 3 4 5 6 8 10)) 2 4 Submit your solution in the file a06q1.rkt.
Exercise B: "Matrix Addition" For this exercise you will design and implement a function that takes two matrix arguments and computes their sum (if and only if a sum can actually be computed, returning an empty list otherwise). Two matrices can only be added together if they have exactly the same dimensions. If the dimensions are acceptable, then the matrix sum will have the same dimensions as either of the operands, and the value of each element in the matrix sum is itself the sum of the corresponding elements in the operand matrices. And although it does makes sense to test rectangularity before attempting addition, you need not perform this step (since you did it above). In order to complete this task, you will need to: ensure you know how matrix addition can be performed² ● Your submission for this exercise:
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…
Because floating-point numbers are imprecise, it is common to compute data values of type float that are very close but not exactly equal to the value 0.0. a) In Python, Write a function countNZdata that counts number of elements in a list of type float whose absolute value is less than or equal to a positive tolerance parameter. The function takes the list as its first parameter; the second parameter is the positive float value that is the tolerance. Function should return the number of data values that meet this criterion. For example, for the given list: [2.19, -0.04, 1.66, 0.05, 4.70, -6.53, -0.11, -1.07, 1.94, -2.23] and a tolerance = 0.1, the function should return the value 3. b) Demonstrate that the function works by inputting different example values.
python codeWrite a Python function listDictPrime() that gets as parameter a list of integers, creates and returns a dictionary where keys are the integers of the list and values are either "prime" or "not prime" depending on key being prime number. Assume that there is a function isprime() that gets an integer parameter and returns True if the integer is a prime number, and returns False if not. Use function call to this function. Do not write this function. Example: if parameter list is [4, 7, 2, 6, 3], then the returned dictionary will be {4: "not prime", 7: "prime", 2: "prime", 6: "not prime", 3: "prime"}. Write only the function listDictPrime().
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, wherelength(TAM) is the number of letters of TAM. 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…
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…
Q4. Write a program that read 2 matrices and has a function which finds their sum. Q5. Write a program that read 2 matrices and has a function which finds their multiplication. Q6. Write a program that handles a list of numbers where it has the following functions - Function that finds their average and sum - Function that finds their maximum and minimum - Function that search for a given number in that list. - Function that count the occurrence of a given number in that list. Then the program should do the following: - Read the list - Find the average and the sum of that list - Find the minimum and the maximum of that list - Count the occurrence of a given number in that list.
7. Given two lists A and B, write a function to compute the difference A – B, where A – B is the list of elements that are in A but not in B. For example, if A is '(6 7 8 9) and B is (7 9) then A – B is '(6 8).
II II II Write a function named `vectorSum(11, 12) that takes two lists of numbers and adds the numbers in 12 on 11, one by one. If 12 is shorter than 11, then 12 recycles from the beginning once it is over. If 12 is longer than 11, then only the first part of 12 that matches the length of 11 is considered. Your function must return the summed up resulting list. For example, vectorSum([1,2,3,4,5], [1,2,3]) returns [2,4,6,5,7] because: 1,2,3,4,5 + + + + + 1,2,3,1,2 -> Here, 12 recycles from the beginning = = = = = 2,4,6,5,7 vectorSum([1,2,3], [1,2,3,4,5]) returns [2,4,6] because: 1,2,3 + + + 1,2,3,4,5 -> Here, only the first 3 items of 12 are used = = = 2,4,6 vectorSum([1,2,3,4,5], [1,2,1,2,1]) returns [2,4,4,6,6] because: 1,2,3,4,5 + + + + + 1,2,1,2,1 -> Here, length of 12 matches the length of 11 = 2,4,4,6,6 You can assume that 11 and 12 are not empty. def vectorSum (11, 12): # remove the following line to solve this question return
Exercise 5 Write a function called is_sorted that takes a list as a parameter and returns True if the list is sorted in ascending order and False otherwise. For example: >>> is_sorted([1, 2, 2]) True >>> is_sorted(['b', 'a']) False
16-Write a function called find_integer_with_most_divisors that receives a list of integers and returns the integer from the list with the most divisors .In the event of a tie, the first case with the most divisors returns .For example: If the list looks like this: [8, 12, 18, 6] In this list, the number 8 has four divisors, which are ;[1,2,4,8] :The number 12 has six divisors, which are ;[1,2,3,4,6,12] :The number 18 has six divisors, which are ;[1,2,3,6,9,18] :And the number 6 has four divisors, which are : [1,2,3,6]Note that both items 12 and 18 have the maximum number of divisors and are equal in number of divisors (both have 6 divisors) .Your function must return the first item with the maximum number of divisors ;Therefore it must return the following value: 12