Archika Vyas May11 and May12 Assingments

11 May/problem01/problem01.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+
+using namespace std;
+
+int main()
+{
+	int arr[] = {1,1,2,2,3,4,4,5,5};
+	int len = sizeof(arr)/sizeof(arr[0]);
+	int i ,result = arr[0];
+
+	for(i = 1;i < len; i++)
+	{
+		result = result ^ arr[i];
+	}
+
+	cout<<"Print the single number: "<<result<<endl;
+}

11 May/problem05/problem05.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+	int number;
+	cout<<"Please enter a digit: ";
+	cin>>number;
+
+	if(number == 0 || number == 1)
+	{
+		cout<<"Sqaure root of the given number is :"<<number;
+	}
+
+	int start = 1, end = number, mid, result ;
+	while(start <= end)
+	{
+	    mid = (start + end)/2;
+	    if(mid*mid == number)
+	    {
+	    	cout<<"Square root is: "<<mid;
+		}
+		else if (mid*mid < number)
+		{
+			start = mid + 1;
+			result = mid;
+		}
+		else
+		    end = mid - 1;
+	}
+	cout<<"Sqaure root is: "<<result;
+}

12 May/Problem01/solution01.cpp

@@ -0,0 +1,71 @@
+#include<iostream>
+#define N 3
+
+using namespace std;
+
+int main ()
+{ 
+
+  int count=0,i,j;  
+  int arr[N][N];
+
+  //Input matrix elements
+    cout << "Enter elements "<< N*N <<" of array:" << endl;
+    for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cin>>arr[i][j];
+		}
+		cout<<endl;
+	}
+
+
+    cout<<"Matrix is: "<<endl;
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cout<<arr[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+
+
+  for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			int sum = 0; 
+  	        bool isPrime = true;
+
+            if (i - 1 >= 0) 
+                sum += arr[i - 1][j]; 
+
+            if (i + 1 < N) 
+                sum += arr[i + 1][j]; 
+
+            if (j - 1 >= 0) 
+                sum += arr[i][j - 1]; 
+
+            if (j + 1 < N) 
+                sum += arr[i][j + 1]; 
+
+
+			for(int k=2;k <= sum/2;k++)
+		    {
+		      if (sum % k == 0) 
+			  {
+		         isPrime = false;
+		         break;
+		      }
+		   }
+		   if (isPrime)
+		      count++;     
+
+		}
+
+	}
+
+  cout <<"Output: "<< count <<endl; 
+}

12 May/Problem02/solution02.cpp

@@ -0,0 +1,39 @@
+#include<iostream>
+#define N 3
+
+using namespace std;
+
+int main()
+{
+	int arr[N][N];
+	int search=0,i,j,flag = 0;;
+
+	cout<<"Please enter "<<N*N<<" elements:"<<endl;
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cin>>arr[i][j];
+		}
+		cout<<endl;
+	}
+
+	cout<<"Enter the number which you want to search: ";
+	cin>>search;
+
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			if(search == arr[i][j])
+		    	flag = 1;		
+		}
+	}
+
+	if(flag == 1)
+		cout<<"Number Found at ("<<i<<","<<j<<")"<<endl;
+	else
+		cout<<"Number not Found"<<endl;
+
+
+}

12 May/Problem03/solution03.cpp

@@ -0,0 +1,49 @@
+#include<iostream>
+#define N 4
+
+using namespace std;
+
+int main()
+{
+	int arr[N][N];
+	int search=0, i, j, flag = 0, count = 0;
+
+	cout<<"Please enter "<<N*N<<" elements:"<<endl;
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cin>>arr[i][j];
+		}
+		cout<<endl;
+	}
+
+	cout<<"Matrix is: "<<endl;
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cout<<arr[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			if(arr[j][i] == 1)
+			{
+				count++;
+			}		
+		}
+		if(count%2 != 0)
+		{
+			flag++;
+			count = 0;
+		}
+	}
+
+	cout<<"Output: "<<flag;
+
+}

ArchikaVyas/11_May/problem01/problem01.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+
+using namespace std;
+
+int main()
+{
+	int arr[] = {1,1,2,2,3,4,4,5,5};
+	int len = sizeof(arr)/sizeof(arr[0]);
+	int i ,result = arr[0];
+
+	for(i = 1;i < len; i++)
+	{
+		result = result ^ arr[i];
+	}
+
+	cout<<"Print the single number: "<<result<<endl;
+}

ArchikaVyas/11_May/problem05/problem05.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+	int number;
+	cout<<"Please enter a digit: ";
+	cin>>number;
+
+	if(number == 0 || number == 1)
+	{
+		cout<<"Sqaure root of the given number is :"<<number;
+	}
+
+	int start = 1, end = number, mid, result ;
+	while(start <= end)
+	{
+	    mid = (start + end)/2;
+	    if(mid*mid == number)
+	    {
+	    	cout<<"Square root is: "<<mid;
+		}
+		else if (mid*mid < number)
+		{
+			start = mid + 1;
+			result = mid;
+		}
+		else
+		    end = mid - 1;
+	}
+	cout<<"Sqaure root is: "<<result;
+}

ArchikaVyas/12_May/Problem01/solution01.cpp

@@ -0,0 +1,71 @@
+#include<iostream>
+#define N 3
+
+using namespace std;
+
+int main ()
+{ 
+
+  int count=0,i,j;  
+  int arr[N][N];
+
+  //Input matrix elements
+    cout << "Enter elements "<< N*N <<" of array:" << endl;
+    for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cin>>arr[i][j];
+		}
+		cout<<endl;
+	}
+
+
+    cout<<"Matrix is: "<<endl;
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cout<<arr[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+
+
+  for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			int sum = 0; 
+  	        bool isPrime = true;
+
+            if (i - 1 >= 0) 
+                sum += arr[i - 1][j]; 
+
+            if (i + 1 < N) 
+                sum += arr[i + 1][j]; 
+
+            if (j - 1 >= 0) 
+                sum += arr[i][j - 1]; 
+
+            if (j + 1 < N) 
+                sum += arr[i][j + 1]; 
+
+
+			for(int k=2;k <= sum/2;k++)
+		    {
+		      if (sum % k == 0) 
+			  {
+		         isPrime = false;
+		         break;
+		      }
+		   }
+		   if (isPrime)
+		      count++;     
+
+		}
+
+	}
+
+  cout <<"Output: "<< count <<endl; 
+}

ArchikaVyas/12_May/Problem02/solution02.cpp

@@ -0,0 +1,39 @@
+#include<iostream>
+#define N 3
+
+using namespace std;
+
+int main()
+{
+	int arr[N][N];
+	int search=0,i,j,flag = 0;;
+
+	cout<<"Please enter "<<N*N<<" elements:"<<endl;
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			cin>>arr[i][j];
+		}
+		cout<<endl;
+	}
+
+	cout<<"Enter the number which you want to search: ";
+	cin>>search;
+
+	for(i = 0; i < N; i++)
+	{
+		for(j = 0;j < N; j++)
+		{
+			if(search == arr[i][j])
+		    	flag = 1;		
+		}
+	}
+
+	if(flag == 1)
+		cout<<"Number Found at ("<<i<<","<<j<<")"<<endl;
+	else
+		cout<<"Number not Found"<<endl;
+
+
+}