Q1/ Find other useful methods of array class.

Solution:
1)
string[] n={"Ali","Abdulrahim","Ismail"};

bool a=Array.Exists(n,element=>element=="Ali");
bool b=Array.Exists(n,element=>element=="Mostafa");
bool c=Array.Exists(n,element=>element.StartsWith("A"));
bool d=Array.Exists(n,element=>element.StartsWith("i"));
Console.WriteLine(a);
Console.WriteLine(b);
Console.WriteLine(c);
Console.WriteLine(d);
Console.Read();

Output

True

False

True

False

2)
int[] n={10,12,13,4,6,5,8,1};
int a,b,c;
a=Array.IndexOf(n,4);
b=Array.IndexOf(n,13);
c=Array.IndexOf(n,1);

Console.WriteLine(a);
Console.WriteLine(b);
Console.WriteLine(c);
Console.Read();

Output

3)
string[] array={"a","e","m","n","x","z"};
int a,b,c;
a=Array.BinarySearch(array,"m");
b=Array.BinarySearch<string>(array,"x");
c=Array.BinarySearch<string>(array,"e");
Console.WriteLine(a);
Console.WriteLine(b);
Console.WriteLine(c);
Console.Read();

Output

1
4)
Int []a={10,12,13,4,6,5,8,1};
int []b={1,2,3,4,5,6,7,8};
Array.Copy(b,a,4);
for(int i=0;i<a.Length;i++)
Console.WriteLine(" " +a[i]);
Console.Read();

Output

_________________________________________________________________________________________

5)
int[]a={10,12,13,4,6,5,8,1};
Array.Reverse(a);
for(int i=0;i<a.Length;i++)
Console.WriteLine(" " +a[i]);
Console.Read();

Output

13

12

10

6)
int[]a={10,12,13,4,6,5,8,1};
Array.Resize(ref a,3);
for(int i=0;i<a.Length;i++)
Console.WriteLine(" " +a[i]);
Console.Read();

Output

10

12

13
7)
int[]a={10,12,13,4,6,5,8,1};

Array.AsReadOnly(a);

for(int i=0;i<a.Length;i++)
Console.WriteLine(" " +a[i]);
Console.Read();

output

10

12

13

8)

int []a={10,12,13,4,6,5,8,1};

Array.Clear(a,0,6);
for(int i=0;i<a.Length;i++)
Console.WriteLine(" "+a[i]);
Console.Read();

Output

1
9)
int[]a={10,12,13,4,6,5,8,1};
Array.sort(a);
for(inti=0;i<a.Length;i++)
Console.WriteLine(" " +a[i]);
Console.Read();

Output

10

12

13

Q2) Write a C# Program to Reverse an Array of (30) elements.

Solution:-
int[]a={1,4,6,8,4,9,7,4,3,2,1,6,8,3,2,4,6,9,0,4,5,7,11,45,23,45,67,5 };
Array.Reverse(a);
for (inti=0;i<a.Length;i++)
Console.WriteLine(" "+a[i]);
Console.Read();
Q3) Write a C# program to sort an array of elements without using "Array.Sort".

Solution:-
int i,j,temp=0;
int[]a=new int[10];
for(i=0;i<10;i++)
{
a[i]=Int32.Parse(Console.ReadLine());
if(a[i]==0)
break;
}
for(i=0;i<10;i++)
{
for(j=1+1;j<10;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
for(i=0;i<10;i++)
{
Console.WriteLine(a[i]);
}
Console.Read();
Q4) Draw this Graph by using (for Loop).

Solition:
int i,j;
for(i=0;i<=5;i++)
{
for(j=0;j<=i;j++)
Console.Write("*");
for(j=5;j>=i;j--)
Console.Write(" ");
for(j=5;j>=i;j--)
Console.Write("*");
for(j=0;j<=i;j++)
Console.Write(" ");
for(j=0;j<= i;j++)
Console.Write(" ");
for(j=5;j>=i;j--)
Console.Write("*");
for(j=5;j>=i;j--)
Console.Write(" ");
for(j=0;j<=i;j++)
Console.Write("*");
Console.WriteLine("");
}

Console.Read();
Q5 ) Draw This graph by Using (For Loop).

Solution: "First Method"

int n=3,i,j;
for(i=0;i<=2*n;i++)
{
for (j=0;j<=2*n;j++)
if (i<=n)
if(j<n-i || j>n+i)
Console.Write(" ");
else
Console.Write("*");
else
if(j<i-n || j>3*n-i)
Console.Write(" ");
else
Console.Write("*");
Console.Write("\n");
}
Console.Read();

Solution: "Second Method"

int i,j,n=3;

for(i=0;i<n;i++)
{
for(j=n;j>i;j--)
Console.Write(" ");
for(j=0;j<i;j++)
Console.Write("*");
for(j=0;j<=i;j++)
Console.Write("*");
Console.Write("\n");
}
for(i=0;i<=n;i++)
{
for(j=0;j<i;j++)
Console.Write(" ");
for(j=n;j>i;j--)
Console.Write("*");
for(j= n;j>=i;j--)
Console.Write("*");
Console.WriteLine("");
}
Console.Read();
alawi_zakholi91@yahoo.com