Search

Solution Cart

Remove item Thumbnail image Product Price Quantity Subtotal
× The Collatz sequence is generated with the following algorithm. 1. Start with an integer n. 2. If n is even, divide by 2. 3. If n is odd, multiply by 3 and add 1. 4. Repeat this process with the new value of n, terminating when n = 1. For example, starting with n = 11, the following sequence of numbers will be generated: 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. Write a MIPS program that prompts the user to enter the starting value n and prints the Collatz sequence. An example run is shown below: Enter starting n = 22 Bonus: Implement a recursive version of the Collatz program without using any loops. 1 The Collatz sequence is generated with the following algorithm Start with an integer n If n is $5.00
$5.00
× Write a C++ program that asks the user to enter the coupon color and the haircut type (adult, kid) and then determine the haircut charge. It is possible that a customers may not have a coupon, in that case, no discount will be offered. You can assume that green, blue colors are represented using 1 and 2 respectively. Write the program so it will generate the output as shown in the sample runs below where user input is in bold. Without coupons adult haircut is 15.50 and the child haircut is 10.50. Sample Run 1 Enter coupon color(θ=no coupon,1=green,2=blue):1 Enter the type of haircut (a=adult ork=kid):a The charge is 12.00 Write a C++ program that asks the user to enter the coupon color and the haircut type (adult, kid) and then determine the haircut charge. $5.00
$5.00

Cart totals

Subtotal $10.00
Total $10.00

Free Worldwide shipping

On all orders above $50

Easy 30 days returns

30 days money back guarantee

International Warranty

Offered in the country of usage

100% Secure Checkout

PayPal / MasterCard / Visa