Searching...
16 Jan 2014

C# Program to solve different problems

08.45
C# Program to solve different problems

Program Statement:
Write a program which will take input a character ‘a’ value from user. You have to use switch statement to decide if value of a is ‘t’ then you have to call table function, if value of a is ‘f’ then call factorial function, if value of a is ‘p’ then call prime function, if value of a is ‘s’ then call search function.
You have to write four functions in your program;
Table(int n1,n2)
Factorial(int n3)
Prime(int n4)
Search(char n5[], char c, char choice)
Table function will print the table of n1 from 1 to n2.
Factorial function will print the factorial of n3 if n3 is multiple of 2.
Prime function will print the n4 if n4 is prime.
Search function will take first argument n5 as an array of characters and second element a character to be search in the array and third element a character to decide which searching algorithm to be used.i.e. if user has passed the value of c as ‘s’ then Search function will perform the sequential search but if value of c is something else then Search function will perform binary search.
Structure of your program will be like this. You have to make it exactly working.
Switch(a)
{
case ‘f’:
factorial();
break;
case ‘p’:
prime();
break;
case ‘t’:
table();
break;
case ‘s’:
search();
break;
}

Solution:
 class functions
{
public int fact = 1;
public void factorial(int n3)
{
if (n3 % 2 == 0)
{
for (int i = 1; i <= n3; i++)
{
fact = fact * i;
}
Console.WriteLine("\n\t\tFactorial is : {0}\n\n", fact);
}
else
{
Console.WriteLine("\n\t\tIts not multiple of 2!\n\t\t");
}
}
public void prime(int n4)
{
int i = 2;

if (n4 == 1)
{
Console.WriteLine("Number is not prime!");
}
for (i = 2; i <= n4 - 1; i++)
{
if (n4 % i == 0)
{
Console.WriteLine("Number is not prime!");
break;
}
}
if (n4 == i)
{
Console.WriteLine("{0} is a prime number!", n4);
}
}
public void table(int n1, int n2)
{

for (int i = 1; i <= n2; i++)
{
Console.WriteLine("{0} * {1} = {2}", n1, i, n1 * i);
}
}
public void search(char[] array, char s)
{
int p = 0;
foreach (char c in array)
{
if (c == s)
{
Console.WriteLine("Character {0} found!", c);
p++;
break;
}
}
if (p == 0)
Console.WriteLine("character not found.");
}
}


0 komentar:

Posting Komentar