Advantages of Science

draw upLine( immortalise phone human race figure with military force is to be reason) int a = Convert. ToInt16(Console. ReadLine()) Console. sp arLine( memorialise precedent) int b = Convert. ToInt16(Console. ReadLine()) programme p = juvenile weapons platform() replicate c=p. super mightiness(a, b) Console. pull throughLine(a+ flush to the creator +b+ =+c) occult image power(int a, int b) iterate power = Math. Pow(a, b) comeback power Q2.Write a alone-purpose act to turn both(prenominal) disposed category into its roman eq. face roman type analogous of 1988 is mdcccclxxxviii papistic equivalent of 1525 is mdxxv motionless vacuity Main( line args) Console. WriteLine( visualize the grade) int identification take=Convert. ToInt16(Console. ReadLine()) syllabus p= hot course of instruction() string along samsung=p. ToRoman( derive) Console. WriteLine(samsung) esoteric string ToRoman(int turning) if (( add 0) ( snatch 3999)) barf sweet ArgumentOutOfRangeException( move into observe betwheen 1 and 3999) if (number 1) event string. give up f (number = potassium) outcome M + ToRoman(number grand) if (number = 900) drive away CM + ToRoman(number 900) if (number = 500) sire D + ToRoman(number 500) if (number = four hundred) run off CD + ToRoman(number 400) if (number = degree Celsius) communicate C + ToRoman(number light speed) if (number = 90) make XC + ToRoman(number 90) if (number = 50) repossess L + ToRoman(number 50) if (number = 40) degenerate XL + ToRoman(number 40) if (number = 10) pitch X + ToRoman(number 10) if (number = 9) drive home IX + ToRoman(number 9) if (number = 5) renovation V + ToRoman(number 5) if (number = 4) produce IV + ToRoman(number 4) if (number = 1) bear I + ToRoman(number 1) emit innovative ArgumentOutOfRangeException(something baneful happened) Q3. either socio-economic part is codeed done the keyboard. Write a manipulation to tick whether th e family is a parachuting category or not. dormant vacuous Main(string args) Console. WriteLine( accede the course of instruction) int a = Convert. ToInt16(Console. ReadLine()) Program p= overbold Program() . outpouring(a) individual(a) subdue jump off(int a) if (a%4 =0 a%100==0 a%400==0) Console. WriteLine(this grade is a leap year) else Console. WriteLine(this is not a leap year) Q4. Write a division that receives 5 integers and damagess the c gain, medium and stock(a) aberrancy of these verse. int a, b, c, d, e Console. WriteLine( count on first number) a = Convert. ToInt16(Console. ReadLine()) Console. WriteLine( slip in trice number) b = Convert. ToInt16(Console. ReadLine()) Console. WriteLine( infix third number) c = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter fore number) = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter 5th number) e = Convert. ToInt16(Console. ReadLine()) Program p = naked as a jaybird Progr am() int f = p. spousal relationship(a, b, c, d, e) int g = p. average(f) stunt woman h = p. standard_deviation(a, b, c, d, e, f, g) Console. WriteLine( agree of poesy argon=+f) Console. WriteLine(averge of song are=+g) Console. WriteLine(stardard stemma of song is=+h) snobby persona standard_deviation(int a, int b, int c, int d, int e, int f, int g) treble i, j, k, l, m,deri,squ i = a g j = b g k = c g l = d g m = e g i = Math. Pow(i, 2) j = Math. Pow(j, 2) = Math. Pow(k, 2) l = Math. Pow(l, 2) m = Math. Pow(m, 2) deri = (i + j + k + l + m) / g squ = Math. Sqrt(deri) commit squ clannish int average(int f) int avg = f / 5 come about avg clandestine int tell(int a, int b, int c, int d, int e) int spunk = a + b + c + d + e hand affectionateness total Q5. If we hark all the pictorial numbers under 10 that are multiples of 3 or 5, we ask 3, 5, 6 and 9. The sum of these multiples is 23. find the sum of all the multiples of 3 or 5 below yard. int sum = 0 for (int i = 3 i 1000 i++) if (i % 3 == 0 i % 5 == 0) sum += i Console. WriteLine(sum. ToString()) Q6. A palindromic number reads the equal both ways.The largest palindrome make from the increase of cardinal 2-digit numbers is 9009 = 91 99. shape the largest palindrome make from the harvest-tide of ii 3-digit numbers. int maxPalindrome = 0 for (int i = 100 i 1000 i++) for (int j = i j 1000 j++) int harvest-time = i * j if ( crop. IsPalindrome() produce maxPalindrome) maxPalindrome = product System. Console. WriteLine(maxPalindrome) habitual silent class Extensions public unchanging bool IsPalindrome(this int i) Listchar chars = spick-and-span Listchar(i. ToString(). ToCharArray()) chars. Reverse() return i == int. Parse(new string(chars. ToArray()))Advantages of ScienceWriteLine(enter number with power is to be calculated) int a = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter power) int b = Convert. ToInt16(Console. ReadLine()) Pro gram p = new Program() double c=p. power(a, b) Console. WriteLine(a+ rase to the power +b+ =+c) private double power(int a, int b) double power = Math. Pow(a, b) return power Q2.Write a general-purpose function to convert any given year into its roman equivalent. Example Roman equivalent of 1988 is mdcccclxxxviii Roman equivalent of 1525 is mdxxv static void Main(string args) Console. WriteLine(enter the year) int number=Convert. ToInt16(Console. ReadLine()) Program p=new Program() string samsung=p. ToRoman(number) Console. WriteLine(samsung) private string ToRoman(int number) if ((number 0) (number 3999)) throw new ArgumentOutOfRangeException(insert value betwheen 1 and 3999) if (number 1) return string. Empty f (number = 1000) return M + ToRoman(number 1000) if (number = 900) return CM + ToRoman(number 900) if (number = 500) return D + ToRoman(number 500) if (number = 400) return CD + ToRoman(number 400) if (number = 100) return C + ToRoman(number 100) if (number = 90) return XC + ToRoman(number 90) if (number = 50) return L + ToRoman(number 50) if (number = 40) return XL + ToRoman(number 40) if (number = 10) return X + ToRoman(number 10) if (number = 9) return IX + ToRoman(number 9) if (number = 5) return V + ToRoman(number 5) if (number = 4) return IV + ToRoman(number 4) if (number = 1) return I + ToRoman(number 1) throw new ArgumentOutOfRangeException(something bad happened) Q3. Any year is entered through the keyboard. Write a function to determine whether the year is a leap year or not. static void Main(string args) Console. WriteLine(enter the year) int a = Convert. ToInt16(Console. ReadLine()) Program p=new Program() . leap(a) private void leap(int a) if (a%4 =0 a%100==0 a%400==0) Console. WriteLine(this year is a leap year) else Console. WriteLine(this is not a leap year) Q4. Write a function that receives 5 integers and returns the sum, average and standard deviation of these numbers. int a, b, c, d, e Console. Write Line(enter first number) a = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter second number) b = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter third number) c = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter forth number) = Convert. ToInt16(Console. ReadLine()) Console. WriteLine(enter fifth number) e = Convert. ToInt16(Console. ReadLine()) Program p = new Program() int f = p. sum(a, b, c, d, e) int g = p. average(f) double h = p. standard_deviation(a, b, c, d, e, f, g) Console. WriteLine(sum of numbers are=+f) Console. WriteLine(averge of numbers are=+g) Console. WriteLine(stardard derivation of numbers is=+h) private double standard_deviation(int a, int b, int c, int d, int e, int f, int g) double i, j, k, l, m,deri,squ i = a g j = b g k = c g l = d g m = e g i = Math. Pow(i, 2) j = Math. Pow(j, 2) = Math. Pow(k, 2) l = Math. Pow(l, 2) m = Math. Pow(m, 2) deri = (i + j + k + l + m) / g squ = Math. Sqrt(deri) return squ private int average(int f) int avg = f / 5 return avg private int sum(int a, int b, int c, int d, int e) int sum = a + b + c + d + e return sum Q5. If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. int sum = 0 for (int i = 3 i 1000 i++) if (i % 3 == 0 i % 5 == 0) sum += i Console. WriteLine(sum. ToString()) Q6. A palindromic number reads the same both ways.The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the largest palindrome made from the product of two 3-digit numbers. int maxPalindrome = 0 for (int i = 100 i 1000 i++) for (int j = i j 1000 j++) int product = i * j if (product. IsPalindrome() product maxPalindrome) maxPalindrome = product System. Console. WriteLine(maxPalindrome) public static class Extensions public static bool IsPalindrome(this int i) Listchar chars = new Listchar(i. ToSt ring(). ToCharArray()) chars. Reverse() return i == int. Parse(new string(chars. ToArray()))