diff --git a/11 May/problem01/problem01.cpp b/11 May/problem01/problem01.cpp
new file mode 100644
index 0000000..ff93150
--- /dev/null
+++ b/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;
+}
diff --git a/11 May/problem01/problem01.exe b/11 May/problem01/problem01.exe
new file mode 100644
index 0000000..fad4e8c
Binary files /dev/null and b/11 May/problem01/problem01.exe differ
diff --git a/11 May/problem01/problem01.png b/11 May/problem01/problem01.png
new file mode 100644
index 0000000..04453ea
Binary files /dev/null and b/11 May/problem01/problem01.png differ
diff --git a/11 May/problem05/problem05.cpp b/11 May/problem05/problem05.cpp
new file mode 100644
index 0000000..3c2588b
--- /dev/null
+++ b/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;
+}
diff --git a/11 May/problem05/problem05.exe b/11 May/problem05/problem05.exe
new file mode 100644
index 0000000..e9f751c
Binary files /dev/null and b/11 May/problem05/problem05.exe differ
diff --git a/12 May/Problem01/output.png b/12 May/Problem01/output.png
new file mode 100644
index 0000000..4ab8df5
Binary files /dev/null and b/12 May/Problem01/output.png differ
diff --git a/12 May/Problem01/solution01.cpp b/12 May/Problem01/solution01.cpp
new file mode 100644
index 0000000..3f1db73
--- /dev/null
+++ b/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; 
+}
diff --git a/12 May/Problem01/solution01.exe b/12 May/Problem01/solution01.exe
new file mode 100644
index 0000000..05bb9dc
Binary files /dev/null and b/12 May/Problem01/solution01.exe differ
diff --git a/12 May/Problem02/output.png b/12 May/Problem02/output.png
new file mode 100644
index 0000000..ac5f93f
Binary files /dev/null and b/12 May/Problem02/output.png differ
diff --git a/12 May/Problem02/solution02.cpp b/12 May/Problem02/solution02.cpp
new file mode 100644
index 0000000..0a052b1
--- /dev/null
+++ b/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;
+		
+	
+}
diff --git a/12 May/Problem02/solution02.exe b/12 May/Problem02/solution02.exe
new file mode 100644
index 0000000..b771f6f
Binary files /dev/null and b/12 May/Problem02/solution02.exe differ
diff --git a/12 May/Problem03/output.png b/12 May/Problem03/output.png
new file mode 100644
index 0000000..4ea276b
Binary files /dev/null and b/12 May/Problem03/output.png differ
diff --git a/12 May/Problem03/solution03.cpp b/12 May/Problem03/solution03.cpp
new file mode 100644
index 0000000..b6b8000
--- /dev/null
+++ b/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;
+	
+}
diff --git a/12 May/Problem03/solution03.exe b/12 May/Problem03/solution03.exe
new file mode 100644
index 0000000..a7bb209
Binary files /dev/null and b/12 May/Problem03/solution03.exe differ
diff --git a/ArchikaVyas/11_May/problem01/problem01.cpp b/ArchikaVyas/11_May/problem01/problem01.cpp
new file mode 100644
index 0000000..ff93150
--- /dev/null
+++ b/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;
+}
diff --git a/ArchikaVyas/11_May/problem01/problem01.exe b/ArchikaVyas/11_May/problem01/problem01.exe
new file mode 100644
index 0000000..fad4e8c
Binary files /dev/null and b/ArchikaVyas/11_May/problem01/problem01.exe differ
diff --git a/ArchikaVyas/11_May/problem01/problem01.png b/ArchikaVyas/11_May/problem01/problem01.png
new file mode 100644
index 0000000..04453ea
Binary files /dev/null and b/ArchikaVyas/11_May/problem01/problem01.png differ
diff --git a/ArchikaVyas/11_May/problem05/problem05.cpp b/ArchikaVyas/11_May/problem05/problem05.cpp
new file mode 100644
index 0000000..3c2588b
--- /dev/null
+++ b/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;
+}
diff --git a/ArchikaVyas/11_May/problem05/problem05.exe b/ArchikaVyas/11_May/problem05/problem05.exe
new file mode 100644
index 0000000..e9f751c
Binary files /dev/null and b/ArchikaVyas/11_May/problem05/problem05.exe differ
diff --git a/ArchikaVyas/12_May/Problem01/output.png b/ArchikaVyas/12_May/Problem01/output.png
new file mode 100644
index 0000000..4ab8df5
Binary files /dev/null and b/ArchikaVyas/12_May/Problem01/output.png differ
diff --git a/ArchikaVyas/12_May/Problem01/solution01.cpp b/ArchikaVyas/12_May/Problem01/solution01.cpp
new file mode 100644
index 0000000..3f1db73
--- /dev/null
+++ b/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; 
+}
diff --git a/ArchikaVyas/12_May/Problem01/solution01.exe b/ArchikaVyas/12_May/Problem01/solution01.exe
new file mode 100644
index 0000000..05bb9dc
Binary files /dev/null and b/ArchikaVyas/12_May/Problem01/solution01.exe differ
diff --git a/ArchikaVyas/12_May/Problem02/output.png b/ArchikaVyas/12_May/Problem02/output.png
new file mode 100644
index 0000000..ac5f93f
Binary files /dev/null and b/ArchikaVyas/12_May/Problem02/output.png differ
diff --git a/ArchikaVyas/12_May/Problem02/solution02.cpp b/ArchikaVyas/12_May/Problem02/solution02.cpp
new file mode 100644
index 0000000..0a052b1
--- /dev/null
+++ b/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;
+		
+	
+}
diff --git a/ArchikaVyas/12_May/Problem02/solution02.exe b/ArchikaVyas/12_May/Problem02/solution02.exe
new file mode 100644
index 0000000..b771f6f
Binary files /dev/null and b/ArchikaVyas/12_May/Problem02/solution02.exe differ
diff --git a/ArchikaVyas/12_May/Problem03/output.png b/ArchikaVyas/12_May/Problem03/output.png
new file mode 100644
index 0000000..4ea276b
Binary files /dev/null and b/ArchikaVyas/12_May/Problem03/output.png differ
diff --git a/ArchikaVyas/12_May/Problem03/solution03.cpp b/ArchikaVyas/12_May/Problem03/solution03.cpp
new file mode 100644
index 0000000..b6b8000
--- /dev/null
+++ b/ArchikaVyas/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;
+	
+}
diff --git a/ArchikaVyas/12_May/Problem03/solution03.exe b/ArchikaVyas/12_May/Problem03/solution03.exe
new file mode 100644
index 0000000..a7bb209
Binary files /dev/null and b/ArchikaVyas/12_May/Problem03/solution03.exe differ
diff --git a/ArchikaVyas/13_May/Problem01/output.png b/ArchikaVyas/13_May/Problem01/output.png
new file mode 100644
index 0000000..1659be6
Binary files /dev/null and b/ArchikaVyas/13_May/Problem01/output.png differ
diff --git a/ArchikaVyas/13_May/Problem01/solution01.cpp b/ArchikaVyas/13_May/Problem01/solution01.cpp
new file mode 100644
index 0000000..51689ae
--- /dev/null
+++ b/ArchikaVyas/13_May/Problem01/solution01.cpp
@@ -0,0 +1,48 @@
+/*
+WAP to create a class with two data members, meter and
+centimeter, for storing height of a person. Then you need to create
+two objects, take height input and then assign addition of height of
+to another object. Make sure to keep data members of class private
+and perform all operations using member functions.
+*/
+
+#include<iostream>
+
+using namespace std;
+
+class Height
+{
+	float meter;
+	float centimeter;
+	
+	public:
+		void get()
+		{
+			cout<<"Please enter Height informatin in m and cm: "<<endl;
+			cin>>meter>>centimeter;
+		}
+		
+		Height add(Height& h)
+		{
+			Height a;
+			a.meter = meter + h.meter;
+			a.centimeter = centimeter + h.centimeter;
+			return a;
+		}
+		
+		void print()
+		{
+			cout<<"Addition of two height objects is: "<<meter<<" m "<<centimeter<<" cm"<<endl;
+		}
+};
+
+int main()
+{
+	Height h1,h2,h3;
+	h1.get();
+	h2.get();
+	h3 = h1.add(h2);
+	h3.print();
+	
+	return 0;
+}
diff --git a/ArchikaVyas/13_May/Problem01/solution01.exe b/ArchikaVyas/13_May/Problem01/solution01.exe
new file mode 100644
index 0000000..0033b3c
Binary files /dev/null and b/ArchikaVyas/13_May/Problem01/solution01.exe differ
diff --git a/ArchikaVyas/13_May/Problem02/output.png b/ArchikaVyas/13_May/Problem02/output.png
new file mode 100644
index 0000000..46424fd
Binary files /dev/null and b/ArchikaVyas/13_May/Problem02/output.png differ
diff --git a/ArchikaVyas/13_May/Problem02/solution02.cpp b/ArchikaVyas/13_May/Problem02/solution02.cpp
new file mode 100644
index 0000000..12d37a0
--- /dev/null
+++ b/ArchikaVyas/13_May/Problem02/solution02.cpp
@@ -0,0 +1,44 @@
+/*
+WAP that has two functions named ‘area’ first version will calculate
+area of triangle based on height and base, and second version will
+calculate area of triangle based on dimension of three sides.
+*/
+
+#include<iostream>
+#include<math.h>
+#include<stdlib.h>
+
+using namespace std;
+
+class Triangle
+{
+	public:
+		int areaTriangle(int h, int b)
+	   {
+	   	 cout<<"Function called with 2 parameters"<<endl;
+		 int area = .5*b*h;
+		 return area;
+	   }
+	   
+	   int areaTriangle(int a, int b, int c)
+	   {  
+	      cout<<endl<<"Function called with 3 parameters"<<endl;
+	      int s = (a+b+c)/2;
+	   	  int area = sqrt(s*(s-a)*(s-b)*(s-c));
+	   	  return area;
+	   }
+	   
+	   void display(int d)
+	   {
+	   	  cout<<"Area of Triangle is: "<<d<<endl;
+	   }
+};
+
+int main()
+{
+	Triangle t1,t2;
+	int a = t1.areaTriangle(5,5);
+	t1.display(a);
+	int b = t1.areaTriangle(27,12,21);
+	t1.display(b);
+}
diff --git a/ArchikaVyas/13_May/Problem02/solution02.exe b/ArchikaVyas/13_May/Problem02/solution02.exe
new file mode 100644
index 0000000..7cba400
Binary files /dev/null and b/ArchikaVyas/13_May/Problem02/solution02.exe differ