[2, 4, 5, 8]input ()while user_input != 'end':numbers =user_inputtry:=#Possible ValueErrordiviforint (user_input)if divisor > 20:#Possible NameError# compute() is not definedresult = compute (result)elif divisor < 0:# Possible IndexErrorresult =else:print ('OK')numbers [divisor]# Possible ZeroDivisionErrorresult = 20 // divisorprint (result, end-' ')except (ValueError, ZeroDivisionError):print ('r', end=' ')except (NameError, IndexError) :print ('s', end=' ')input ()user inputType the program's output=# // truncates to an integerInputnine-1002-295endOutput0

1. Initialize a list of numbers `[2, 4, 5, 8]`.2. Prompt the user for input and store it in the…

numbers = [2, 4, 5, 8] user_input = input () while user_input != 'end': try: #Possible ValueError diviforint (user_input) if divisor > 20: # Possible NameError # compute() is not defined result = compute (result) elif divisor < 0: #Possible IndexError result = numbers [divisor] else: #Possible ZeroDivisionError result = 20 // divisor print (result, end-' ') except (ValueError, ZeroDivisionError): print ('r', end=' ') except (NameError, IndexError): print ('s', end=' ') user_input = input () print ('OK') # // truncates to an integer Input nine -10 0 2 -2 95 end Output

numbers = [2, 4, 5, 8] user_input = input () while user_input != 'end': try: #Possible ValueError diviforint (user_input) if divisor > 20: # Possible NameError # compute() is not defined result = compute (result) elif divisor < 0: #Possible IndexError result = numbers [divisor] else: #Possible ZeroDivisionError result = 20 // divisor print (result, end-' ') except (ValueError, ZeroDivisionError): print ('r', end=' ') except (NameError, IndexError): print ('s', end=' ') user_input = input () print ('OK') # // truncates to an integer Input nine -10 0 2 -2 95 end Output

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

