I want to solve these questions using C# , Please !!!
*************** *************** *************** *************** *
1- The factorial method is used frequently in probability problems. The factorial of a positive
integer n (written n! and pronounced “n factorial”) is equal to the product of the positive integers from
1 to n. Write a program that evaluates the factorials of the integers from 1 to 20 with different integer
data types. Display the results in a three-column output table. [Hint: create a Windows application,
using Labels as the columns and the '\n' character to line up rows.] The first column should display
the n values (1-20). The second column should display n!, calculated with int (Int32, a 32-
bit integer value). The third column should display n!, calculated with long (Int64, a 64-bit integer
value). What happens when int (Int32) is too small in size to hold the result of a factorial calculation?
2- Write two programs that each print a table of the binary, octal, and hexadecimal equivalents
of the decimal numbers in the range 1–256. If you are not familiar with these number systems, read
Appendix C, Number Systems, first.
a) For the first program, print the results to the console without using any string formats.
b) For the second program, print the results to the console using both the decimal and hexadecimal
string formats (there are no formats for binary and octal in C#).
(Pythagorean Triples) A right triangle can have sides that are all integers. A set of three integer
values for the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy
the relationship that the sum of the squares of the two sides is equal to the square of the
hypotenuse. Write a program to find all Pythagorean triples for side1, side2 and hypotenuse,
none larger than 30. Use a triple-nested for loop that tries all possibilities. This is an example of
“brute force” computing. You will learn in more advanced computer science courses that there are
several problems for which there is no other known algorithmic approach.
*
***
*****
*******
*********
*******
*****
***
*
4- http://www.uploading.c om/en/files/AO7LQ2SC/untitled.bmp.ht ml
and please set the comments for every statement to make me understand the codes and this give a chance to success
please i want the answers today or tomorrow
*************** *************** *************** *************** *
1- The factorial method is used frequently in probability problems. The factorial of a positive
integer n (written n! and pronounced “n factorial”) is equal to the product of the positive integers from
1 to n. Write a program that evaluates the factorials of the integers from 1 to 20 with different integer
data types. Display the results in a three-column output table. [Hint: create a Windows application,
using Labels as the columns and the '\n' character to line up rows.] The first column should display
the n values (1-20). The second column should display n!, calculated with int (Int32, a 32-
bit integer value). The third column should display n!, calculated with long (Int64, a 64-bit integer
value). What happens when int (Int32) is too small in size to hold the result of a factorial calculation?
2- Write two programs that each print a table of the binary, octal, and hexadecimal equivalents
of the decimal numbers in the range 1–256. If you are not familiar with these number systems, read
Appendix C, Number Systems, first.
a) For the first program, print the results to the console without using any string formats.
b) For the second program, print the results to the console using both the decimal and hexadecimal
string formats (there are no formats for binary and octal in C#).
(Pythagorean Triples) A right triangle can have sides that are all integers. A set of three integer
values for the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy
the relationship that the sum of the squares of the two sides is equal to the square of the
hypotenuse. Write a program to find all Pythagorean triples for side1, side2 and hypotenuse,
none larger than 30. Use a triple-nested for loop that tries all possibilities. This is an example of
“brute force” computing. You will learn in more advanced computer science courses that there are
several problems for which there is no other known algorithmic approach.
*
***
*****
*******
*********
*******
*****
***
*
4- http://www.uploading.c om/en/files/AO7LQ2SC/untitled.bmp.ht ml
and please set the comments for every statement to make me understand the codes and this give a chance to success
please i want the answers today or tomorrow
Comment