There are 5 big names of a certain field: Tom, Jerry, Snoopy, Pooh and Luffy, whose ID are 88888, 5555555, 11111, 12341234 and 1212121, respectively. Please organize those data in dictionary. Program to achieve the following function: After a user inputs the name of a big name, it outputs his/her ID. Separate the results for two blanks with a semicolon. 1- def find person(dict_users, stru): (stru): 1f dict users. return dict_users[stru] else: return 'Not Found' 3 6 name _nain_": dict_users = {'Tom' : 88888, "Jerry':5555555, 'Snoopy':11111, 'Pooh":12341234 Luffy':12i2121) stru = Input ('Please input the name: ') orintiltind person( dict users. 7- if Input/Output : 1 >>> Please input the name: Jerry 5555555 >>>

There are 5 big names of a certain field: Tom, Jerry, Snoopy, Pooh and Luffy, whose ID are 88888, 5555555, 11111, 12341234 and 1212121, respectively. Please organize those data in dictionary. Program to achieve the following function: After a user inputs the name of a big name, it outputs his/her ID. Separate the results for two blanks with a semicolon. 1- def find person(dict_users, stru): (stru): 1f dict users. return dict_users[stru] else: return 'Not Found' 3 6 name _nain_": dict_users = {'Tom' : 88888, "Jerry':5555555, 'Snoopy':11111, 'Pooh":12341234 Luffy':12i2121) stru = Input ('Please input the name: ') orintiltind person( dict users. 7- if Input/Output : 1 >>> Please input the name: Jerry 5555555 >>>

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

you may not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter any type of sorting function for second_largest
Design a function: int search (float a[ ], int n, float x); The function searches in array a of size n for the item x. If x is found , its index is returned, otherwise -1 is returned. Design the main function also.
Easy C++ program please answer fast Maximum Subarray Sum Rabbit Jerry downloads the list of N (2 ≤ N ≤ 105 ) stock prices of RABJ and stores them into a circular buffer/array in a clockwise manner (i.e., the first stock price follows the N-th stock price on the circular buffer) starting from index position 0. It is worth pointing out that the stock prices can be negative numbers in the rabbit stock market. He is curious about the maximum subarray sum over this circular buffer. Certainly, the maximum subarray can possibly straddle over both index positions 0 and N-1. Output the maximum subarray sum. The maximum subarray must contain at least one element. INPUT FORMAT (input arrives from the terminal / stdin): First line contains N. The next line contains N space-separated integers denoting the input sequence. The price ranges from -1,000,000 to 1,000,000. OUTPUT FORMAT (print output to the terminal / stdout): A single line containing the maximum subarray sum. Note that the output can…
Please design another function called: multiply_up (int n), which will multiple up from 1 to n, like 1*2*3*4*5....*n, and return the result.
Each function deals with null terminated C-strings. You can assume that any char array passed into the functions will contain valid, null-terminated data. Your functions must have the signatures listed below. This function returns the index in string s where the substring can first be found. For example if s is “Skyscraper” and substring is “ysc” the function would return 2. It should return -1 if the substring does not appear in the string. int findSubstring(char *s, char substring[])
Topics: User-defined functions, list, string, docstringProblem Statement: This program finds the unique letters from a given string and printsthe unique letters and their count. For example: word ‘LITTLE’ has ‘L’, ‘I’, ‘T’, ‘E’ are theunique letters.Lab Scenario:The program repeats until hits ‘n’. The program takes a user input of a string. The programfinds the unique letters in the string, add them in a list and displays the list and their count.Consider the following important points:1) You need to design a user-defined function named count_unique_letters whichtakes user word as parameter and returns the list of unique letters calledunique_letters in the given word.a. Hint: Iterate over each letter in user word, check if the letter is in the list, if notadd it to the list, otherwise continue to the next letter. A ‘in’ keyword can helpto determine if a character in the unique_letters list.b. You need to write a simple docstring for this function.2) Your program must have a main()…
Complete the function ConvertToDecadesAnd Years to convert totalYears to decades and years. Return decades and years using the ElapsedDecades Years struct. Ex: 26 years is 2 decades and 6 years. 1 #include 2 3 typedef struct ElapsedDecadesYears_struct { int decadesVal;` 5 int yearsVal; 6) ElapsedDecadesYears; 7 8 Elapsed Decades Years ConvertToDecadesAndYears(int totalYears) { ElapsedDecades Years tempVal; /* Your code goes here */ 15 int main(void) { 8722878 25 26 } ElapsedDecadesYears elapsedYears; int totalYears; scanf("%d", &totalYears); elapsedYears = ConvertToDecadesAndYears (totalYears); printf("%d decades and %d years\n", elapsedYears.decadesVal, elapsedYears.yearsVal); return 0;
Create a program for Matrix with the following requirements: 1. Allow the user to select what operation to perform like: finding eigenvalues and eigenvectors, sketching the Gershgorin circles, and diagonalization. 2. Allow the user to input any size of the matrices and their elements. 3. Display the matrix input and the result of the operation.
QUESTION 7 1) Write a maxConsecutiveDiff function which returns the maximum difference between any two consecutive values in the array. Consecutive values are next to each other in an array (+/- 1 index) This function should accept all required data as parameters. Examples If the array is 17 15 16 11 14 the maximum consecutive difference is 5 which is the difference between 16 and 11. If the array is 10 13 11 12 19 the maximum consecutive difference is 7 which is the difference between 12 and 19.
For this problem, you will write part of a Python program that will tell the user when to plant certain edible plants in their garden. The plants and their planting seasons are shown in the table below: Plant Season blueberry fall or spring tomato spring pumpkin late spring cabbage spring or late summer strawberry early spring Your code should: Store the plants words and their planting seasons in a dictionary Prompt the user to enter the name of a plant they want to look up. If the plant exists in the dictionary, print its planting season. Your program should be case insensitive e.g. both "cabbage" and "CABBAGE" should print "spring or late summer". If the word does not exist in the dictionary, print a message telling the user that you don't have the information they're looking for. Continue to prompt the user to enter a plant name to look up until they enter "q" to quit the program. Example input / output (User input in blue) Enter a plant name: Pumpkinlate…
A Hide Time Remaining A Geometric Progression Printer As you might recall, a Geometric Progression (or GP) is a sequence of elements in which the next number in the sequence is obtained by multiplying the previous number by the common ratio. The next number in the sequence is obtained by using this formula: a_n=a_1*r(n-1) While the sum of all numbers in the sequence is obtained using any of these formulae: If r= 1, sum=a*n Ifr != 1 and r> 1, sum = a[(rª-1)/(r - 1)] Ifr != 1 and r < 1, sum = a[(1-r)/(1-r)] where a_n = next number in the sequence, a_1 = first number in the sequence, r = common ratio, n = number of terms Your task is to write a Python program that 1: Accepts the necessary inputs from the user, i.e., start value (a_1), common ratio (r), and number of generate to generate (n). 2. Generates the Geometric Progression (GP) sequence starting from a_1 to n. 3. Prints out the GP HORIZONTALLY not VERTICALLY, e.g. 3, 9, 27, 81, 243, 729.... 4. Calculates the sum of all numbers in…
Define a function named reverse() that accepts an array of strings and display it in the reverse order. Example: Given the array: $a=array(“apple”,”orange”,”banana”,”kiwi”) The function must display: kiwi banana orange apple b. Create an array and call the function reverse() use php