PYTHON CHALLENGE ACTIVITY6.7.2: Function with branch: Popcorn. Define function print_popcorn_time() with parameter bag_ounces. If bag_ounces is less than 3, print "Too small". If greater than 10, print "Too large". Otherwise, compute and print 6 * bag_ounces followed by "seconds". End with a newline. Remember that print() automatically adds a newline.Sample output with input: 742 seconds ''' Your solution goes here '''user_ounces = int(input())print_popcorn_time(user_ounces) CHALLENGE 6.7.2: Function with branch: Popcorn.ACTIVITYDefine function print_popcorn_time() with parameter bag_ounces. If bag_ounces is less than 3, print "Too small". If greater than 10,print "Too large". Otherwise, compute and print 6 * bag_ounces followed by "seconds". End with a newline. Remember that print()automatically adds a newline.Sample output with input: 742 seconds391908.2626244.qx3zqy712Your solution goes here34 user_ounces = int(input())5 print_popcorn_time(user_ounces)1 testpassedAll testspassed

Herecour task is to write a python program for the task mentioned in the question. Let's prepare the…

Define function print_popcorn_time() with parameter bag_ounces. If bag_ounces is less than 3, print "Too small". If greater than 10, print "Too large". Otherwise, compute and print 6 * bag_ounces followed by "seconds". End with a newline. Remember that print() automatically adds a newline. Sample output with input: 742 seconds ''' Your solution goes here ''' user_ounces = int(input()) print_popcorn_time(user_ounces)

Define function print_popcorn_time() with parameter bag_ounces. If bag_ounces is less than 3, print "Too small". If greater than 10, print "Too large". Otherwise, compute and print 6 * bag_ounces followed by "seconds". End with a newline. Remember that print() automatically adds a newline. Sample output with input: 742 seconds ''' Your solution goes here ''' user_ounces = int(input()) print_popcorn_time(user_ounces)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

13. Implement function triangleArea(a,b,c) that takes as input the lengths of the 3 sides of a triangle and returns the area of the triangle. By Heron's formula, the area of atriangle with side lengths a, b, and c is √ s ( s−a )( s−b)( s−c ) , where s=(a+b+ c )/ 2 .>>> triangleArea(2,2,2)1.7320508075688772
Implement the FindText() function, which has two strings as parameters. The first parameter is the text to be found in the user provided sample text, and the second parameter is the user provided sample text. The function returns the number of instances a word or phrase is found in the string. In the PrintMenu() function, prompt the user for a word or phrase to be found and then call FindText() in the PrintMenu() function. Before the prompt, call cin.ignore() to allow the user to input a new string.Ex: Enter a word or phrase to be found: more "more" instances: 5
Q2: Write aprogram in CT' using OOP to create a class (A) , that contain the iöllowingIUnction:— (drawl) to drawa line Of Stars (Then create a class (B) , with public visibility mode inherit from class (A) ,contain the following function:(draw2) to draw the shape bellow using the tilnction (drawl),
Implement a function named root_sum which receive an integer and return the result of summing all the scare roots from 1 to the number passed in. For example, if the argument is 4, then the function returns 6.15 because √4 + √3 + √2 + √1 = 6.15. It doesn't need to print (√4 + √3 + √2 + √1 = 6.15), in fact the function shouldn't print anything, just return the final value, in this case 6.15. You may assume that #include <cmath> has already been included and you have access to the sqrt() function, which takes a single double or any value that can be converted to a double and returns that value's square root as a double. No error checking is necessary. Assume the user always passed in a value > 1. In c++ program
Write the C equivalent “train” function #void train(int*A, int*B, int*C, int k) train: add $t4, $0, $0bus: add $t5, $t4, $a1 lw $t6, 0($t5) add $t5, $t4, $a2 lw $t7, 0($t5) add $t6, $t6, $t7 add $t5, $t4, $a0 sw $t6, 0($t5) addi $t4, $t4, 4 slt $t5, $t4, a3 bne $t5, $0, bus jr ra
Implement the design of the Student_Tutor class that inherit from Student class so that the following code generates the output below:Hint: Each room has a capacity of 2 Student tutors.class Student: def __init__(self,name,student_id): self.name = name self.student_id = student_id self.semester = "Spring 2022" def details(self): print("Name:",self.name) print("Student_ID:",self.student_id) print("Current Semester:",self.semester)# Write your code here:STs = []S1 = Student("Reem", 18101235)S1.details()print("1.======================================")ST1 = Student_Tutor("Moynul", 16107892, 35, "CSE110", "CSE111")ST2 = Student_Tutor("Priyo", 16107792, 25,"CSE320")ST3 = Student_Tutor("Ronok", 18207892, 36, "CSE110", "CSE111", "CSE221", "CSE220")ST4 = Student_Tutor("Zeba", 19307892, 48, "CSE110")STs.extend([ST1, ST2, ST3, ST4])print("2.======================================")for i in range(len(STs)): STs[i].details()…
12. Consider the recursive function int gcd( int a, int b) int gcd( int a, int b){ if (b > a) return gcd(b,a); if ( b == 0 ) return a; return gcd( b, a% b); } How many invocation (calls) of the gcd() function will be made by the call gcd(72, 30)?
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Implement the sieve of Eratosthenes: a function for computing prime numbers, known to the ancient Greeks. Choose an integer n. This function will compute all prime numbers up to, and including, n. First insert all numbers from 1 to n into a set. Then erase all multiples of 2 (except 2); that is, 4, 6, 8, 10, 12, ... . Erase all multiples of 3, that is, 6, 9, 12, 15, ... . Go up to ?⎯⎯√n. The remaining numbers are all primes. Make sure that you use functions in your solution, including a main function. Define def sieveOfEratosthenes(n) that receives the maximum value and returns a list of all prime numbers less than or equal to this value in main() print the list of prime numbers.
Write a recursive function int fib (int n) to compute the Fibonacci numbers where n is a positive integer.Write an application (main() function) using command line parameters that calls fib(n) and outputs n,fin(n), fib(n)*1.0/fib(n-1) for n = 3,4,5,6,7,8,9,10,11,12,13,14,15In a format fprintf (stdout,“n = %d\tfib(n) = %d\tfib(n)/fib(n-1) = %.4f\n”, n, fib(n), fib(n)*1.0/fib(n-1))The ratio of fib(n) to fib(n-1) for large values of n (larger than say 10) is called the golden ratio.Plot a curve between n and golden ratio.Submit the assignment by dropping the MS word file containing the program code, results (take a screenshot of the Cygwin/ubantu) and paste to the word file in C
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.
Can you help me fix my code because the total sum per item does not show in the receipt and when choosing to perform another transaction, the input for the customer's name and the number of items overlaps as seen in the image below. package cashier; import java.util.Scanner; class List { Scanner sc = new Scanner(System.in);private String name;private int item;private int[] des;private double price;private int[] quan;private double total;private double sum; public List(String name, int item, int[] des, double total, int[] quan, double sum) {this.name = name;this.item = item;this.des = des;this.quan = quan;this.total = total;this.sum = sum;}public void Input() {System.out.print("\n Enter name of customer: ");name = sc.nextLine();System.out.print(" Enter number of items: ");item = sc.nextInt();des = new int[item];quan = new int[item];total = 0; for (int i = 0; i < item; i++) {System.out.print("\n Enter item code: ");des[i] = sc.nextInt();for (int j = 0; j < item; j++) {if…