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

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

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

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; }
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
[2, 4, 5, 8] input () while user_input != 'end': numbers = user_input try: = #Possible ValueError diviforint (user_input) if divisor > 20: #Possible NameError # compute() is not defined result = compute (result) elif divisor < 0: # Possible IndexError result = else: print ('OK') numbers [divisor] # Possible ZeroDivisionError result = 20 // divisor print (result, end-' ') except (ValueError, ZeroDivisionError): print ('r', end=' ') except (NameError, IndexError) : print ('s', end=' ') input () user input Type the program's output = # // truncates to an integer Input nine -10 0 2 -2 95 end Output 0
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.
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 }
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
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for the rugged hero to tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The number of ways that a positive integer n can be represented as a sum of consecutive integers is called its politeness, and can also be computed by tallying up the number of odd divisors of that number. However, note that the linked Wikipedia de0inition…
#ifndef lab5ExF_h #define lab5ExF_h typedef struct point { char label[10]; double x ; // x coordinate for point in a Cartesian coordinate system double y; // y coordinate for point in a Cartesian coordinate system double z; // z coordinate for point in a Cartesian coordinate system }Point; void reverse (Point *a, int n); /* REQUIRES: Elements a[0] ... a[n-2], a[n-1] exists. * PROMISES: places the existing Point objects in array a, in reverse order. * The new a[0] value is the old a[n-1] value, the new a[1] is the * old a[n-2], etc. */ int search(const Point* struct_array, const char* target, int n); /* REQUIRES: Elements struct-array[0] ... struct_array[n-2], struct_array[n-1] * exists. target points to string to be searched for. * PROMISES: returns the index of the element in the array that contains an * instance of point with a matching label. Otherwise, if there is * no point in the array that its label matches the target-label, * it should return -1. * If there are more than…
Python please prime_test.py: def is_prime(num):#ADD CODE to return True if num is prime; False if notdef main():#ADD CODE to call is_prime() for integers 1-100# and print the ones that are primemain()
Which XXX completes the following code? public class MyGCDCalculator { public static int findGCD(int inNum1, int inNum2) { int tempVal; if (inNum1 inNum2) { tempVal = inNum1; %3D } else { if (inNum1 > inNum2) { XXX } else { tempVal findGCD(inNum1, inNum2 inNum1); %3D } } return tempVal; } public static void main (String[] args) { int num1 25; int num2 15; %3D
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
user_tickets = int(input())if user_tickets< 5:num_tickets=1else:num_tickets= user_ticketsprint('Value of num_tickets:', num_tickets)