Entering -1 without any numbers: Requirements: Enter -1 to terminate enter numbers. You have to enter 3, or more, nonnegative numbers. Enter a number: -1 Good-bye! Entering an invalid number: Requirements: Enter -1 to terminate enter numbers. You have to enter 3, or more, nonnegative numbers. Enter a number: -4 Sorry, invalid number entered. Numbers must be nonnegative values. Enter another number: Entering less than 3 numbers: Requirements: Enter -1 to terminate enter numbers. - You have to enter 3, or more, nonnegative numbers. Enter a number: 30 Enter another number: 2 Enter another number: -1 Sorry, you didn't enter the required nonnegative numbers for processing. Good-bye! Entering the required numbers: Requirements: Enter -1 to terminate enter numbers. - You have to enter 3, or more, nonnegative numbers. Enter a number: 60 Enter another number: 30 Enter another number: 50 Enter another number: 90 Enter another number: 5 Enter another number: -1 Lowest: 5 Highest: 90 Average: 47.0 All numbers entered: [5, 30, 50, 60, 90] Good-bye!

Entering -1 without any numbers: Requirements: Enter -1 to terminate enter numbers. You have to enter 3, or more, nonnegative numbers. Enter a number: -1 Good-bye! Entering an invalid number: Requirements: Enter -1 to terminate enter numbers. You have to enter 3, or more, nonnegative numbers. Enter a number: -4 Sorry, invalid number entered. Numbers must be nonnegative values. Enter another number: Entering less than 3 numbers: Requirements: Enter -1 to terminate enter numbers. - You have to enter 3, or more, nonnegative numbers. Enter a number: 30 Enter another number: 2 Enter another number: -1 Sorry, you didn't enter the required nonnegative numbers for processing. Good-bye! Entering the required numbers: Requirements: Enter -1 to terminate enter numbers. - You have to enter 3, or more, nonnegative numbers. Enter a number: 60 Enter another number: 30 Enter another number: 50 Enter another number: 90 Enter another number: 5 Enter another number: -1 Lowest: 5 Highest: 90 Average: 47.0 All numbers entered: [5, 30, 50, 60, 90] Good-bye!

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

Create an application that finds the greatest common divisor of two positive integers entered by the user. Console Greatest Common Divisor Finder Enter first number: 12 Enter second number: 8 Greatest common divisor: 4 Continue? (y/n): y Enter first number: 77 Enter second number: 33 Greatest common divisor: 11 Continue? (y/n): y Enter first number: 441 Enter second number: 252 Greatest common divisor: 63 Continue? (y/n): n Specifications The formula for finding the greatest common divisor of two positive integers x and y must follow the Euclidean algorithm as follows: Subtract x from y repeatedly until y < x. Swap the values of x and y. Repeat steps 1 and 2 until x = 0. y is the greatest common divisor of the two numbers. You can use one loop for step 1 of the algorithm nested within a second loop for step 3. Assume that the user will enter valid integers for both numbers. The application should continue only if the user enters 'y' or 'Y' to continue. Note that if you do…
Basak Taylan April 17, 2019 Question-1 1- Get a number from user. 2. If the number is not divisible by 5 then find out how much more you need so that number becomes divisible by 5. Print the result. Example-1: Enter a number: 3 We need to add 2 to 3 so that it will be divisible by 5 Example-2 Enter a number: 9 We need to andd to 9 wo ihat ivill be divistle by5 Question-2
Print "user_num1 is negative." if user_num1 is less than 0. End with newline. Assign user_num2 with 3 if user_num2 is greater than 13. Otherwise, print "user_num2 is less than or equal to 13.". End with newline.
int num1 = 10, num2 = 9, num3 = 18; num1
PS: Please answer number 3 to 5 altogether as they are both associated.
TPE: POLYNOMIAL MANAGEMENT -Evaluation of a polynomial (degree, coefficients, value) -Addition of two polynomials -Multiplication of two polynomials -Subtraction of two polynomials -Division of two polynomials NB: Each time the user must enter the degree and the coefficients of the polynomials concerned The report should contain: The algorithm The program The execution trace PLease explain your code in a step-wise manner. Thanks in advanced!
An ISBN (International Standard Book Number) is a 10 digit number that is used to identify a book. The first nine digits of the ISBN number are used to represent the Title, Publisher and Group of the book and the last digit is used for checking whether ISBN is correct or not. To uniquely identify a book a 10-digit ISBN number is used. The rightmost digit is checksum digit. This digit is determined from the other 9 digits using condition that 10d, + 9dz + 8dg + + d4o must be a multiple of 11 (where d, denotes the i" digit from the right). The checksum digit d; can be any value from 0 to 10: the ISBN convention is to use the value X to denote 10. Write a C program using pointers that receives a 10- digit ISBN, and computes the checksum, and reports whether the ISBN number is correct or not. Example: 007462542X = 10°0 + 9*0 + 8*7 + 74 + 6*6 + 5*2 + 4*5 + 3"4 + 2*2 + 110 = 176 Since 176 leaves no remainder when divided by 11, hence it is a valid ISBN. Note: When the check digit turns out…
18. Tom and Jerry opened a new lawn service. They provide three types of services: mowing, fertilizing, and planting trees. The cost of mowing is $35.00 per 5,000 square yards, fertilizing is $30.00 per application, and planting a tree is $50.00. Write an algorithm that prompts the user to enter the area of the lawn, the number of fertilizing applications, and the number of trees to be planted. The algorithm then determines the billing amount. (Assume that the user orders all three services.) (9)
Write a Case clause that specifies all numbers less than 0.
prime_check(n): """Return True if n is a prime number Else return False. """ if n <= 1: return False if n == 2 or n == 3: return True if n % 2 == 0 or n % 3 == 0: return False j = 5 while j * j <= n: if n % j == 0 or n % (j + 2) == 0: return False j += 6 return TrueFooter© 2023 GitHub, Inc.Footer navigationTermsPrivacy.
11 Worksheet 5 Note:Solution using Matlab Code Write a program that prompts the user to enter a number within the range of 1 through 7, those numbers represent the weekdays as shown in the table. If the entered number is more than 7, display 'invalid day'. Number 1 2 3 4 5 6 7 Day Sunday Monday Tuesday Wednesday Thursday Friday Saturday Type of the day Workday Workday Workday Workday Workday Weekend Weekend The program should continue to repeat itself 10 times, after which, the program should stop. Furthermore, the program should be able to show a message saying if this is a 'workday' or a 'weekend day'. Note: you are required to add a comment beside your command. Hint: to add a comment you may use the % sign. thank guys you dodo great.
It it a subset? Let C denote the set of all house cats. 1) ØC C is O True O False 2) How many cats does Ø have? O No cats! O O cats! Let E = {{1,2}} and let F = {0, E}. %3D 1) How many elements does E contain? 2) How many elements does F have? 3) Is E E F true? O Yes, it is true. O No, it is false. Neither, it is undefined.