Due Monday, December 18 at Midnight
Permutations/Combinations (50 PTS) 1. We are going to write a little program to enumerate the number of subsets of a set with particular properties. Assume you have a set with n distinct objects.
n! = n(n-1)(n-2)(n-3) .... 1
A Relatively Simple Calculator (50 PTS) 2. You need to create an integer calculator with
You DO NOT NEED to have parentheses or deal with complicated calculations.
A user should be able to put numbers into the textboxes and then press the button for what operation they want performed. Then these two numbers will be used to perform the calculation and display the result in the third textbox.
You need the appropriate error trapping in case the user leaves entries blank or they are non-integer.
You need to write a separate method for each type of calculation.
I assume just doing this much will give you a sense of what would be involved in making it more realistic!