Introduction

After a brief lull, its time to create yet another Mathinator!

This lab assignment isnt particularly difficult, but provides a good opportunity to develop an algorithm using the control structures were studying in Chapters 5 and 6. Youll also get a chance to further develop your pseudocoding skills.

Assignment & Discussion

Your task in Lab 6 is to prompt for and get five (5) integers from a user. Once you have the five integers, you are to sum the numbers, calculate the average and write both sum and average back out to the user. But thats not all! You should also tell the user what the largest and smallest numbers entered were.

Develop your algorithm using pseudocode and then implement your algorithm in a C# application. Spoiler Alert you have to turn your pseudocode in! See Chapter 5 if you have lingering questions on pseudocoding. Resist the temptation to reverse engineer your pseudocode!

I recommend you think carefully about the selection and repetition structures were studied in chapters 5 and 6 and how you can use them to solve this programming challenge. Also consider how you can nest these structures to develop your algorithm.

Requirements

Pseudocode

Develop your pseudocode in MS Word using Calibri 11 and Normal spacing.

Include your name, section (ex. CSCI 1301A) and submission date at the top of your pseudocode file.

Your pseudocode file should be named using the following convention: LastName_Programming_Assignment_6

Ensure your name, section (CSCI 1301CD) and date are at the top of your pseudocode.

Follow Chapter 5 and lecture guidance for pseudocode.

Include, at a minimum, one selection and one iteration structure in your algorithm. (This part is very important)

Application

Your C# application shall be implemented in one file.

Your file and class should be named MyMathinatorPlus. There will be a 5% penalty for not naming your file correctly.

Your namespace should be Programming_Assignment_6.

Implement, at a minimum, one selection and one iteration structure in your application.