Check numbers = [2, 4, 5, 8] user_input = input () while user_input != 'end': try: # Possible ValueError divisor = int (user_input) if divisor > 20: # Possible NameError #compute() is not defined result compute (result) = elif divisor < 0: # Possible IndexError result = numbers [divisor] else: # Possible ZeroDivisionError result = print (result, end=' ') = 20 // divisor except (ValueError, Zero DivisionError): print ('r', end=' ') except (NameError, IndexError): print ('s', end=' ') user_input input () print ('OK') Next Type the program's output # // truncates to an integer 2 Input 90 -7 10 eight -2 0 end Output 3
numbers = [2, 4, 5, 8] user_input = input () while user_input != 'end': try: #Possible ValueError divisorint (user_input) if divisor > 20: #Possible NameError #compute () is not defined result = compute (result) elif divisor < 0: #Possible IndexError result = numbers [divisor] else: # Possible ZeroDivisionError result = 20 // divisor print (result, end='.') except (ValueError, ZeroDivisionError): print ('r', end=' ') except (NameError, IndexError): print ('s', end=' ') Type the program's output user_input = input () print ('OK') # // truncates to an integer Input -3 three 67 0 10 -8 end Output
int FindSmallestVal() { int num = 0, min = 0; // reads num until the num > 0 while (num <= 0) { cin >> num; // finds the min value in the min,num min = num < min ? num : min; } // returns min return min; }
Dec2Hex function : def decimal_to_hex(number): hex_map = {0: '0', 1: '1', 2: '2', 3: '3', 4: '4', 5: '5', 6: '6', 7: '7', 8: '8', 9: '9', 10: 'A', 11: 'B', 12: 'C', 13: 'D', 14: 'E', 15: 'F'} hex_digits = [] while number > 0: hex_digits.append(hex_map[number % 16]) number //= 16 # Reverse the order of the hex digits and join them to form the final hex string hex_string = ''.join(reversed(hex_digits)) return f'0x{hex_string}' if hex_string else '0x0' Perform a Profile of your Dec2Hex function. Write a function that takes a timedate object as a parameter andcalculates the number of years from NOW to the time in the timedateobject. Add unit-testing code to your Dec2Hex exercise, and then perform aUnit test of the updated Dec2Hex code.
Match the C-function on the left to the Intel assemble function on the right. W: cmpl $4 movl %edi , %edi jmp .L4(,%rdi,8) %edi .L3: movl $17, %eax ret .15: movl $3, %eax int A ( int x , int y) { int a ; if ( x == 0 ) else i f ( x == 1 ) a = 3 ; else i f ( x == 2 ) a = 2 0 ; else i f ( x == 3 ) a = 2 ; else i f ( x == 4 ) a = 1 ; ret .L6: a = 17; movl $20, %eax ret .L7: movl $2, %eax ret else a = 0; .L8: return a ; movl $1, %eax .L2: ret . section .rodata . L4: .quad .L3 .quad .L5 .quad .L6 .quad .L7 .quad .L8 X: testl %edi, %edi je cmpl je cmpl je стр1 je cmpl .L16 $1, %edi .L17 $2, %edi .L18 $3, %edi int B (int x, int y) { int a; switch (x) { .L19 $4, %edi %al movzbl %al, %eax case 0: a = 17; break; sete break; case 1: a = 3; case 2: a = 20; break; case 3: a = 2; break; case 4: a = 1; a = 0; } return a; ret .L16: break; movl $17, %eax ret .L17: movl $3, %eax } ret .L18: movl $20, %eax ret .L19: movl ret $2, %eax
function main() { # ist: input numbers #w: outer for loop index # X: inner for loop index # y: number of parsmeters # min: index for max value at the time of iteration # buf: used for swapping ____________________a _______ #declare local vars let=___________b___ #intialize aary with the parametrs y= _______c___ # find the lenght of lstfor((________________)); do min=________e_____ # intialize main index for ((___________f_______)); do # find index for main value in one line. use a short tets. _________g_____done # swap- two values using two indices, min and outerloop # use buf to hold value when swapping ________________h________ # move min lst [.] to buf ________________i_______ # move lst[.] to lst[.] _________________j_____ # move buf to lst[.]done}main "@" # pass the input parameters to the function main# end of bash script show me the ss when u run chatgpt doesnt give right code
Cyclops numbersdef is_cyclops(n):A nonnegative integer is said to be a cyclops number if it consists of an odd number of digits so that the middle (more poetically, the “eye”) digit is a zero, and all other digits of that number are nonzero. This function should determine whether its parameter integer n is a cyclops number, and return either True or False accordingly n Expected result 0 True 101 True 98053 True 777888999 False 1056 False 675409820 False
# hard-coded calls # hard-coded linescouple = NumCouple(4, 7)print(f"The couples minimum is {couple.minimum()}")print(f"The couples maximum is {couple.maximum()}")print(f"The couples product is {couple.product()}")thruple = NumThruple(3, 5, 2)print(f"The thruples minimum is {thruple.minimum()}")print(f"The thruples maximum is {thruple.maximum()}")print(f"The thruples product is {thruple.product()}")
In Python, grades_dict = {'Wally': [87,96,70], 'Eva': [100,87,90], 'Sam': [94,77,90], 'Katie': [100,81,82], 'Bob': [83, 65, 85]} write your own describe function that produces thesame 8 statistical results, for each one of the columns, that the built-in describe() function does.Note 1: Use the sample standard deviation formula (that is, the denominator is: N-1)Note 2: Your algorithm should work for any number of columns not just for 5Note 3: You can use the np.percentile() for the 25% and 75% percentile as well as the sort()built-in functions
Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 72 + 52. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares. To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 72 + 62 and 92 + 22 , of which this function must return (9, 2). The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere, used in the function two_summers in one of our class examples, is directly applicable to this…
Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 72 + 52. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares.To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 72 + 62 and 92 + 22 , of which this function must return (9, 2).The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere, used in the function two_summers in one of our class examples, is directly applicable to this…
C programming pseudocode pointers help. { totalInAGivenHour+=*(rawReadings+ monthNo*30*14*4 + 14*4*nThDateOfMonth+ 4*nThHourOfDateFrom7AM + nThReadingTimeOfHour); // the pointer is to assign the values in the bracket and storing them in totalInAGivenHour }