Basic C# Simple Programs for Interview

Hi Friends this time I am sharing you a very simple basic programs that generally asked at the time of interview. I used to ask it sometimes very simple programs. We know that we can make it out that program but in interview time if you know how to do that then you can make it out very easily and make a face that you are thinking about it. But you know already. and write it after some moments. So just take a look before the interview.

Program 1: Return Vowel of Not. Solution.

public bool CheckVowel(object sender,KeyEventArgs e)
{
if(e.KeyCode ==Keys.A||e.KeyCode ==Keys.E||e.KeyCode ==Keys.I||e.KeyCode ==Keys.O||e.KeyCode ==Keys.U)
{
return true;
}
else
return false;
}

Program 2: Even or Odd Solution.

public string EvenOrOdd( int Num)
{
if(num%2 ==0)
retrun "evenNumber";
else
return "OddNumber"
}

Program 3: Prime Number Solution.

public string PrimeOrNot(int num)
{
int i = 0;
for (i = 3; i < num; i++)
{
if (num % i == 0)
{
Console.WriteLine("{0} is not a prime number", num);
break;
}
}
if (i == num)
{
Console.Writeline("{0} is a prime Number", num);
}
}

Program 4: Fibonacci Series Solution.

public void FibonacciSeries(int number)
{
int f_0 = 0;
int f_1 = 1;
int sum;
Console.Write("{0} {1} ", f_0, f_1);
for (int i = 2; i < number; i++)
{
sum = f_0 + f_1;
f_0 = f_1;
f_1 = sum;
int value = f_0 + f_1;
Console.Write("{0} ", value);
}
}

Program 5: Factorial Solution.

public int Factorial(int number)
{
int value = 1;
for (int i = 1; i <= number; i++)
{
value = value * i;
}
return value;
}

Program 6: Permutation (nPr) Solution.

Reference Solution 5

public double Permutation(int n, int r)
{
double nPr = Factorial(n) / Factorial(n - r);
return nPr;
}

Program 7: Combination (nCr) Solution.

Reference Solution 5

public double Combination(int n , int r)
{
double nCr = Factorial(n)/Factorial(r)*(Factorial(n-r);
return nCr;
}

Program 8: Add two numbers without using the plus operator Solution.

public int Add (int x , int y )
{
return x-(-y);
}

Program 9: Multiply two numbers without usering * operator Solution.

public int MulWithOutStarOperator( int x ,int y)
{
for(int z= 1 ; z<=y ; z++)
{
int value = value +x;
}
return value;
}

6 Comments

Join the conversation! Your thoughts help the community grow.

appalanaidu valle8y ago
We don't required val variable declaration within for loop in Fibonacci, you can use the sum variable instead val new declaration.
appalanaidu valle8y ago
Below is the simplest prime number check method
appalanaidu valle8y ago
Static bool PrimeOrNot(int number) { bool isPrime = true; for (int i = 2; i < number; i++) { if (number % i == 0) { isPrime = false; break; } } return isPrime; }
Nadeem Shaikh8y ago
The last one "MulWithOutStarOperator" needs correction. int value should be out of for loop.
Guest User8y ago
The Fibonacci program outputs: 0 1 2 3 5 8 instead of 0 1 1 2 3 5 8, it needs to be changed as: for (int i = 2; i < number; i++) { int value = f_0 + f_1; sum = f_0 + f_1; f_0 = f_1; f_1 = sum; Console.Write("{0} ", value); }
Sagar Pandurang Kap8y ago
Amazing article.Very much helpful.Thanks a lott.