amateur in computer science any idea how to go about solving this? Part A – Implement a change maker program. This program will calculate the correct change from a dollar for the purchase of an item that costs between 0 and 100 cents. The amount of change must be optimal in that you should make maximum use of the largest available coins Example Scenarios: How much is your item (in cents)? >> 65Your change is: 1 quarter, 1 dime, 0 nickels, and 0 pennies How much is your item (in cents)? >> 43 centsYour change is: 2 quarter, 0 dime, 1 nickels, and 2 pennies Part B – Write a program that prompts for an input string of variable length. Once input, your program will do the following:Output the length of the stringOutput the first and last characters of the stringOutput the middle character of the string (and its position)Transpose (switch) the two halves; 2nd half starts with the middle character.Print the string out in all upper case characters Example Sessions: Please input a string :>> Firewall Program Output:String length is: 8 First char is: F Last char is: l Middle char at position 4 is: w Transpose: wallFire Upper Case: FIREWALL Please input a string :>> Program Program Output:String length is: 7 First char is: P Last char is: m Middle char at position 3 is: g Transpose: gramPro Upper Case: PROGRAM Note that your program needs to correctly calculate and output all the items listed. It should also be able to handle any string that is input during testing—not just the examples presented here. You may assume the string will have at least two (2) characters.

Note: - As per the guidelines we can only answer one specific question at a time as they are two…

Answered: amateur in computer science any idea…

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 12RP

See similar textbooks

Related questions

Concept explainers

Question

100%

amateur in computer science any idea how to go about solving this?

Part A – Implement a change maker program. This program will calculate the correct change from a dollar for the purchase of an item that costs between 0 and 100 cents. The amount of change must be optimal in that you should make maximum use of the largest available coins

Example Scenarios:

How much is your item (in cents)? >> 65

Your change is: 1 quarter, 1 dime, 0 nickels, and 0 pennies

How much is your item (in cents)? >> 43 cents

Your change is: 2 quarter, 0 dime, 1 nickels, and 2 pennies

Part B – Write a program that prompts for an input string of variable length. Once input, your program will do the following:

Output the length of the string
Output the first and last characters of the string
Output the middle character of the string (and its position)
Transpose (switch) the two halves; 2^nd half starts with the middle character.
Print the string out in all upper case characters

Example Sessions:

Please input a string :>> Firewall

Program Output:

String length is: 8

First char is: F

Last char is: l

Middle char at position 4 is: w

Transpose: wallFire

Upper Case: FIREWALL

Please input a string :>> Program

Program Output:

String length is: 7

First char is: P

Last char is: m

Middle char at position 3 is: g

Transpose: gramPro

Upper Case: PROGRAM

Note that your program needs to correctly calculate and output all the items listed. It should also be able to handle any string that is input during testing—not just the examples presented here. You may assume the string will have at least two (2) characters.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.