diff --git a/Vikas_rajpurohit/11-may/1.jpeg b/Vikas_rajpurohit/11-may/1.jpeg
new file mode 100644
index 0000000..2f6daf1
Binary files /dev/null and b/Vikas_rajpurohit/11-may/1.jpeg differ
diff --git a/Vikas_rajpurohit/11-may/2.jpeg b/Vikas_rajpurohit/11-may/2.jpeg
new file mode 100644
index 0000000..f9e9e29
Binary files /dev/null and b/Vikas_rajpurohit/11-may/2.jpeg differ
diff --git a/Vikas_rajpurohit/11-may/3.jpeg b/Vikas_rajpurohit/11-may/3.jpeg
new file mode 100644
index 0000000..018fea2
Binary files /dev/null and b/Vikas_rajpurohit/11-may/3.jpeg differ
diff --git a/Vikas_rajpurohit/11-may/4.jpeg b/Vikas_rajpurohit/11-may/4.jpeg
new file mode 100644
index 0000000..018fea2
Binary files /dev/null and b/Vikas_rajpurohit/11-may/4.jpeg differ
diff --git a/Vikas_rajpurohit/11-may/5.jpeg b/Vikas_rajpurohit/11-may/5.jpeg
new file mode 100644
index 0000000..018fea2
Binary files /dev/null and b/Vikas_rajpurohit/11-may/5.jpeg differ
diff --git a/Vikas_rajpurohit/11-may/question1.cpp b/Vikas_rajpurohit/11-may/question1.cpp
new file mode 100644
index 0000000..345ac85
--- /dev/null
+++ b/Vikas_rajpurohit/11-may/question1.cpp
@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	
+	int i,p=0,n,x;
+	vector<int> ar;
+	cout<<"Enter number of elements : ";
+	cin>>n;
+	for(i=0;i<n;i++)
+	{
+		cout<<"Enter element "<<i+1<<" : ";
+		cin>>x;
+		ar.push_back(x);
+	}
+	for(i=0;i<ar.size();i++)
+	{
+		p=p^ar[i];
+	}
+	cout<<p;
+}
diff --git a/Vikas_rajpurohit/11-may/question2.cpp b/Vikas_rajpurohit/11-may/question2.cpp
new file mode 100644
index 0000000..123a131
--- /dev/null
+++ b/Vikas_rajpurohit/11-may/question2.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int arr[]={9,17};
+	vector<int>ar;
+	int n;
+	cout<<"Enter length of array : ";
+	cin>>n;
+	int x,i;
+	for(i=0;i<n;i++)
+	{
+		cout<<"Enter element : ";
+		cin>>x;
+		ar.push_back(x);
+	}
+	sort(ar.begin(),ar.end());
+	x = ar[0]^ar[1];
+	int m;
+	for(int i=2;i<ar.size();i++)
+	{
+		x = min(x,ar[i]^ar[i+1]);
+	}
+	cout<<"Minimum xor value = "<<x;
+	
+}
diff --git a/Vikas_rajpurohit/11-may/question3.cpp b/Vikas_rajpurohit/11-may/question3.cpp
new file mode 100644
index 0000000..668405a
--- /dev/null
+++ b/Vikas_rajpurohit/11-may/question3.cpp
@@ -0,0 +1,10 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int n,ans;
+	cout<<"Enter number of blocks : ";
+	cin>>n;
+	ans=(-1+sqrt(1+8*n))/2;
+	cout<<"Result = "<<ans;
+}
diff --git a/Vikas_rajpurohit/11-may/question4.cpp b/Vikas_rajpurohit/11-may/question4.cpp
new file mode 100644
index 0000000..8e8a5b9
--- /dev/null
+++ b/Vikas_rajpurohit/11-may/question4.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+#define mod 1000000000
+using namespace std;
+int path(int A) {
+    long long  int C[A];
+    C[0]=C[1]=1;
+    for(int i=2;i<A;i++)
+    {
+        C[i]=0;
+        for(int j=0;j<i;j++)
+        {
+            int x=(C[j]%mod*C[i-j-1]%mod)%mod;
+            C[i]+=x;
+            C[i]=C[i]%mod;
+        }
+    }
+    
+    return C[A-1];
+}
+int main()
+{
+	int n;
+	cout<<"Enter size of grid : ";
+	cin>>n;
+	cout<<"Result = "<<path(n);
+}
diff --git a/Vikas_rajpurohit/11-may/question5.cpp b/Vikas_rajpurohit/11-may/question5.cpp
new file mode 100644
index 0000000..644392a
--- /dev/null
+++ b/Vikas_rajpurohit/11-may/question5.cpp
@@ -0,0 +1,34 @@
+#include<bits/stdc++.h>
+using namespace std;
+double fun(int n)
+{
+	double l=0,u=n,m,res;
+	int count=3;
+	while(count!=0)
+	{
+		m = (l+u)/2;
+		res = m*m;
+		if(res==n)
+		{
+			return m;
+		}
+		else if(res>n)
+		{
+			u = m;
+		}
+		else
+		{
+			l=m;
+		}
+		count--;
+	}
+	return m;
+}
+int main()
+{
+	int n;
+	cout<<"Enter number : ";
+	cin>>n;
+	double ans = fun(n);
+	cout<<"Square root of "<<n<<" is "<<ans<<endl;
+}