Practical no.

1g -- Write programs using conditional statements and loops:

i) Generate Fibonacci series:
Main()
{
num1=0;
num2=1;
temp;
print num1;
While(num2<100)
{

print num2;
temp=num1+num2;
num1=num2;
num2=temp;

}
}
ii) Generate patterns

for triangle shape(code 1)

Main()
{
int row,col;
for(row=1;row<=5;row++)
{
for(col=1;col<=row;col++)
Console.Write(col);
Console.WriteLine();
}
}
for triangle shape(code 2)
Main()
{
int row, col,space;
for (row = 1; row <= 5; row++)
{
for (space = 1; space <= 5 - row; space++)
Console.Write(" ");
for (col = 1; col <= row; col++)

Console.Write(col);
Console.WriteLine();
}
}

for triangle shape(code 3)

Main()
{
int row, space, col, revcol;
for (row = 1; row <= 5; row++)
{
for (space = 1; space <= 5 - row; space++)
Console.Write(" ");
for (col = 1; col <= row; col++)
Console.Write(col);
for (revcol = col - 2; revcol >= 1; revcol--)
Console.Write(revcol);
Console.WriteLine();
}
}

for diamond (code 1)

Main()
{
int row, space, col, revcol;
for (row = 1; row <= 5; row++)
{
for (space = 1; space <= 5 - row; space++)
Console.Write(" ");
for (col = 1; col <= row; col++)
Console.Write(col);
for (revcol = col - 2; revcol >= 1; revcol--)
Console.Write(revcol);
Console.WriteLine();
}
for (row = 4; row >= 1; row--)
{
for (space = 1; space <= 5 - row; space++)
Console.Write(" ");
for (col = 1; col <= row; col++)
Console.Write(col);
for (revcol = col - 2; revcol >= 1; revcol--)
Console.Write(revcol);
Console.WriteLine();

}
}

for diamond (code 2)

Main()
{
int row, space, col, revcol;
for (row = 1; row <= 5; row++)
{
for (space = 1; space <= 5 - row; space++)
Console.Write(" ");
for (col = 1; col <= row; col++)
Console.Write("*");
for (revcol = col - 2; revcol >= 1; revcol--)
Console.Write("*");
Console.WriteLine();
}
for (row = 4; row >= 1; row--)
{
for (space = 1; space <= 5 - row; space++)
Console.Write(" ");
for (col = 1; col <= row; col++)
Console.Write("*");
for (revcol = col - 2; revcol >= 1; revcol--)
Console.Write("*");
Console.WriteLine();
}
}

iii) Testing Prime numbers:

Main()
{
int n, i, flag = 0;
Console.WriteLine("Enter a positive number");
n = int.Parse(Console.ReadLine());
for (i = 2; i <= n / 2; ++i)
{
if (n % i == 0)
{
flag = 1;
break;
}
}
if (flag == 0)
Console.WriteLine("This is a prime number");
else
Console.WriteLine("This is not a prime number");

iv)Generate prime numbers

Main()
{
int counter, low, up, num;
Console.Write("Enter lowerlimit:");
low = int.Parse(Console.ReadLine());
Console.Write("Enter upperlimit:");
up = int.Parse(Console.ReadLine());
Console.WriteLine("Prime number between " + low + "and " + up + "are ");
for (num = low; num <= up; num++)

{
for (counter = 2; counter <= num / 2; counter++)
{
if ((num % 2) == 0)
break;
}
if (num == 1)
Console.WriteLine(num + "is neither prime nor composite");
else if (counter >= (num / 2))
Console.WriteLine(num);
}
Console.WriteLine();
}

v) Reverse a number and find sum of digits of a number

Main()
{
int num, actualnumber, revnum = 0, digit, sumDigits = 0;
Console.Write("Enter number:");
num = int.Parse(Console.ReadLine());
actualnumber = num;
while (num > 0)
{
digit = num % 10;
revnum = revnum * 10 + digit;
num = num / 10;
sumDigits = sumDigits + digit;
}
Console.WriteLine("Reverse of " + actualnumber + "=" + revnum);

Console.WriteLine("Sum of its digits:" + sumDigits);

}

vi)Test for vowels.

Main()
{
char ch;
Console.Write("Enter a character : ");
ch = (char)Console.Read();
switch (ch)
{
case 'a':
case 'A':
case 'e':
case 'E':
case 'i':
case 'I':
case 'o':
case 'O':
case 'u':
case 'U':
Console.WriteLine(ch + "is vowel");
break;
default:
Console.Write(ch + "is not a vowel");
break;
}
Console.ReadLine();
}

vii) Use of foreach loop with arrays.

Main()
{
string[] str = { "BCOM", "BA", "BSCIT" };
foreach (String s in str)
Console.WriteLine(s);
}