diff --git a/Milestone-17(a)/problem-01-17(a)- recursion -w3resource.cpp b/Milestone-17(a)/problem-01-17(a)- recursion -w3resource.cpp
new file mode 100644
index 00000000..89aacf8f
--- /dev/null
+++ b/Milestone-17(a)/problem-01-17(a)- recursion -w3resource.cpp	
@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+void print(int n)
+{
+	if(n==1)
+	{
+		cout<<n<<" ";
+		return;
+	}
+	print(n-1);
+	cout<<n<<" ";
+}
+int main()
+{
+	int n=50;
+	print(n);
+}
diff --git a/Milestone-17(a)/problem-02-17(a).cpp b/Milestone-17(a)/problem-02-17(a).cpp
new file mode 100644
index 00000000..a3599b1e
--- /dev/null
+++ b/Milestone-17(a)/problem-02-17(a).cpp
@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int add(int n)
+{
+	int sum=0;
+	if(n==1 || n==0)
+	{
+		return n;
+	}
+//	add(n-1);
+	sum=n+add(n-1);
+	return sum;
+}
+int main()
+{
+	int n;
+	cout<<"enter n-"<<endl;
+	cin>>n;
+	int x=add(n);
+	cout<<"addition- "<<x;
+}
diff --git a/Milestone-17(a)/problem-03-17(a).cpp b/Milestone-17(a)/problem-03-17(a).cpp
new file mode 100644
index 00000000..9bedcb22
--- /dev/null
+++ b/Milestone-17(a)/problem-03-17(a).cpp
@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+void print(int arr[],int index,int size)
+{
+	if(index>=size)
+	{
+	    return ;
+	}
+	cout<<arr[index]<<" ";
+	print(arr,index+1,size);
+	
+}
+int main()
+{
+	int arr[]={1,2,3,4,5};
+	print(arr,0,5);
+}
diff --git a/Milestone-17(a)/problem-04-17(a).cpp b/Milestone-17(a)/problem-04-17(a).cpp
new file mode 100644
index 00000000..9bedcb22
--- /dev/null
+++ b/Milestone-17(a)/problem-04-17(a).cpp
@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+void print(int arr[],int index,int size)
+{
+	if(index>=size)
+	{
+	    return ;
+	}
+	cout<<arr[index]<<" ";
+	print(arr,index+1,size);
+	
+}
+int main()
+{
+	int arr[]={1,2,3,4,5};
+	print(arr,0,5);
+}
diff --git a/Milestone-17(a)/problem-05-17(a).cpp b/Milestone-17(a)/problem-05-17(a).cpp
new file mode 100644
index 00000000..6d8d2e24
--- /dev/null
+++ b/Milestone-17(a)/problem-05-17(a).cpp
@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int counter=0;
+int count_digits(int n)
+{
+	
+	if(n!=0)                    //    if(n<10)
+	{                           //    return 1;
+		counter++;              //    else
+		count_digits(n/10);     //    return 1+count_digits(n/10);
+	}
+	return counter;
+}
+int main()
+{
+	int n;
+	cout<<"enter n - "<<endl;
+	cin>>n;
+	int x=count_digits(n);
+	cout<<"no of digits - "<<x;
+}
diff --git a/Milestone-17(a)/problem-06-17(a).cpp b/Milestone-17(a)/problem-06-17(a).cpp
new file mode 100644
index 00000000..6c8de8e9
--- /dev/null
+++ b/Milestone-17(a)/problem-06-17(a).cpp
@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int sum=0;
+int sum_of_digits(int n)
+{
+	if(n==0)
+	{
+		return 0;
+		
+	}
+	return n%10+sum_of_digits(n/10);
+}
+int main()
+{
+	int n;
+	cin>>n;
+	cout<<"sum of digits- "<<sum_of_digits(n);
+}
diff --git a/Milestone-17(a)/problem-07-17(a).cpp b/Milestone-17(a)/problem-07-17(a).cpp
new file mode 100644
index 00000000..195472f1
--- /dev/null
+++ b/Milestone-17(a)/problem-07-17(a).cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+
+using namespace std;
+int gcd(int n1,int n2,int val)
+{
+    cout<<"d"<<endl;
+    if(val>1)
+    {
+        cout<<"s"<<endl;
+        if(n1%val==0 && n2%val==0)
+        {
+            return val;
+        }
+        
+        return gcd(n1,n2,val-1);
+    }
+    return 0;
+}
+
+int main()
+{
+    int n1,n2;
+    cout<<"enter first number"<<endl;
+    cin>>n1;
+    cout<<"enter second number"<<endl;
+    cin>>n2;
+    int val;
+    if(n1>n2)
+    {
+        val=n1;
+    }
+    else{
+       val=n2;
+    }
+    int x=gcd(n1,n2,val);
+    cout<<"GCD of"<<n1<<"and"<<n2<<"is "<<x;
+}
+
diff --git a/Milestone-17(a)/problem-08-17(a).cpp b/Milestone-17(a)/problem-08-17(a).cpp
new file mode 100644
index 00000000..b9f25a65
--- /dev/null
+++ b/Milestone-17(a)/problem-08-17(a).cpp
@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int func(int arr[],int index,int size,int &max)
+	{
+    if(index < size)
+    {
+         if(max<arr[index])
+           max=arr[index];
+      
+      func(arr,index+1,size,max);//calling the function MaxElem itself to compare with further element
+    }
+    return max;
+}
+int main()
+{
+	int arr[]={1,2,5,3,4,10};
+	cout<<" max element - "<<func(arr,0,6,arr[0]);
+}
diff --git a/Milestone-17(a)/problem-09-17(a).cpp b/Milestone-17(a)/problem-09-17(a).cpp
new file mode 100644
index 00000000..30e2af21
--- /dev/null
+++ b/Milestone-17(a)/problem-09-17(a).cpp
@@ -0,0 +1,20 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+void print(string s,int index)
+{
+	if(index>s.size())
+	{
+		return;
+	}
+	print(s,index+1);
+	cout<<s[index];
+}
+int main()
+{
+	string s;
+	cout<<"enter string"<<endl;
+	cin>>s;
+	print(s,0);
+	
+}
diff --git a/Milestone-17(a)/problem-10-17(a).cpp b/Milestone-17(a)/problem-10-17(a).cpp
new file mode 100644
index 00000000..68079b21
--- /dev/null
+++ b/Milestone-17(a)/problem-10-17(a).cpp
@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+int fact(int n)
+{
+	if(n==0 ||n==1)
+	{
+		return n;
+	}
+	else
+	{
+		return n*fact(n-1);
+	}
+}
+int main()
+{
+	int n;
+	cout<<"enter number - "<<endl;
+	cin>>n;
+	cout<<"factorial of "<<n<<" is "<<fact(n);
+}
diff --git a/Milestone-17(a)/problem-11-17(a).cpp b/Milestone-17(a)/problem-11-17(a).cpp
new file mode 100644
index 00000000..25721edb
--- /dev/null
+++ b/Milestone-17(a)/problem-11-17(a).cpp
@@ -0,0 +1,27 @@
+#include<iostream>
+using namespace std;
+
+long convert_binary(int n)
+{
+//	static long bin,rem,fact=1;
+	static long bin,rem,fact=1;
+cout<<"statcic bin -"<<bin<<endl;
+	if(n!=0)
+	{
+		rem=n%2;
+		bin=bin+rem*fact;
+		fact=fact*10;
+		convert_binary(n/2);
+	}
+	return bin;
+	
+}
+int main()
+{
+
+	int n;
+	cout<<"enter decimal number"<<endl;
+	cin>>n;
+	cout<<"binary number - "<<convert_binary(n);
+	
+}
diff --git a/Milestone-17(a)/problem-12-17(a).cpp b/Milestone-17(a)/problem-12-17(a).cpp
new file mode 100644
index 00000000..cc7ef41b
--- /dev/null
+++ b/Milestone-17(a)/problem-12-17(a).cpp
@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+int count=0;
+bool prime(int ind,int n)
+{
+	if(ind<n)
+	{
+		if(n%ind==0)
+		{
+			count=1;
+			return false;
+		}
+		prime(ind+1,n);
+	}
+	return true;
+}
+int main()
+{
+	int n;
+	cout<<"enter number - ";
+	cin>>n;
+	prime(2,n);
+	if (count==0)
+	{
+		cout<<"prime number"<<endl;
+	}
+	else
+	{
+		cout<<"not a prime number "<<endl;
+	}
+}
diff --git a/Milestone-17(a)/problem-13-17(a).cpp b/Milestone-17(a)/problem-13-17(a).cpp
new file mode 100644
index 00000000..11e7e4fa
--- /dev/null
+++ b/Milestone-17(a)/problem-13-17(a).cpp
@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+void print(int val,int n)
+{
+if(val>n)
+{
+	return;
+}
+cout<<val<<" ";
+print(val+2,n);	
+}
+int main()
+{
+	int n;
+	cout<<"enter n -"<<endl;
+	cin>>n;
+	cout<<"printing even numbers- ";
+	print(2,n);
+	cout<<endl;
+	cout<<"printing odd numbers - ";
+	print(1,n);
+}
diff --git a/Milestone-17(a)/problem-16-17(a).cpp b/Milestone-17(a)/problem-16-17(a).cpp
new file mode 100644
index 00000000..43c1b8e9
--- /dev/null
+++ b/Milestone-17(a)/problem-16-17(a).cpp
@@ -0,0 +1,29 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+string palindrome(char s1[],int size,int index)
+{
+	static string s2;
+	if(index>=size)
+	{
+		return s2;
+	}
+	
+	palindrome(s1,size,index+1);
+	s2+=s1[index];
+	return s2;
+	
+}
+int main()
+{
+	char s1[20];
+	string s;
+	cout<<"enter any string "<<endl;
+	cin>>s1;
+	int size=strlen(s1);
+	s=palindrome(s1,size,0);
+	if(s1==s)
+	cout<<"yes";
+	else
+	cout<<"no";
+}
diff --git a/Milestone-17(a)/problem-17-17(a).cpp b/Milestone-17(a)/problem-17-17(a).cpp
new file mode 100644
index 00000000..35b02d55
--- /dev/null
+++ b/Milestone-17(a)/problem-17-17(a).cpp
@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+int pow(int x,int p)
+{
+	if(p==0)
+	{
+		return 0;
+	}
+	else if(p==1)
+	{
+		return x;
+	}
+	else
+	{
+		if(p%2==0)
+		{
+			int y=pow(x,p/2);
+			return y*y;
+		}
+		else
+		return pow(x,p-1);
+	}
+}
+int main()
+{
+	int x,p;
+	cout<<"enter number whose power needs to be calculated"<<endl;
+	cin>>x;
+	cout<<"enter power - ";
+	cin>>p;
+	cout<<"ans- "<<pow(x,p);
+}
diff --git a/Milestone-17(a)/problem-19-17(a).cpp b/Milestone-17(a)/problem-19-17(a).cpp
new file mode 100644
index 00000000..7aa5b3bd
--- /dev/null
+++ b/Milestone-17(a)/problem-19-17(a).cpp
@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+string copystring(string s1,int index,int size)
+{
+	static string s2="";
+	if(index>=size)
+	{
+		return s2;
+	}
+	else
+	{
+		s2=s2+s1[index];
+		copystring(s1,index+1,size);
+	}
+	return s2;
+}
+int main()
+{
+	string s1;
+	cout<<"enter string"<<endl;
+	cin>>s1;
+	string s=copystring(s1,0,s1.size());
+	cout<<"copied string - "<<s;
+}
diff --git a/Milestone-17(a)/problem-20-17(A).cpp b/Milestone-17(a)/problem-20-17(A).cpp
new file mode 100644
index 00000000..0dc275be
--- /dev/null
+++ b/Milestone-17(a)/problem-20-17(A).cpp
@@ -0,0 +1,30 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+int func(string s1,int size,int index)
+{
+	if(index>=size)
+	{
+		return -1;
+	}
+	else
+	{
+		if(isupper(s1[index]))
+		{
+			return index;
+		}
+		else
+		{
+			return func(s1,size,index+1);
+		}
+	}
+}
+int main()
+{
+	string s1;
+	cout<<"enter string - "<<endl;
+    getline(cin,s1);
+	int n=s1.length();
+	int x=func(s1,n,0);
+	cout<<"capital letter at - "<<x;
+}
diff --git a/Milestone-17(a)/problem-21-17(a).cpp b/Milestone-17(a)/problem-21-17(a).cpp
new file mode 100644
index 00000000..1e91e6d3
--- /dev/null
+++ b/Milestone-17(a)/problem-21-17(a).cpp
@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+int binarysearch(int arr[],int size,int start,int end,int ele)
+{
+	int c=0;
+	if(start<=end)
+	{
+		int mid=(start+end)/2;
+	
+	if(arr[mid]==ele)
+	{
+		c=mid;
+	}
+	else if(ele<arr[mid])
+	{
+		return binarysearch(arr,size,start,mid-1,ele);
+	}
+	else
+	{
+		return binarysearch(arr,size,mid+1,end,ele);
+	}
+}
+return c;
+	
+}
+int main()
+{
+	int size=9;
+	int arr[]={1,2,3,4,5,6,7,8,9}; //array must be sorted;
+
+	int ele;
+	cout<<"enter element"<<endl;
+	cin>>ele;
+	int x=binarysearch(arr,size,0,size-1,ele);
+	cout<<"element found at - "<<x;
+}
diff --git a/Milestone-17(a)/ser.txt b/Milestone-17(a)/ser.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Milestone-17(a)/ser.txt
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-01/Problem-01.cpp b/Sejal Chanchlani/Milestone-01/Problem-01.cpp
new file mode 100644
index 00000000..cac30eb2
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-01/Problem-01.cpp	
@@ -0,0 +1,6 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	cout<<"Welcome to Girl Code It";
+}
diff --git a/Sejal Chanchlani/Milestone-01/Problem-02.cpp b/Sejal Chanchlani/Milestone-01/Problem-02.cpp
new file mode 100644
index 00000000..7043803c
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-01/Problem-02.cpp	
@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int a,b;
+	cout<<"enter first number"<<endl;
+	cin>>a;
+	cout<<"enter second number"<<endl;
+	cin>>b;
+	if(a>b)
+	{
+		cout<<a<<" is the greater one."<<endl;
+	}
+	else
+	{
+		cout<<b<<" is the greater one."<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-01/Problem-03.cpp b/Sejal Chanchlani/Milestone-01/Problem-03.cpp
new file mode 100644
index 00000000..62aa5209
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-01/Problem-03.cpp	
@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int a,b;
+	cout<<"enter any number"<<endl;
+	cin>>a;
+	if(a%2==0)
+	{
+		cout<<a<<" is an even number."<<endl;
+	}
+	else
+	{
+		cout<<a<<" is an odd number";
+	}
+}
+
diff --git a/Sejal Chanchlani/Milestone-01/Problem-04.cpp b/Sejal Chanchlani/Milestone-01/Problem-04.cpp
new file mode 100644
index 00000000..9aa94c26
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-01/Problem-04.cpp	
@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int a,b;
+	cout<<"enter any number"<<endl;
+	cin>>a;
+	if(a==0)
+	{
+		cout<<a<<"- number is zero"<<endl;
+	}
+	else if(a>0)
+	{
+		cout<<a<<"- number is positive"<<endl;
+	}
+	else
+	{
+		cout<<a<<"- number is negative"<<endl;
+	}
+	}
diff --git a/Sejal Chanchlani/Milestone-01/Problem-05.cpp b/Sejal Chanchlani/Milestone-01/Problem-05.cpp
new file mode 100644
index 00000000..eb29d459
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-01/Problem-05.cpp	
@@ -0,0 +1,11 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int a,b;
+	cout<<"enter first number"<<endl;
+	cin>>a;
+	cout<<"enter second number"<<endl;
+	cin>>b;
+	cout<<"Multiplication of "<<a<<" and "<<b<<" is "<<a*b;
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-01-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-01-02.cpp
new file mode 100644
index 00000000..dc39d488
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-01-02.cpp	
@@ -0,0 +1,15 @@
+//Write a C++ program to print all natural numbers from 1 to n. 
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,i=1;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	while(n)
+	{
+		cout<<i<<endl;
+		i++;
+		n--;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-02-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-02-02.cpp
new file mode 100644
index 00000000..133cf682
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-02-02.cpp	
@@ -0,0 +1,14 @@
+//Write a Cpp program to print all natural numbers in reverse (from n to 1). - using while loop
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	while(n)
+	{
+		cout<<n<<endl;
+		n--;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-03-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-03-02.cpp
new file mode 100644
index 00000000..6e2ddf77
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-03-02.cpp	
@@ -0,0 +1,15 @@
+//Write a C program to print all even numbers between 1 to 100. - using while loop
+#include<iostream>
+using namespace std;
+int main()
+{
+	int i=0;
+	while(i!=100)
+	{
+		if(i%2==0)
+		{
+			cout<<i<<endl;
+		}
+		i++;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-04-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-04-02.cpp
new file mode 100644
index 00000000..eade3b01
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-04-02.cpp	
@@ -0,0 +1,15 @@
+//Write a C program to print all odd number between 1 to 100.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int i=100;
+	while(i!=0)
+	{
+		if(i%2!=0)
+		{
+			cout<<i<<endl;
+		}
+		i--;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-05-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-05-02.cpp
new file mode 100644
index 00000000..364ee8e3
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-05-02.cpp	
@@ -0,0 +1,16 @@
+//Write a C program to find sum of all natural numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int i=1,sum=0;
+	int n;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	while(i!=n)
+	{
+	sum=sum+i;
+	i++;	
+	}
+	cout<<"sum="<<sum;
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-06-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-06-02.cpp
new file mode 100644
index 00000000..1c21a079
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-06-02.cpp	
@@ -0,0 +1,19 @@
+//Write a C program to find sum of all even numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	int i=1,sum=0;
+	while(i!=n)
+	{
+		if(i%2==0)
+		{
+			sum=sum+i;
+		}
+		i++;
+	}
+	cout<<"sum="<<sum;
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-07-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-07-02.cpp
new file mode 100644
index 00000000..b21e524a
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-07-02.cpp	
@@ -0,0 +1,19 @@
+//Write a C program to find sum of all odd numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	int i=1,sum=0;
+	while(i!=n)
+	{
+		if(i%2!=0)
+		{
+			sum=sum+i;
+		}
+		i++;
+	}
+	cout<<"sum="<<sum;
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-08-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-08-02.cpp
new file mode 100644
index 00000000..2692176b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-08-02.cpp	
@@ -0,0 +1,13 @@
+//Write a C program to print multiplication table of any number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enternumber twhose table nededs to be printed"<<endl;
+	cin>>n;
+	for(int i=1;i<=10;i++)
+	{
+		cout<<n<<" x "<<i<<" = "<<n*i<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-09-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-09-02.cpp
new file mode 100644
index 00000000..a5f4f492
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-09-02.cpp	
@@ -0,0 +1,16 @@
+//Write a C program to count number of digits in a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,count=0,r;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(n!=0)
+	{
+		r=n%10;
+		count++;
+		n=n/10;
+	}
+	cout<<"no of digits= "<<count;
+}
diff --git a/Sejal Chanchlani/Milestone-02/Problem-10-02.cpp b/Sejal Chanchlani/Milestone-02/Problem-10-02.cpp
new file mode 100644
index 00000000..5530e95d
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/Problem-10-02.cpp	
@@ -0,0 +1,11 @@
+//Write a C program to print all alphabets from a to z. 
+#include<iostream>
+using namespace std;
+int main()
+{
+	char i;
+	for(i='a';i<='z';i++)
+	{
+		cout<<i<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-02/ser.txt b/Sejal Chanchlani/Milestone-02/ser.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-02/ser.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-03/Problem-01-03.cpp b/Sejal Chanchlani/Milestone-03/Problem-01-03.cpp
new file mode 100644
index 00000000..dc030976
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/Problem-01-03.cpp	
@@ -0,0 +1,18 @@
+//Write a C program to find first and last digit of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,r;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	r=n%10;
+	cout<<"last digit = "<<r;
+	while(n!=0)
+	{
+		r=n%10;
+		n=n/10;
+	}
+	cout<<"first digit = "<<r;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-03/problem-02-03.cpp b/Sejal Chanchlani/Milestone-03/problem-02-03.cpp
new file mode 100644
index 00000000..07492dac
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-02-03.cpp	
@@ -0,0 +1,18 @@
+//Write a C program to find sum of first and last digit of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,r1,r2;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	r1=n%10;
+	cout<<"last digit = "<<r1;
+	while(n!=0)
+	{
+		r2=n%10;
+		n=n/10;
+	}
+    cout<<"last digit = "<<r2<<endl;
+    cout<<" sum of first and last digits are = "<<r1+r2;
+}
diff --git a/Sejal Chanchlani/Milestone-03/problem-04-03.cpp b/Sejal Chanchlani/Milestone-03/problem-04-03.cpp
new file mode 100644
index 00000000..e41a2fde
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-04-03.cpp	
@@ -0,0 +1,17 @@
+//Write a C program to calculate sum of digits of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,sum=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(n!=0)
+	{
+		sum=sum+n%10;
+		n=n/10;
+		
+	}
+	cout<<" sum = "<<sum;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-03/problem-05-03.cpp b/Sejal Chanchlani/Milestone-03/problem-05-03.cpp
new file mode 100644
index 00000000..45eedfbb
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-05-03.cpp	
@@ -0,0 +1,16 @@
+//Write a C program to calculate product of digits of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,prod=1;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(n!=0)
+	{
+		prod=prod*(n%10);
+		n=n/10;
+}
+cout<<" prod = "<<prod<<endl;
+}
+		
diff --git a/Sejal Chanchlani/Milestone-03/problem-06-03.cpp b/Sejal Chanchlani/Milestone-03/problem-06-03.cpp
new file mode 100644
index 00000000..4c8ce3b1
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-06-03.cpp	
@@ -0,0 +1,16 @@
+//Write a C program to enter a number and print its reverse.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,r,sum=0;
+	cout<<" enter number "<<endl;
+	cin>>n;
+	while(n!=0)
+	{
+		r=n%10;
+		sum=sum*10+r;
+		n=n/10;
+	}
+	cout<<"reverse number - "<<sum;
+}
diff --git a/Sejal Chanchlani/Milestone-03/problem-07-03.cpp b/Sejal Chanchlani/Milestone-03/problem-07-03.cpp
new file mode 100644
index 00000000..eb923a99
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-07-03.cpp	
@@ -0,0 +1,23 @@
+//Write a C program to check whether a number is palindrome or not.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,temp,r,sum=0;
+	cout<<" enter number "<<endl;
+	cin>>n;
+	temp=n;
+	
+	while(n!=0)
+	{
+		r=n%10;
+		sum=sum*10+r;
+		n=n/10;
+	}
+	if(temp==sum)
+	{
+		cout<<"palindrome number"<<endl;
+	}
+	else
+	cout<<"not a palindrome number"<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-03/problem-08-03.cpp b/Sejal Chanchlani/Milestone-03/problem-08-03.cpp
new file mode 100644
index 00000000..385ce600
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-08-03.cpp	
@@ -0,0 +1,23 @@
+//Write a C program to find frequency of each digit in a given integer.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int n,ele,temp,r,count=0;
+	cout<<" enter number "<<endl;
+	cin>>n;
+	temp=n;
+	cout<<"enter digit whose frequency needs to be found out "<<endl;
+	cin>>ele;
+	while(n!=0)
+	{
+		r=n%10;
+		if(ele==r)
+		{
+			count++;
+		}
+		n=n/10;
+	}
+	cout<<"count of digit = "<<count;
+}
+	
diff --git a/Sejal Chanchlani/Milestone-03/problem-10-03.cpp b/Sejal Chanchlani/Milestone-03/problem-10-03.cpp
new file mode 100644
index 00000000..7663da7d
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/problem-10-03.cpp	
@@ -0,0 +1,12 @@
+//Write a C program to print all ASCII character with their values.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n=1;
+	for(int i=0;i<=225;i++)
+	{
+		cout<<"ASCII Value of "<<(char)i<<" is "<<i<<endl;
+	}
+}
+	
diff --git a/Sejal Chanchlani/Milestone-03/zs.txt b/Sejal Chanchlani/Milestone-03/zs.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-03/zs.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-04/problem-21-04.cpp b/Sejal Chanchlani/Milestone-04/problem-21-04.cpp
new file mode 100644
index 00000000..55413124
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-04/problem-21-04.cpp	
@@ -0,0 +1,18 @@
+//Write a C program to find power of a number using for loop.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,p;
+	long long int x=1;
+	cout<<"enter number whose power needs to be calculated"<<endl;
+	cin>>n;
+	cout<<"enter power"<<endl;
+	cin>>p;
+	while(p)
+	{
+		x=x*n;
+		p--;
+	}
+	cout<<"ans= "<<x;
+}
diff --git a/Sejal Chanchlani/Milestone-04/problem-23-04.cpp b/Sejal Chanchlani/Milestone-04/problem-23-04.cpp
new file mode 100644
index 00000000..8a5f4980
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-04/problem-23-04.cpp	
@@ -0,0 +1,16 @@
+//Write a C program to calculate factorial of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	
+	long long int num,fact=1;
+	cout<<"enter number whose factorial needs to be calculated"<<endl;
+	cin>>num;
+	while(num)
+	{
+		fact=fact*num;
+		num--;
+	}
+	cout<<" factorial = "<<fact;
+}
diff --git a/Sejal Chanchlani/Milestone-04/problem-24-04.cpp b/Sejal Chanchlani/Milestone-04/problem-24-04.cpp
new file mode 100644
index 00000000..6de38f9b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-04/problem-24-04.cpp	
@@ -0,0 +1,20 @@
+//Write a C program to find HCF (GCD) of two numbers.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int num1,num2,hcf=1,min;
+	cout<<"enter first number"<<endl;
+	cin>>num1;
+	cout<<"enter second number"<<endl;
+	cin>>num2;
+	min=(num1<num2)?num1:num2;
+	for(int i=1;i<=min;i++)
+	{
+		if(num1%i==0 && num2%i==0)
+		{
+			hcf=i;
+		}
+	}
+	cout<<"hcf= "<<hcf<<endl;
+	}
diff --git a/Sejal Chanchlani/Milestone-04/problem-25-04.cpp b/Sejal Chanchlani/Milestone-04/problem-25-04.cpp
new file mode 100644
index 00000000..e42f08ca
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-04/problem-25-04.cpp	
@@ -0,0 +1,26 @@
+//Write a C program to find LCM of two numbers.
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long int num1,num2,max,i,lcm;
+	cout<<"enter first number"<<endl;
+	cin>>num1;
+	cout<<"enter second number"<<endl;
+	cin>>num2;
+	max=(num1<num2)?num2:num1;
+	i=max;
+	while(1)
+	{
+		if(i%num1==0 && i%num2==0)
+		{
+			lcm=i;
+			break;
+		}
+	}
+	cout<<"lcm= "<<lcm<<endl;
+
+}
+	
+	
+	
diff --git a/Sejal Chanchlani/Milestone-04/problem22-04.cpp b/Sejal Chanchlani/Milestone-04/problem22-04.cpp
new file mode 100644
index 00000000..fb0f6274
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-04/problem22-04.cpp	
@@ -0,0 +1,16 @@
+//Write a C program to find all factors of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int i;
+	long long int num;
+	cout<<"enter number whose factors needs to be calculated"<<endl;
+	cin>>num;
+	for(int i=1;i<=num;i++)
+	{
+		if(num%i==0)
+		{
+			cout<<i<<" ,";
+		}
+	}}
diff --git a/Sejal Chanchlani/Milestone-05/problem-26-05.cpp b/Sejal Chanchlani/Milestone-05/problem-26-05.cpp
new file mode 100644
index 00000000..9b322e93
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/problem-26-05.cpp	
@@ -0,0 +1,23 @@
+//Write a C program to check whether a number is Prime number or not.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,count=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	for(int i=2;i<=n-1;i++)
+	{
+		if(n%i==0)
+		{
+			count=1;
+			break;
+		}
+	}
+	if(count==1)
+	{
+		cout<<"number is non-prime"<<endl;
+	}
+	else
+	cout<<"number is a prime number";
+}
diff --git a/Sejal Chanchlani/Milestone-05/problem-27-05.cpp b/Sejal Chanchlani/Milestone-05/problem-27-05.cpp
new file mode 100644
index 00000000..a2932f7f
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/problem-27-05.cpp	
@@ -0,0 +1,27 @@
+//Write a C program to print all Prime numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,i=2,count=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(i!=n)
+	{
+		for(int j=2;j<=i-1;j++)
+	    {
+		    if(i%j==0)
+		    {
+			count=1;
+			break;
+		    }
+	   }
+	   if(count!=1)
+	   {
+	cout<<i<<endl;
+       }
+        count=0;
+       i++;
+	
+	}}
+	
diff --git a/Sejal Chanchlani/Milestone-05/problem-28-05.cpp b/Sejal Chanchlani/Milestone-05/problem-28-05.cpp
new file mode 100644
index 00000000..c00d8c3b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/problem-28-05.cpp	
@@ -0,0 +1,27 @@
+//Write a C program to find sum of all prime numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,i=2,count=0,sum=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(i!=n)
+	{
+		for(int j=2;j<=i-1;j++)
+		{
+			if(i%j==0)
+			{
+				count=1;
+				break;
+			}
+		}
+		if(count!=1)
+		{
+			sum=sum+i;
+		}
+		count=0;
+		i++;
+	
+	}
+	cout<<" sum of all prime numbers between 1 and "<<n<<" is "<<sum;}
diff --git a/Sejal Chanchlani/Milestone-05/problem-29-05.cpp b/Sejal Chanchlani/Milestone-05/problem-29-05.cpp
new file mode 100644
index 00000000..045d7734
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/problem-29-05.cpp	
@@ -0,0 +1,30 @@
+// Write a C program to find all prime factors of a number.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,i=2,count=0,sum=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	for(int i=2;i<=n;i++)
+	{
+		if(n%i==0)
+		{
+			for(int j=2;j<=i-1;j++)
+			{
+				if(i%j==0)
+				{
+					count=1;
+					break;
+				}
+			}
+			if(count!=1)
+			{
+				cout<<i<<endl;
+			}
+			i++;
+			count=0;
+		}
+	
+	}}
+	
diff --git a/Sejal Chanchlani/Milestone-05/problem-30-05.cpp b/Sejal Chanchlani/Milestone-05/problem-30-05.cpp
new file mode 100644
index 00000000..ee0d7715
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/problem-30-05.cpp	
@@ -0,0 +1,22 @@
+//Write a C program to check whether a number is Armstrong number or not.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int r,n,sum=0,temp;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	temp=n;
+	while(n!=0)
+	{
+		r=n%10;
+		sum=sum+(r*r*r);
+		n=n/10;	
+	}
+	if(sum==temp)
+	{
+		cout<<temp<<" is an armstrong number "<<endl;
+	}
+	else
+	cout<<" not an armstrong number "<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-05/problem-31-05.cpp b/Sejal Chanchlani/Milestone-05/problem-31-05.cpp
new file mode 100644
index 00000000..72c13280
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/problem-31-05.cpp	
@@ -0,0 +1,26 @@
+//Write a C program to print all Armstrong numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,i=1,temp,r,count=0,sum=0;
+	cout<<"enter limit"<<endl;
+	cin>>n;
+	while(i!=n)
+	{
+		temp=i;
+		sum=0;
+		while(temp!=0)
+		{
+			r=temp%10;
+			sum=sum+(r*r*r);
+			temp=temp/10;
+		}
+		if(sum==i)
+		{
+			cout<<i<<endl;
+		}
+		i++;
+	}
+}
+	
diff --git a/Sejal Chanchlani/Milestone-05/ts.txt b/Sejal Chanchlani/Milestone-05/ts.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-05/ts.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-06/problem-32-06.cpp b/Sejal Chanchlani/Milestone-06/problem-32-06.cpp
new file mode 100644
index 00000000..884c301a
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-06/problem-32-06.cpp	
@@ -0,0 +1,24 @@
+//Write a C program to check whether a number is Perfect number or not.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,temp,sum=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	temp=n;
+	for(int i=1;i<=n/2;i++)
+	{
+		if(n%i==0)
+		{
+			cout<<i<<" "<<endl;
+			sum=sum+i;
+		}
+	}
+	if(sum==n)
+	{
+		cout<<temp<<" is a perfect number"<<endl;
+	}
+	else
+	cout<<temp<<" is not a perfect number";
+}
diff --git a/Sejal Chanchlani/Milestone-06/problem-33-06.cpp b/Sejal Chanchlani/Milestone-06/problem-33-06.cpp
new file mode 100644
index 00000000..bd3735d8
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-06/problem-33-06.cpp	
@@ -0,0 +1,27 @@
+// Write a C program to print all Perfect numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,temp,sum=0,i=1;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(i!=n)
+	{
+		temp=i;
+		sum=0;
+		for(int j=1;j<=temp/2;j++)
+		{
+			if(temp%j==0)
+			{
+				sum=sum+j;
+			}
+		}
+		if(sum==temp)
+		{
+			cout<<temp<<" ";
+		}
+		i++;
+		
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-06/problem-34-06.cpp b/Sejal Chanchlani/Milestone-06/problem-34-06.cpp
new file mode 100644
index 00000000..1ac4572a
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-06/problem-34-06.cpp	
@@ -0,0 +1,29 @@
+//Write a C program to check whether a number is Strong number or not.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,temp,fact,r,sum=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	temp=n;
+	while(n!=0)
+	{
+		fact=1;
+		r=n%10;
+		while(r!=0)
+		{
+			fact=fact*r;
+			r--;
+		}
+		sum=sum+fact;
+		n=n/10;
+		
+	}
+	if(temp==sum)
+	{
+		cout<<temp<<"is a strong number";
+	}
+	else
+	cout<<temp<<" is not a strong no.";
+}
diff --git a/Sejal Chanchlani/Milestone-06/problem-35-06.cpp b/Sejal Chanchlani/Milestone-06/problem-35-06.cpp
new file mode 100644
index 00000000..59b4e3e0
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-06/problem-35-06.cpp	
@@ -0,0 +1,33 @@
+//Write a C program to print all Strong numbers between 1 to n.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,temp,fact,r,sum=0,i=1;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	while(i!=n)
+	{
+		temp=i;
+		sum=0;
+		fact=1;
+		while(temp!=0)
+		{
+			r=temp%10;
+			fact=1;
+		
+			while(r!=0)
+			{
+				fact=fact*r;
+				r--;
+			}
+		
+			sum=sum+fact;
+			temp=temp/10;
+		}
+		if(sum==i){
+		cout<<i<<endl;}
+		i++;
+	}
+	
+}
diff --git a/Sejal Chanchlani/Milestone-06/problem-36-06.cpp b/Sejal Chanchlani/Milestone-06/problem-36-06.cpp
new file mode 100644
index 00000000..61ecc3a6
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-06/problem-36-06.cpp	
@@ -0,0 +1,22 @@
+//Write a C program to print Fibonacci series up to n terms.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,n1=0,n2=1,n3;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	cout<<n1<<" ";
+	cout<<n2<<" ";
+	n3=n1+n2;
+	cout<<n3<<" ";
+	while(n!=3)
+	{
+		n1=n2;
+		n2=n3;
+		n3=n1+n2;
+		cout<<n3<<" ";
+		n--;
+	
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-06/se.txt b/Sejal Chanchlani/Milestone-06/se.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-06/se.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-07/problem-37-07.cpp b/Sejal Chanchlani/Milestone-07/problem-37-07.cpp
new file mode 100644
index 00000000..bd860d96
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-37-07.cpp	
@@ -0,0 +1,26 @@
+// Program to find ones complement of a number.
+#include<iostream>
+#define size 6
+using namespace std;
+int main()
+{
+	
+	char binary[size+1],comp[size+1];
+	cout<<"enter"<<size<<" binary digit"<<endl;
+	cin>>binary;
+	for(int i=0;i<=size;i++)
+	{
+		if(binary[i]=='0')
+		{
+			comp[i]='1';
+		}
+		else if(binary[i]=='1')
+		{
+			comp[i]='0';
+		}
+		else
+		cout<<"enter valid binary number"<<endl;
+	}
+	cout<<"binary number- "<<binary<<endl;
+	cout<<" compliement number "<<comp<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-38-07.cpp b/Sejal Chanchlani/Milestone-07/problem-38-07.cpp
new file mode 100644
index 00000000..7590512b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-38-07.cpp	
@@ -0,0 +1,44 @@
+//Program to find twos complement of a number
+#include<iostream>
+#define SIZE 6
+using namespace std;
+int main()
+{
+	char binary[SIZE+1],ones[SIZE+1],twos[SIZE+1];
+	cout<<"enter "<<SIZE<<"binary string"<<endl;
+	cin>>binary;
+	for(int i=0;i<=SIZE;i++)
+	{
+		if(binary[i]=='1')
+		{
+			ones[i]='0';
+		}
+		else if(binary[i]=='0')
+		{
+			ones[i]='1';
+		}
+	}
+	char carry='1';
+	for(int i=SIZE;i>=0;i--)
+	{
+		if(ones[i]=='1' && carry=='1')
+		{
+			twos[i]='0';
+			carry='1';
+		}
+		else if(ones[i]=='0' && carry=='1')
+		{
+			twos[i]='1';
+			carry='0';
+		}
+		else
+		{
+			twos[i]=ones[i];
+		}
+		
+	}
+	cout<<" Binary string = "<<binary<<endl;
+	cout<<" One's compliment = "<<ones<<endl;
+	cout<<" Two's compliment = "<<twos<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-39-07.cpp b/Sejal Chanchlani/Milestone-07/problem-39-07.cpp
new file mode 100644
index 00000000..f2fce3bb
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-39-07.cpp	
@@ -0,0 +1,27 @@
+// Program to convert binary into octal.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int mat[]={0,1,10,11,100,101,110,111};
+	int r;
+	long long binary,temp,octal=0,place=1;
+	cout<<"enter binary - "<<endl;
+	cin>>binary;
+	temp=binary;
+	while(temp!=0)
+	{
+		r=temp%1000;
+		for(int i=0;i<8;i++)
+		{
+			if(r==mat[i])
+			{
+				octal=octal+(i*place);
+				break;
+			}
+		}
+		place=place*10;
+		temp=temp/1000;
+	}
+	cout<<"Octal number - "<<octal;
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-40-07.cpp b/Sejal Chanchlani/Milestone-07/problem-40-07.cpp
new file mode 100644
index 00000000..fa3f581e
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-40-07.cpp	
@@ -0,0 +1,21 @@
+// Program to convert binary to decimal number system.
+#include<iostream>
+#include<math.h>
+using namespace std;
+int main()
+{
+	long long binary;
+	int i=0,rem,sum=0;
+	cout<<"Enter binary number - "<<endl;
+	cin>>binary;
+	while(binary!=0)
+	{
+		rem=binary%10;
+		sum=sum+rem*(pow(2,i));
+		i++;
+		binary=binary/10;
+	}
+	cout<<" Decimal number - "<<sum<<endl;
+	
+}
+
diff --git a/Sejal Chanchlani/Milestone-07/problem-41(new)-07.cpp b/Sejal Chanchlani/Milestone-07/problem-41(new)-07.cpp
new file mode 100644
index 00000000..8f7521b3
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-41(new)-07.cpp	
@@ -0,0 +1,41 @@
+//Program to convert binary into hexadecimal.
+#include<iostream>
+#include<string.h>
+using namespace std;
+int main()
+{
+	long long binary,temp;
+	int index=0,r;
+	cout<<"enter binary number - "<<endl;
+	cin>>binary;
+	temp=binary;
+	int mat[] = {0, 1, 10, 11, 100, 101, 110, 111, 1000, 
+                         1001, 1010, 1011, 1100, 1101, 1110, 1111};
+	char hexa[20];
+	while(temp!=0)
+	{
+		r=temp%10000;
+		for(int i=0;i<16;i++)
+		{
+		   if(r==mat[i])
+		   {
+		   	if(i<10)
+			   {
+			   	hexa[index]=(char)(48+i);
+			   }
+			else
+			   {
+				hexa[index]=(char)(65+(i-10));
+			   }
+			index++;
+			break;
+		   }
+	    }
+	    temp=temp/10000;
+    }
+		hexa[index]='\0';
+		cout<<hexa<<endl;
+		strrev(hexa);		
+	cout<<"hexadecimal - "<<hexa;
+}
+
diff --git a/Sejal Chanchlani/Milestone-07/problem-42-07.cpp b/Sejal Chanchlani/Milestone-07/problem-42-07.cpp
new file mode 100644
index 00000000..95bfc3cb
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-42-07.cpp	
@@ -0,0 +1,21 @@
+//Write a C program to convert Octal to Binary number system.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int mat[]={0,1,10,11,100,101,110,111};
+	int octal,temp,rem,place=1;
+	long long binary=0;
+	cout<<"enter octal number - "<<endl;
+	cin>>octal;
+	temp=octal;
+	while(temp!=0)
+	{
+		rem=temp%10;
+		binary=(mat[rem]*place)+binary;
+		temp=temp/10;
+		place=place*1000;	
+	}
+	cout<<"binary - "<<binary;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-43-07.cpp b/Sejal Chanchlani/Milestone-07/problem-43-07.cpp
new file mode 100644
index 00000000..b6e3aac5
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-43-07.cpp	
@@ -0,0 +1,21 @@
+//Write a C program to convert Octal to Binary number system.
+#include<iostream>
+#include<math.h>
+using namespace std;
+int main()
+{
+	int octal,temp,dec=0,i=0,r;
+	cout<<"enter octal number -"<<endl;
+	cin>>octal;
+	temp=octal;
+	while(temp!=0)
+	{
+		r=temp%10;
+		dec=dec+(r*pow(8,i));
+		i++;
+		temp=temp/10;
+	}
+	cout<<"octal number - "<<octal<<endl;
+	cout<<"decimal number - "<<dec<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-44-07.cpp b/Sejal Chanchlani/Milestone-07/problem-44-07.cpp
new file mode 100644
index 00000000..ecd88746
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-44-07.cpp	
@@ -0,0 +1,48 @@
+//Program to convert octal to hexadecimal.
+#include<iostream>
+#include<string.h>
+using namespace std;
+int main()
+{
+	int mat[] = {0, 1, 10, 11, 100, 101, 110, 111, 1000, 
+                         1001, 1010, 1011, 1100, 1101, 1110, 1111};
+	int octal,temp,place=1,binary=0,r;
+	cout<<"enter octal number"<<endl;
+	cin>>octal;
+	temp=octal;
+	int index=0;
+	char hexa[20];
+	while(temp!=0)
+	{
+		r=temp%10;
+		binary=(mat[r]*place)+binary;
+		place=place*1000;
+		temp=temp/10;
+	}
+	//cout<<"hexadecimal number - "<<binary<<endl;
+	while(binary!=0)
+	{
+		r=binary%10000;
+		for(int i=0;i<16;i++)
+		{
+			if(r==mat[i])
+			{
+				if(i<10)
+				{
+					hexa[index]=(char)(48+i);
+				}
+				else
+				{
+				    hexa[index]=(char)(65+(i-10));	
+				}
+				index++;
+				break;
+			}
+		}
+		binary=binary/10000;
+	}
+	hexa[index]='\0';
+	strrev(hexa);
+	cout<<"Hexadecimal - "<<hexa<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-45-07.cpp b/Sejal Chanchlani/Milestone-07/problem-45-07.cpp
new file mode 100644
index 00000000..71154a90
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-45-07.cpp	
@@ -0,0 +1,24 @@
+// program to convert decimal into binary number.
+#include<iostream>
+#include<string.h>
+using namespace std;
+int main()
+{
+	int decimal,temp,index=0;
+	cout<<"enter decimal number"<<endl;
+	cin>>decimal;
+	temp=decimal;
+	char binary[65];
+	while(temp>0)
+	{
+		binary[index]=temp%2+'0';
+		cout<<binary<<" ";
+		temp=temp/2;
+		index++;
+	}
+	cout<<endl;
+	//binary[index] = '\0';
+	strrev(binary);
+	cout<<"binary number - "<<binary<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-46-07.cpp b/Sejal Chanchlani/Milestone-07/problem-46-07.cpp
new file mode 100644
index 00000000..2fbb1ed1
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-46-07.cpp	
@@ -0,0 +1,19 @@
+// Program to convert decimal to octal.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int decimal,octal,temp,r,place=1;
+	cout<<"enter decimal number"<<endl;
+	cin>>decimal;
+	temp=decimal;
+	while(temp>0)
+	{
+		r=temp%8;
+		octal=(place*r)+octal;
+		place=place*10;
+		temp=temp/8;
+	}
+	cout<<"octal number - "<<octal;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-47(new)-07.cpp b/Sejal Chanchlani/Milestone-07/problem-47(new)-07.cpp
new file mode 100644
index 00000000..7ec01ace
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-47(new)-07.cpp	
@@ -0,0 +1,23 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+int main()
+{
+	char mat[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};
+	int r;
+	int decimal,temp,index=0;
+	cout<<"enter decimal number"<<endl;
+	cin>>decimal;
+	temp=decimal;
+	char hexa[65];
+	while(temp>0)
+	{
+		r=temp%16;
+		hexa[index]=mat[r];
+		index++;
+		temp=temp/16;
+	}
+	hexa[index]='\0';
+	strrev(hexa);
+	cout<<"Hexadecimal - "<<hexa<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-48-07.cpp b/Sejal Chanchlani/Milestone-07/problem-48-07.cpp
new file mode 100644
index 00000000..1a07a703
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-48-07.cpp	
@@ -0,0 +1,100 @@
+#include <iostream>
+#include <string.h>
+using namespace std;
+int main()
+{
+    char hex[17]; 
+	char bin[65] ="" ;
+    int i = 0,index=0;
+
+    /* Input hexadecimal number from user */
+  
+    cout<<"Enter any hexadecimal number: ";
+    cin>>hex;
+
+    /* Extract first digit and find binary of each hex digit */
+    for(i=0; hex[i]!='\0'; i++)
+    {
+        switch(hex[i])
+        {
+            case '0':
+                strcat(bin, "0000");
+            
+                break;
+            case '1':
+                strcat(bin, "0001");
+                
+                break;
+            case '2':
+                strcat(bin, "0010");
+            
+                break;
+            case '3':
+                strcat(bin, "0011");
+               
+                break;
+            case '4':
+                strcat(bin, "0100");
+              
+                break;
+            case '5':
+                strcat(bin, "0101");
+                
+                break;
+            case '6':
+                strcat(bin, "0110");
+               
+                break;
+            case '7':
+                strcat(bin, "0111");
+                
+                break;
+            case '8':
+                strcat(bin, "1000");
+                
+                break;
+            case '9':
+                strcat(bin, "1001");
+               
+                break;
+            case 'a':
+            case 'A':
+                strcat(bin, "1010");
+                
+                break;
+            case 'b':
+            case 'B':
+                strcat(bin, "1011");
+            
+                break;
+            case 'c':
+            case 'C':
+                strcat(bin, "1100");
+                
+                break;
+            case 'd':
+            case 'D':
+                strcat(bin, "1101");
+               
+                break;
+            case 'e':
+            case 'E':
+                strcat(bin, "1110");
+               
+                break;
+            case 'f':
+            case 'F':
+                strcat(bin, "1111");
+               
+                break;
+            default:
+                cout<<"Invalid hexadecimal input."<<endl;
+        }
+        
+    }
+
+    cout<<"Hexademial number = "<<hex;
+    cout<<"Binary number = "<<bin;
+
+    return 0;
+}
diff --git a/Sejal Chanchlani/Milestone-07/problem-49-07.cpp b/Sejal Chanchlani/Milestone-07/problem-49-07.cpp
new file mode 100644
index 00000000..0d998539
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-49-07.cpp	
@@ -0,0 +1,45 @@
+//program to convert hexadecimal to octal number.
+#include<iostream>
+#include<string.h>
+#include<math.h>
+using namespace std;
+int main()
+{
+	char hex[65];
+	cout<<"enter hexadecimal number"<<endl;
+	cin>>hex;
+	long decimal,val;
+	int len=strlen(hex);
+	len--;
+	for(int i=0;hex[i]!='\0';i++)
+	{
+		 if(hex[i]>='0' && hex[i]<='9')
+        {
+            val = hex[i] - 48;
+        }
+        else if(hex[i]>='a' && hex[i]<='f')
+        {
+            val = hex[i] - 97 + 10;
+        }
+        else if(hex[i]>='A' && hex[i]<='F')
+        {
+            val = hex[i] - 65 + 10;
+        }
+
+        decimal += val * pow(16, len);
+        len--;
+    }
+    
+    int octal=0,place=1,r;
+    while(decimal!=0)
+    {
+    	r=decimal%8;
+    	octal=(r*place)+octal;
+    	decimal=decimal/8;
+    	place=place*10;
+	}
+	cout<<"Octal- "<<octal;
+	}
+	
+
+
diff --git a/Sejal Chanchlani/Milestone-07/problem-50-07.cpp b/Sejal Chanchlani/Milestone-07/problem-50-07.cpp
new file mode 100644
index 00000000..7bf016ba
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/problem-50-07.cpp	
@@ -0,0 +1,33 @@
+//program to convert hexadecimal to decimal.
+#include<iostream>
+#include<math.h>
+#include<string.h>
+using namespace std;
+int main()
+{
+	char hex[65];
+	cout<<"enter hexadecimal number"<<endl;
+	cin>>hex;
+	int len=strlen(hex);
+	len--;
+	int val,decimal=0;
+	for(int i=0;hex[i]!='\0';i++)
+	{
+		if(hex[i]>='0' && hex[i]<='9')
+		{
+			val=hex[i]-48;
+		}
+		else if(hex[i]>='a' && hex[i]<='f')
+        {
+            val = hex[i] - 97 + 10;
+        }
+        else if(hex[i]>='A' && hex[i]<='F')
+        {
+            val = hex[i] - 65 + 10;
+        }
+
+        decimal += val * pow(16, len);
+        len--;
+    }
+    cout<<"decimal number -"<<decimal;
+}
diff --git a/Sejal Chanchlani/Milestone-07/ses.txt b/Sejal Chanchlani/Milestone-07/ses.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-07/ses.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-10/problem-01-10.cpp b/Sejal Chanchlani/Milestone-10/problem-01-10.cpp
new file mode 100644
index 00000000..e4618ea2
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-01-10.cpp	
@@ -0,0 +1,18 @@
+//Problem-01-10
+#include<iostream>
+using namespace std;
+int add(int a, int b)
+{
+	return a+b;
+}
+int main()
+{
+	int x,y;
+	cout<<"enter first number"<<endl;
+	cin>>x;
+	cout<<"enter second number"<<endl;
+	cin>>y;
+	int z=add(x,y);
+	cout<<"addition of two numbers is "<<z<<"."<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-02-10.cpp b/Sejal Chanchlani/Milestone-10/problem-02-10.cpp
new file mode 100644
index 00000000..c0906625
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-02-10.cpp	
@@ -0,0 +1,18 @@
+//problem-02-10
+#include<iostream>
+using namespace std;
+int product(int a,int b)
+{
+	return a*b;
+}
+int main()
+{
+	int x,y,z;
+	cout<<"enter first number"<<endl;
+	cin>>x;
+		cout<<"enter second number"<<endl;
+	cin>>y;
+	z=product(x,y);
+	cout<<"product of"<<x<<" & "<<y<<"is"<<z<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-03-10.cpp b/Sejal Chanchlani/Milestone-10/problem-03-10.cpp
new file mode 100644
index 00000000..a88242bc
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-03-10.cpp	
@@ -0,0 +1,21 @@
+//problem-03-10
+#include<iostream>
+using namespace std;
+double area(double r)
+{
+	return 3.14*r*r;
+}
+double circ(double r)
+{
+	return 2*3.14*r;
+}
+int main()
+{
+	double r,x,y;
+	cout<<"enter radius"<<endl;
+	cin>>r;
+	x=area(r);
+	cout<<"Area = "<<x<<endl;
+	y=circ(r);
+	cout<<"Circumference = "<<y<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-04-10.cpp b/Sejal Chanchlani/Milestone-10/problem-04-10.cpp
new file mode 100644
index 00000000..5ec3417d
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-04-10.cpp	
@@ -0,0 +1,47 @@
+//problem-04-10
+#include<iostream>
+using namespace std;
+int max(int x,int y,int z)
+{
+	if (x>y && x>z)
+	{
+		return x;
+	}
+	else if(y>x && y>z)
+	{
+		return y;
+	}
+	else
+	{
+		return z;
+	}
+}
+int min(int x,int y,int z)
+{
+	if (x<y && x<z)
+	{
+		return x;
+	}
+	else if(y<x && y<z)
+	{
+		return y;
+	}
+	else
+	{
+		return z;
+	}
+}
+int main()
+{
+	int x,y,z,g,h;
+	cout<<"enter first number"<<endl;
+	cin>>x;
+		cout<<"enter second number"<<endl;
+	cin>>y;
+	cout<<"enter third number"<<endl;
+	cin>>z;
+	g=max(x,y,z);
+	h=min(x,y,z);
+	cout<<"Maximum = "<<g<<endl;
+	cout<<"Minimum = "<<h<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-05-10.cpp b/Sejal Chanchlani/Milestone-10/problem-05-10.cpp
new file mode 100644
index 00000000..c20eb72f
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-05-10.cpp	
@@ -0,0 +1,21 @@
+//problem-05-10.
+#include<iostream>
+using namespace std;
+int fun(int x)
+{
+	if(x%2==0)
+	{
+		cout<<x<<" is an even number."<<endl;
+	}
+	else{
+		cout<<x<<" is an odd number"<<endl;
+	}
+}
+int main()
+{
+	int x;
+	cout<<"enter number"<<endl;
+	cin>>x;
+	fun(x);
+	
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-06-10.cpp b/Sejal Chanchlani/Milestone-10/problem-06-10.cpp
new file mode 100644
index 00000000..ce3ec305
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-06-10.cpp	
@@ -0,0 +1,21 @@
+//problem-06-10
+#include<iostream>
+using namespace std;
+void age(int x)
+{
+	if(x>=18)
+	{
+		cout<<"You are eligible to vote"<<endl;
+		
+	}
+	else{
+		cout<<"You are not eligible to vote";
+	}
+}
+int main()
+{
+	int x;
+	cout<<"enter age"<<endl;
+	cin>>x;
+	age(x);
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-07-10.cpp b/Sejal Chanchlani/Milestone-10/problem-07-10.cpp
new file mode 100644
index 00000000..448d554d
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-07-10.cpp	
@@ -0,0 +1,29 @@
+//problem-07-10
+#include<iostream>
+using namespace std;
+void prime(int x)
+{
+	int count=0;
+	for(int i=2;i<x;i++)
+	{
+		if(x%i==0)
+		{
+			count=1;
+		}
+	}
+	if(count==0)
+	{
+		cout<<x<<" is a prime number"<<endl;
+	}
+	else{
+		cout<<x<<" is not a prime number"<<endl;
+	}
+}
+int main()
+{
+	int x;
+	cout<<"enter number"<<endl;
+	cin>>x;
+	prime(x);
+	
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-08-10.cpp b/Sejal Chanchlani/Milestone-10/problem-08-10.cpp
new file mode 100644
index 00000000..924c1f35
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-08-10.cpp	
@@ -0,0 +1,42 @@
+//problem-07-10
+#include<iostream>
+using namespace std;
+void marks(int x)
+{
+	if(x>=91 && x<=100)
+	{
+		cout<<"ft"<<endl;
+		cout<<"Grade - "<<"AA"<<endl;
+	}
+	else if(x>=81 && x<=90)
+	{
+		cout<<"lk"<<endl;
+		cout<<"Grade - "<<"AB"<<endl;
+	}
+	else if(x>=71 && x<=80)
+	{
+		cout<<"Grade - "<<"BB"<<endl;
+	}
+	else if(x>=61 && x<=70)
+	{
+		cout<<"Grade - "<<"BC"<<endl;
+	}
+	else if(x>=51 && x<=60)
+	{
+		cout<<"Grade - "<<"CD"<<endl;
+	}
+	else if(x>=41 && x<=70)
+	{
+		cout<<"Grade - "<<"DD"<<endl;
+	}
+	else{
+		cout<<"fail"<<endl;
+	}
+}
+int main()
+{
+int x;
+cout<<"enter marks out of hundred"<<endl;
+cin>>x;
+marks(x);
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-09-10.cpp b/Sejal Chanchlani/Milestone-10/problem-09-10.cpp
new file mode 100644
index 00000000..9584a02b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-09-10.cpp	
@@ -0,0 +1,20 @@
+//problem-08-10
+#include<iostream>
+using namespace std;
+int factorial(int x)
+{
+	int fact=1;
+	while(x)
+	{
+		fact=fact*x;
+		x--;
+	}
+	return fact;
+}
+int main()
+{
+	int x;
+	cout<<"enter number"<<endl;
+	cin>>x;
+	cout<<"factorial of "<<x<<" is "<<factorial(x);
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-10-10.cpp b/Sejal Chanchlani/Milestone-10/problem-10-10.cpp
new file mode 100644
index 00000000..1833948a
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-10-10.cpp	
@@ -0,0 +1,15 @@
+//problem-10-10
+#include<iostream>
+using namespace std;
+int cube(int x)
+{
+	return x*x*x;
+}
+int main()
+{
+	int x;
+	cout<<"enter x"<<endl;
+	cin>>x;
+	int n=cube(x);
+	cout<<"cube of "<<x<<" is "<<n;
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-11-10.cpp b/Sejal Chanchlani/Milestone-10/problem-11-10.cpp
new file mode 100644
index 00000000..0feb4de8
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-11-10.cpp	
@@ -0,0 +1,25 @@
+//problem-11-10
+#include<iostream>
+using namespace std;
+double dia(double r)
+{
+	return 2*r;
+}
+double circum(double r)
+{
+	return 2*3.14*r;
+}
+double area(double r)
+{
+	return 3.14*r*r;
+}
+int main()
+{
+	double r;
+	cout<<"enter radius"<<endl;
+	cin>>r;
+	cout<<"Diameter of circle is "<<dia(r)<<endl;
+	cout<<"Area of cicle is "<<area(r)<<endl;
+	cout<<"Circumference of circle is"<<circum(r)<<endl;	
+	
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-12-10.cpp b/Sejal Chanchlani/Milestone-10/problem-12-10.cpp
new file mode 100644
index 00000000..313e62b5
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-12-10.cpp	
@@ -0,0 +1,24 @@
+//problem-12-10
+#include<iostream>
+using namespace std;
+void fun(int x,int y)
+{
+	if(x>y)
+	{
+		cout<<x<<" is greater than "<<y<<endl;
+	}
+	else
+	{
+		cout<<x<<" is less than "<<y<<endl;
+	}
+}
+int main()
+{
+	int x,y;
+	cout<<"enter first number"<<endl;
+	cin>>x;
+	cout<<"enter second number"<<endl;
+	cin>>y;
+	fun(x,y);
+	
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-13-10.cpp b/Sejal Chanchlani/Milestone-10/problem-13-10.cpp
new file mode 100644
index 00000000..f8d9e004
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-13-10.cpp	
@@ -0,0 +1,65 @@
+//problem-13-10
+#include<iostream>
+using namespace std;
+void prime(int x)
+{
+	int count=0;
+	for(int i=2;i<x;i++)
+	{
+		if(x%i==0)
+		{
+			count=1;
+		}
+	}
+	if(count==1)
+	{
+		cout<<x<<" is not a prime number"<<endl;
+	}
+	else{
+		cout<<x<<" is a prime number"<<endl;
+	}
+}
+void perfect(int x)
+{
+	int sum=0;
+	for(int i=1;i<x;i++)
+	{
+		if(x%i==0)
+		{
+			sum=sum+i;
+		}
+	}
+	if(sum==x)
+	{
+		cout<<x<<" is a perfect number"<<endl;
+	}
+	else{
+		cout<<x<<" is not a perfect number"<<endl;
+	}
+}
+void armstrong(int x)
+{
+	int sum=0,r,temp=x;
+	while(x)
+	{
+		r=x%10;
+		sum=sum+(r*r*r);
+		x=x/10;
+	}
+	if(sum==temp)
+	{
+		cout<<temp<<" is an armstrong number"<<endl;
+	}
+	else{
+		cout<<temp<<" is not an armstrong number"<<endl;
+	}
+}
+int main()
+{
+	int x;
+	cout<<"enter number "<<endl;
+	cin>>x;
+	prime(x);
+	perfect(x);
+	armstrong(x);
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-14-10.exe b/Sejal Chanchlani/Milestone-10/problem-14-10.exe
new file mode 100644
index 00000000..71c4edb2
Binary files /dev/null and b/Sejal Chanchlani/Milestone-10/problem-14-10.exe differ
diff --git a/Sejal Chanchlani/Milestone-10/problem-15-10.cpp b/Sejal Chanchlani/Milestone-10/problem-15-10.cpp
new file mode 100644
index 00000000..1a745a87
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-15-10.cpp	
@@ -0,0 +1,31 @@
+//problem-15-10
+#include<iostream>
+using namespace std;
+void armstrong(int a,int b)
+{
+	int sum=0,r,temp;
+	for(int i=b;i<a;i++)
+	{
+		temp=i;
+		while(temp)
+		{
+			r=temp%10;
+			sum=sum+(r*r*r);
+			temp=temp/10;
+		}
+		if(i==sum)
+		{
+			cout<<i<<endl;
+		}
+		sum=0;
+	}
+}
+int main()
+{
+	int a,b;
+	cout<<"enter upper limit"<<endl;
+	cin>>a;
+	cout<<"enter lower limit"<<endl;
+	cin>>b;
+	armstrong(a,b);
+}
diff --git a/Sejal Chanchlani/Milestone-10/problem-16-10.cpp b/Sejal Chanchlani/Milestone-10/problem-16-10.cpp
new file mode 100644
index 00000000..05d0f12e
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-10/problem-16-10.cpp	
@@ -0,0 +1,31 @@
+//problem-16-10
+#include<iostream>
+using namespace std;
+void perfect(int a,int b)
+{
+	int sum;
+	for(int i=b;i<=a;i++)
+	{
+		for(int j=1;j<i;j++)
+		{
+			if(i%j==0)
+			{
+				sum=sum+j;
+			}
+		}
+		if(sum==i)
+		{
+			cout<<i<<endl;
+		}
+		sum=0;
+	}
+}
+int main()
+{
+	int a,b;
+	cout<<"enter upper limit"<<endl;
+	cin>>a;
+	cout<<"enter lower limit"<<endl;
+	cin>>b;
+	perfect(a,b);
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-01-11.cpp b/Sejal Chanchlani/Milestone-11/problem-01-11.cpp
new file mode 100644
index 00000000..7198a43f
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-01-11.cpp	
@@ -0,0 +1,17 @@
+//problem-01-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int arr[10];
+	for(int i=0;i<10;i++)
+	{
+		cout<<"enter "<<i<<"th element"<<endl;
+		cin>>arr[i];
+	}
+		for(int i=0;i<10;i++)
+	{
+		
+		cout<<arr[i];
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-02-11.cpp b/Sejal Chanchlani/Milestone-11/problem-02-11.cpp
new file mode 100644
index 00000000..0a72392c
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-02-11.cpp	
@@ -0,0 +1,28 @@
+//problem-02-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int arr[10];
+	for(int i=0;i<10;i++)
+	{
+		cout<<"enter "<<i<<"th element"<<endl;
+		cin>>arr[i];
+	}
+		for(int i=0;i<10;i++)
+	{
+		
+		cout<<arr[i]<<endl;
+	}
+	int x;
+	cout<<"enter number to be searched"<<endl;
+	cin>>x;
+	for(int i=0;i<10;i++)
+	{
+		if(x==arr[i])
+		{
+			cout<<"element found at "<<i<<" th index"<<endl;
+			break;
+		}
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-03-11.cpp b/Sejal Chanchlani/Milestone-11/problem-03-11.cpp
new file mode 100644
index 00000000..842611a8
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-03-11.cpp	
@@ -0,0 +1,27 @@
+//problem-03-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int arr[10],brr[10];
+	for(int i=0;i<10;i++)
+	{
+		cout<<"enter "<<i<<"th element"<<endl;
+		cin>>arr[i];
+	}
+		for(int i=0;i<10;i++)
+	{
+		
+		cout<<arr[i]<<endl;
+	}
+	int j=9;
+	for(int i=0;i<10;i++)
+	{
+		brr[i]=arr[j];
+		j--;
+	}
+	for(int i=0;i<10;i++)
+	{
+		cout<<brr[i]<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-04-11.cpp b/Sejal Chanchlani/Milestone-11/problem-04-11.cpp
new file mode 100644
index 00000000..b674053c
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-04-11.cpp	
@@ -0,0 +1,21 @@
+//problem-04-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int arr[10],sum=0,prod=1;
+	for(int i=0;i<10;i++)
+	{
+		cout<<"enter "<<i<<"th element"<<endl;
+		cin>>arr[i];
+		sum=sum+arr[i];
+		prod=prod*arr[i];
+	}
+		for(int i=0;i<10;i++)
+	{
+		
+		cout<<arr[i]<<endl;
+	}
+	cout<<"Sum= "<<sum<<endl;
+	cout<<"Product = "<<prod;
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-05-11.cpp b/Sejal Chanchlani/Milestone-11/problem-05-11.cpp
new file mode 100644
index 00000000..8123cf75
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-05-11.cpp	
@@ -0,0 +1,32 @@
+//problem-05-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,max,min;
+	cout<<"enter array size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cout<<"enter "<<i<<" th element"<<endl;
+		cin>>arr[i];
+	}
+	max=arr[0],min=arr[0];
+	for(int i=0;i<n;i++)
+	{
+		if(max<=arr[i])
+		{
+			max=arr[i];
+		}
+	}
+	cout<<"Maximum element - "<<max<<endl;
+	for(int i=0;i<n;i++)
+	{
+		if(min>=arr[i])
+		{
+			min=arr[i];
+		}
+	}
+	cout<<"Minimum element - "<<min<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-06-11.cpp b/Sejal Chanchlani/Milestone-11/problem-06-11.cpp
new file mode 100644
index 00000000..5f67eb8b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-06-11.cpp	
@@ -0,0 +1,35 @@
+//problem-06-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter array size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int count=0,j=n-1;
+	for(int i=0;i<=n/2;i++)
+	{
+		if(arr[i]!=arr[j])
+		{
+			count=1;
+			break;
+		}
+		else{
+			j--;
+		}
+	}
+	if(count==0)
+	{
+		cout<<"Same elements from both ends";
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-07-11.cpp b/Sejal Chanchlani/Milestone-11/problem-07-11.cpp
new file mode 100644
index 00000000..7c0864e6
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-07-11.cpp	
@@ -0,0 +1,21 @@
+//problem-07-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int arr[10],brr[5];
+	for(int i=0;i<10;i++)
+	{
+		cin>>arr[i];
+	}
+	int j=5;
+	for(int i=0;i<5;i++)
+	{
+		brr[i]=arr[j];
+		j++;
+	}
+	for(int i=0;i<5;i++)
+	{
+		cout<<brr[i]<<' ';
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-08-11.cpp b/Sejal Chanchlani/Milestone-11/problem-08-11.cpp
new file mode 100644
index 00000000..923def36
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-08-11.cpp	
@@ -0,0 +1,34 @@
+//problem-08-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,sum=0,prod=1,max,min;
+	cout<<"enter size of array"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+		sum=sum+arr[i];
+		prod=prod*arr[i];
+	}
+	max=arr[0];
+	min=arr[0];
+	for(int i=0;i<n;i++)
+	{
+		if(max<=arr[i])
+		{
+			max=arr[i];
+		}
+		if(min>=arr[i])
+		{
+			min=arr[i];
+		}
+	}
+	cout<<"sum = "<<sum<<endl;
+	cout<<"product = "<<prod<<endl;
+	cout<<"average = "<<sum/n<<endl;
+	cout<<"maximum = "<<max<<endl;
+	cout<<"minimum = "<<min;
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-09-11.cpp b/Sejal Chanchlani/Milestone-11/problem-09-11.cpp
new file mode 100644
index 00000000..fcb528a9
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-09-11.cpp	
@@ -0,0 +1,37 @@
+//problem-09-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int arr[]={4,8,6,3,2};
+	int max=arr[0],x;
+	for(int i=0;i<5;i++)
+	{
+		if(max<=arr[i])
+		{
+			max=arr[i];
+		}
+	}
+	for(int i=0;i<5;i++)
+	{
+		if(max>arr[i] && arr[i]>x)
+		{
+			x=arr[i];
+		}
+	}
+	cout<<"greatest element - "<<max<<endl;
+	cout<<"second greatest element - "<<x;
+	int brr[10];
+	brr[0]=4;
+	brr[1]=x;
+	brr[2]=max-x;
+	brr[3]=6;
+	brr[4]=3;
+	brr[5]=2;
+	for(int i=0;i<6;i++)
+	{
+		cout<<brr[i]<<" ";
+	}
+	
+	
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-10-11'.cpp b/Sejal Chanchlani/Milestone-11/problem-10-11'.cpp
new file mode 100644
index 00000000..c7d4a11d
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-10-11'.cpp	
@@ -0,0 +1,29 @@
+//problem-10-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size of array"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int temp=arr[n-1];
+	for(int i=n-1;i>=0;i--)
+	{
+		arr[i]=arr[i-1];
+	}
+	arr[0]=temp;
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-11-11.cpp b/Sejal Chanchlani/Milestone-11/problem-11-11.cpp
new file mode 100644
index 00000000..b1d3a44e
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-11-11.cpp	
@@ -0,0 +1,37 @@
+//problem-11-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	int max,temp;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	for(int i=0;i<n;i++)
+	{
+		max=arr[i];
+		for(int j=i+1;j<n;j++)
+		{
+			if(max>arr[j])
+			{
+				temp=arr[i];
+				arr[i]=arr[j];
+				arr[j]=temp;
+			}
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-12-11.cpp b/Sejal Chanchlani/Milestone-11/problem-12-11.cpp
new file mode 100644
index 00000000..57ee8d0c
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-12-11.cpp	
@@ -0,0 +1,18 @@
+//problem-12-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,temp,r,sum=0;
+	cout<<"enter number"<<endl;
+	cin>>n;
+	temp=n;
+	while(temp!=0)
+	{
+		r=temp%10;
+		sum=sum+r;
+		temp=temp/10;
+	}
+	cout<<"sum of digits of number is "<<sum;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-13-11.cpp b/Sejal Chanchlani/Milestone-11/problem-13-11.cpp
new file mode 100644
index 00000000..4369c6c1
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-13-11.cpp	
@@ -0,0 +1,27 @@
+//problem-13-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	cout<<"negative elements are - "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]<0)
+		{
+			cout<<arr[i]<<" ";
+		}
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-14-11.cpp b/Sejal Chanchlani/Milestone-11/problem-14-11.cpp
new file mode 100644
index 00000000..ef0552fd
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-14-11.cpp	
@@ -0,0 +1,36 @@
+//problem-14-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int max,sec_max=arr[0];
+	max=arr[0];
+	for(int i=0;i<n;i++)
+	{
+		if(max<=arr[i])
+		{
+			max=arr[i];
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]<max && sec_max<arr[i])
+		{
+			sec_max=arr[i];
+		}
+	}
+	cout<<"Second largest number "<<sec_max<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-15-11.cpp b/Sejal Chanchlani/Milestone-11/problem-15-11.cpp
new file mode 100644
index 00000000..c828cb35
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-15-11.cpp	
@@ -0,0 +1,33 @@
+//problem-15-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int count_odd=0,count_even=0;
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]%2==0)
+		{
+			count_even=count_even+1;
+		}
+		else
+		{
+			count_odd=count_odd+1;
+		}
+	}
+	cout<<"Count of even numbers"<<count_even<<endl;
+	cout<<"count of odd numbers "<<count_odd<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-16-11.cpp b/Sejal Chanchlani/Milestone-11/problem-16-11.cpp
new file mode 100644
index 00000000..176485cb
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-16-11.cpp	
@@ -0,0 +1,30 @@
+//problem-15-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int count=0;
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]<0)
+		{
+			count=count+1;
+		}
+	
+	}
+	cout<<"Count of negative numbers"<<count<<endl;
+	
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-17-11.cpp b/Sejal Chanchlani/Milestone-11/problem-17-11.cpp
new file mode 100644
index 00000000..f1f9cecd
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-17-11.cpp	
@@ -0,0 +1,34 @@
+//problem-15-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int pos,x;
+	cout<<"enter element to be inserted "<<endl;
+	cin>>x;
+	cout<<"enter the position "<<endl;
+	cin>>pos;
+	for(int i=n;i>=n-pos;i--)
+	{
+	    arr[i]=arr[i-1];
+	}
+	arr[pos]=x;
+	for(int i=0;i<n+1;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-18-11.cpp b/Sejal Chanchlani/Milestone-11/problem-18-11.cpp
new file mode 100644
index 00000000..0f719382
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-18-11.cpp	
@@ -0,0 +1,30 @@
+//problem-15-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int pos;
+	cout<<"enter postion"<<endl;
+	cin>>pos;
+	for(int i=pos-1;i<n-1;i++)
+	{
+	arr[i]=arr[i+1];
+}
+for(int i=0;i<n-1;i++)
+{
+	cout<<arr[i]<<" ";
+}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-19-11.cpp b/Sejal Chanchlani/Milestone-11/problem-19-11.cpp
new file mode 100644
index 00000000..7c4d3faa
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-19-11.cpp	
@@ -0,0 +1,44 @@
+//problem-19-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size "<<endl;
+	cin>>n;
+	int arr[n],brr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+		brr[i]=-1;
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int count;
+	for(int i=0;i<n;i++)
+	{
+		count=1;
+		for(int j=i+1;j<n;j++)
+		{
+			if(arr[i]==arr[j])
+			{
+				count=count+1;
+				brr[j]=0;
+			}
+		}
+		if(brr[i]!=0)
+		{
+			brr[i]=count;
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		if(brr[i]!=0)
+		{
+			cout<<arr[i]<<" occurred "<<brr[i]<<" times"<<endl;
+		}
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-20-11.cpp b/Sejal Chanchlani/Milestone-11/problem-20-11.cpp
new file mode 100644
index 00000000..77655905
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-20-11.cpp	
@@ -0,0 +1,45 @@
+//problem-20-11- unique elements in an array
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size "<<endl;
+	cin>>n;
+	int arr[n],brr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+		brr[i]=-1;
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int count;
+	for(int i=0;i<n;i++)
+	{
+		count=1;
+		for(int j=i+1;j<n;j++)
+		{
+			if(arr[i]==arr[j])
+			{
+				count++;
+				brr[j]=0;
+			}
+		}
+		if(brr[i]!=0)
+		{
+			brr[i]=count;
+		}
+	}
+	cout<<"unique elements are as follows - "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		if(brr[i]==1)
+		{
+			cout<<arr[i]<<endl;
+		}
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-21-11.cpp b/Sejal Chanchlani/Milestone-11/problem-21-11.cpp
new file mode 100644
index 00000000..874771a9
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-21-11.cpp	
@@ -0,0 +1,45 @@
+//problem-21-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n],brr[n],crr[n+n];
+	cout<<"enter elements of first array"<<endl;
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	cout<<"enter elements of second array"<<endl;
+	for(int i=0;i<n;i++)
+	{
+		cin>>brr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<brr[i]<<" ";
+	}
+	cout<<endl;
+	int j=0;
+	for(int i=0;i<n;i++)
+	{
+		crr[i]=arr[i];
+		j++;
+	}
+	for(int i=0;i<n;i++)
+	{
+		crr[j]=brr[i];
+		j++;
+	}
+	for(int i=0;i<n+n;i++)
+	{
+		cout<<crr[i]<<" ";
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-22-11.cpp b/Sejal Chanchlani/Milestone-11/problem-22-11.cpp
new file mode 100644
index 00000000..563b48a4
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-22-11.cpp	
@@ -0,0 +1,53 @@
+//problem-22-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter array size "<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i];
+	}
+	cout<<endl;
+	int even[n/2],odd[n/2];
+	int j=0,k=0;
+	int count_even=0,count_odd=0;
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]%2==0)
+		{
+			even[j]=arr[i];
+			count_even++;
+			j++;
+		}
+		else{
+			odd[k]=arr[i];
+			count_odd++;
+			k++;
+		}
+	
+	}
+	cout<<"count of even- "<<count_even<<endl;
+	
+	cout<<"printing even array - "<<endl;
+
+	for(int i=0;i<count_even;i++)
+	{
+		cout<<even[i]<<" ";
+	}
+	cout<<endl;
+		cout<<"printing odd array - "<<endl;
+	for(int i=0;i<count_odd;i++)
+	{
+		cout<<odd[i]<<" ";
+	}
+	
+}
+
diff --git a/Sejal Chanchlani/Milestone-11/problem-23-11.cpp b/Sejal Chanchlani/Milestone-11/problem-23-11.cpp
new file mode 100644
index 00000000..9806e2ac
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-23-11.cpp	
@@ -0,0 +1,31 @@
+//problem-23-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,temp,j;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	j=n-1;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	for(int i=0;i<n/2;i++)
+	{
+		temp=arr[j];
+		arr[j]=arr[i];
+		arr[i]=temp;
+		j--;
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-24-11.cpp b/Sejal Chanchlani/Milestone-11/problem-24-11.cpp
new file mode 100644
index 00000000..4bd8da7e
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-24-11.cpp	
@@ -0,0 +1,35 @@
+//problem-24-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int ele,count=0;
+	cout<<"enter element "<<endl;
+	cin>>ele;
+	for(int i=0;i<n;i++)
+	{
+		if(ele==arr[i])
+		{
+			cout<<"element found at "<<i<<"th position"<<endl;
+			count=1;
+			break;
+		}
+	}
+	if(count==0)
+	{
+		cout<<"element not found"<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-25-11.cpp b/Sejal Chanchlani/Milestone-11/problem-25-11.cpp
new file mode 100644
index 00000000..488a6b9f
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-25-11.cpp	
@@ -0,0 +1,57 @@
+//problem-25-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter array size"<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int temp,max;
+	for(int i=0;i<n;i++)
+	{
+		
+		for(int j=i+1;j<n;j++)
+		{
+			if(arr[i]>arr[j])
+			{
+				temp=arr[j];
+				arr[j]=arr[i];
+				arr[i]=temp;
+			}
+		}
+	}
+	cout<<"after sorying in ascending order - "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	cout<<"after sorying in decending order - "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=i+1;j<n;j++)
+		{
+			if(arr[i]<arr[j])
+			{
+				temp=arr[j];
+				arr[j]=arr[i];
+				arr[i]=temp;
+			}
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-26-11.cpp b/Sejal Chanchlani/Milestone-11/problem-26-11.cpp
new file mode 100644
index 00000000..d8bd12c0
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-26-11.cpp	
@@ -0,0 +1,39 @@
+//problem-26-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size "<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	int temp,k;
+	cout<<"enter how many left rotations"<<endl;
+	cin>>k;
+	while(k)
+	{
+	
+	temp=arr[0];
+	for(int i=0;i<n;i++)
+	{
+		arr[i]=arr[i+1];
+	}
+	arr[n-1]=temp;
+	k--;
+}
+	cout<<"after left rotation "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-11/problem-27-11.cpp b/Sejal Chanchlani/Milestone-11/problem-27-11.cpp
new file mode 100644
index 00000000..42237d57
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-11/problem-27-11.cpp	
@@ -0,0 +1,39 @@
+//problem-26-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter size "<<endl;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	/*int temp,k;
+	cout<<"enter how many left rotations"<<endl;
+	cin>>k;
+	while(k)
+	{
+	*/
+	int temp=arr[n-1];
+	for(int i=n-1;i>=0;i--)
+	{
+		arr[i]=arr[i-1];
+	}
+	arr[0]=temp;
+	//k--;
+//}
+	cout<<"after right rotation "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+}
diff --git a/Sejal Chanchlani/Milestone-12/problem-01-12.cpp b/Sejal Chanchlani/Milestone-12/problem-01-12.cpp
new file mode 100644
index 00000000..5de0338f
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/problem-01-12.cpp	
@@ -0,0 +1,131 @@
+//problem-01-12
+#include<iostream>
+using namespace std;
+void input_elements(int *a,int n,int m)
+{
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<n;j++)
+		{
+			cin>>*((a+i*n)+j);
+		}
+	}
+}
+void display(int *a,int n,int m)
+{
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<*((a+i*n)+j)<<" ";
+		}
+		cout<<endl;
+	}
+}
+void sum_matrix(int *a,int n,int m)
+{
+	int sum;
+	for(int i=0;i<n;i++)
+	{
+		
+		for(int j=0;j<m;j++)
+		{
+			sum=sum+*((a+i*n)+j);
+		}
+		
+	}
+	cout<<"sum of matrix is - "<<sum<<endl;
+}
+void sum_row(int *a,int n,int m)
+{
+	int sum;
+	for(int i=0;i<n;i++)
+	{
+		sum=0;
+		for(int j=0;j<m;j++)
+		{
+			sum=sum+*((a+i*n)+j);
+		}
+		cout<<"Sum of row "<<i<<" is "<<sum<<endl;
+	}
+}
+void sum_column(int *a,int n,int m)
+{
+
+	int sum;
+	for(int i=0;i<n;i++)
+	{
+		sum=0;
+		for(int j=0;j<m;j++)
+		{
+			sum=sum+*((a+j*n)+i);
+		}
+		cout<<"Sum of column "<<i<<" is "<<sum<<endl;
+	}
+}
+void transpose(int *a,int n,int m)
+{
+	int b[n][m];
+	for(int i=0;i<n;i++)
+	{
+	
+		for(int j=0;j<m;j++)
+		{
+			b[j][i]=*((a+i*n)+j);
+		}
+	
+	}
+	for(int i=0;i<n;i++)
+	{
+	
+		for(int j=0;j<m;j++)
+		{
+			cout<<b[i][j]<<" ";
+		}
+		cout<<endl;
+	
+	}
+}
+int main()
+{
+	int n,m,choice;
+	cout<<"enter rows - "<<endl;
+	cin>>n;
+	cout<<"enter columns - "<<endl;
+	cin>>m;
+	int a[n][m];
+	cout<<"1- Sum of all elements of matrix of size m x n"<<endl;
+	cout<<"2- To display row-wise sum of matrix of size m x n"<<endl;
+	cout<<"3- To display column-wise sum of matrix of size m x n"<<endl;
+	cout<<"4- To create transpose of matrix B of size n x m"<<endl;
+	cout<<"enter your choice - 1,2,3,4"<<endl;
+	cin>>choice;
+	input_elements((int *)a,n,m);
+	display((int *)a,n,m);
+	switch(choice)
+	{
+	
+		case 1:
+			{
+				sum_matrix((int *)a,n,m);
+				break;
+			}
+		case 2:
+			{
+				sum_row((int *)a,n,m);
+				break;
+			}
+		case 3:
+			{
+				sum_column((int *)a,n,m);
+				break;
+			}
+		case 4:
+			{
+				transpose((int *)a,n,m);
+				break;
+			}
+	}
+
+
+}
diff --git a/Sejal Chanchlani/Milestone-12/problem-02-12.cpp b/Sejal Chanchlani/Milestone-12/problem-02-12.cpp
new file mode 100644
index 00000000..45fe058b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/problem-02-12.cpp	
@@ -0,0 +1,49 @@
+//problem-02-12
+#include<iostream>
+using namespace std;
+void left_diagonal(int *a,int n,int m)
+{
+	int sum=0,j;
+	for(int i=0;i<n;i++)
+	{
+		j=i;
+		sum=sum+*((a+i*n)+j);
+	}
+	cout<<"Sum of left diagonal - "<<sum<<endl;
+}
+void right_diagonal(int *a,int n,int m)
+{
+	int sum=0,j=n-1;
+	for(int i=0;i<n;i++)
+	{
+		sum=sum+*((a+i*n)+j);
+		j--;
+	}
+	cout<<"sum of right diagonal - "<<sum<<endl;
+}
+int main()
+{
+	int n,m;
+	cout<<"enter rows "<<endl;
+	cin>>n;
+	cout<<"enter columns "<<endl;
+	cin>>m;
+	int a[n][m];
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>a[i][j];
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	right_diagonal((int *)a,n,m);
+	left_diagonal((int *)a,n,m);
+}
diff --git a/Sejal Chanchlani/Milestone-12/problem-04-12.cpp b/Sejal Chanchlani/Milestone-12/problem-04-12.cpp
new file mode 100644
index 00000000..7cb2179e
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/problem-04-12.cpp	
@@ -0,0 +1,42 @@
+//problem-04-12
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows "<<endl;
+	cin>>n;
+	cout<<"enter columns "<<endl;
+	cin>>m;
+	int a[n][m];
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>a[i][j];
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			if(j>=i)
+			{
+				cout<<a[i][j]<<" ";
+			}
+			else
+			{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-12/problem-05-12.cpp b/Sejal Chanchlani/Milestone-12/problem-05-12.cpp
new file mode 100644
index 00000000..79a69498
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/problem-05-12.cpp	
@@ -0,0 +1,42 @@
+//problem-05-12
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows "<<endl;
+	cin>>n;
+	cout<<"enter columns "<<endl;
+	cin>>m;
+	int a[n][m];
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>a[i][j];
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	int i=n/2;
+	cout<<"row elements - "<<endl;
+	for(int j=0;j<m;j++)
+	{
+		cout<<a[i][j]<<" ";
+		}	
+		cout<<endl;
+		cout<<"column elements - "<<endl;
+		int j=n/2;
+		for(int i=0;i<n;i++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+		cout<<endl;
+		
+}
diff --git a/Sejal Chanchlani/Milestone-12/problem-06-12.cpp b/Sejal Chanchlani/Milestone-12/problem-06-12.cpp
new file mode 100644
index 00000000..4bfc8f02
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/problem-06-12.cpp	
@@ -0,0 +1,66 @@
+//problem-06-12
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows - "<<endl;
+	cin>>n;
+	cout<<"enter columns - "<<endl;
+	cin>>m;
+	int a[n][m],b[n][m],c[n][m];
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>a[i][j];
+			
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>b[i][j];
+			
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<endl;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<b[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<endl;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			c[i][j]=a[i][j]+b[i][j];
+		}
+		
+	}
+	cout<<"after addition "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<c[i][j]<<" ";
+		}
+		cout<<endl;	
+	}
+	
+	
+	
+}
diff --git a/Sejal Chanchlani/Milestone-12/problem-07-12.cpp b/Sejal Chanchlani/Milestone-12/problem-07-12.cpp
new file mode 100644
index 00000000..366c4b9d
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/problem-07-12.cpp	
@@ -0,0 +1,65 @@
+//problem-07-12
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows - "<<endl;
+	cin>>n;
+	cout<<"enter columns - "<<endl;
+	cin>>m;
+	int a[n][m],b[n][m],c[n][m];
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>a[i][j];	
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cin>>b[i][j];
+			
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<a[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<endl;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<b[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<endl;
+	for(int i=0;i<n;i++)
+	{
+		c[i][j]=0;
+		for(int j=0;j<m;j++)
+		{
+			for(int k=0;k<m;k++)
+			{
+				c[i][j]=c[i][j]+a[i][k]*b[k][j];
+			}
+		}
+	}
+	cout<<"Multiplication - "<<endl;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++)
+		{
+			cout<<c[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-12/se.txt b/Sejal Chanchlani/Milestone-12/se.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-12/se.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Milestone-13/problem-01-13.cpp b/Sejal Chanchlani/Milestone-13/problem-01-13.cpp
new file mode 100644
index 00000000..63bfbf56
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-01-13.cpp	
@@ -0,0 +1,10 @@
+//problem-01-13
+#include<iostream>
+#include<string>
+using namespace std;
+int main()
+{
+	string s1;
+	cout<<"enter your string"<<endl;
+	cin>>s1;
+	cout<<"length of the string is - "<<s1.size();}
diff --git a/Sejal Chanchlani/Milestone-13/problem-02-13.cpp b/Sejal Chanchlani/Milestone-13/problem-02-13.cpp
new file mode 100644
index 00000000..a16eb47b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-02-13.cpp	
@@ -0,0 +1,14 @@
+//problem-02-13
+#include<iostream>
+#include<string>
+using namespace std;
+int main()
+{
+	string s1;
+	cout<<"enter string - "<<endl;
+	cin>>s1;
+	for(int i=s1.size()-1;i>=0;i--)
+	{
+		cout<<s1[i];
+	}
+}
diff --git a/Sejal Chanchlani/Milestone-13/problem-03-13.cpp b/Sejal Chanchlani/Milestone-13/problem-03-13.cpp
new file mode 100644
index 00000000..1501891b
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-03-13.cpp	
@@ -0,0 +1,18 @@
+//problem-03-13
+#include <iostream>
+#include<string>
+using namespace std;
+ 
+int main() { 
+   string str;
+   int count=0;
+   getline(cin,str);
+   for(int i=0;i<str.length();i++)
+   {
+   	if(str[i]==' ')
+   	{
+   		count++;
+	   }
+   }
+   cout<<"words - "<<count+1;
+}
diff --git a/Sejal Chanchlani/Milestone-13/problem-04-13.cpp b/Sejal Chanchlani/Milestone-13/problem-04-13.cpp
new file mode 100644
index 00000000..496a4b61
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-04-13.cpp	
@@ -0,0 +1,13 @@
+//problem-04-13
+#include<iostream>
+using namespace std;
+int main()
+{
+	string s1,s2;
+	cout<<"enter first string "<<endl;
+	cin>>s1;
+	cout<<"enter sec string "<<endl;
+	cin>>s2;
+	s1=s1+s2;
+	cout<<"after concatination "<<s1;
+}
diff --git a/Sejal Chanchlani/Milestone-13/problem-05-13.cpp b/Sejal Chanchlani/Milestone-13/problem-05-13.cpp
new file mode 100644
index 00000000..2de684da
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-05-13.cpp	
@@ -0,0 +1,21 @@
+//problem-05-13
+#include<iostream>
+using namespace std;
+int main()
+{
+	string s1,s2;
+	cout<<"enter first string - "<<endl;
+	cin>>s1;
+		cout<<"enter second string - "<<endl;
+	cin>>s2;
+	if(s1==s2)
+	{
+		cout<<"strings are equal"<<endl;
+		
+	}
+	else
+	{
+		cout<<"strngs are not equal"<<endl;
+	}
+	
+}
diff --git a/Sejal Chanchlani/Milestone-13/problem-06-13.cpp b/Sejal Chanchlani/Milestone-13/problem-06-13.cpp
new file mode 100644
index 00000000..94c6d6cd
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-06-13.cpp	
@@ -0,0 +1,23 @@
+
+//problem-06-13
+#include<iostream>
+using namespace std;
+int main()
+{
+	string s1,s2;
+	cout<<"enter first string - "<<endl;
+	getline(cin,s1);
+	for(int i=s1.length()-1;i>=0;i--)
+	{
+		s2=s2+s1[i];
+	}
+	cout<<s2<<endl;
+	if(s1==s2)
+	{
+		cout<<"strings are palindrome";
+	}
+	else
+	{
+		cout<<"strings are not palindrome";
+	}}
+		
diff --git a/Sejal Chanchlani/Milestone-13/problem-08-13.cpp b/Sejal Chanchlani/Milestone-13/problem-08-13.cpp
new file mode 100644
index 00000000..9e97d056
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/problem-08-13.cpp	
@@ -0,0 +1,16 @@
+
+//problem-08-13
+#include<iostream>
+using namespace std;
+int main()
+{
+	string s1,s2;
+	cout<<"enter  string - "<<endl;
+	getline(cin,s1);
+	for(int i=s1.length()-1;i>=0;i--)
+	{
+		s2=s2+s1[i];
+	}
+	cout<<"reversed string - "<<s2<<endl;
+}
+	
diff --git a/Sejal Chanchlani/Milestone-13/serd.txt b/Sejal Chanchlani/Milestone-13/serd.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Milestone-13/serd.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-01.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-01.cpp
new file mode 100644
index 00000000..b28a76c0
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-01.cpp	
@@ -0,0 +1,20 @@
+//num-pattern-01
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		k=1;
+		for(int j=1;j<=i;j++)
+		{
+			cout<<k<<" ";
+			k++;
+			
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-02.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-02.cpp
new file mode 100644
index 00000000..6d862a40
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-02.cpp	
@@ -0,0 +1,21 @@
+//num-pattern-02
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,p,k;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	k=n;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=i;j++)
+		{
+			cout<<p<<" ";
+			p++;
+		}
+		k--;
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-03.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-03.cpp
new file mode 100644
index 00000000..3599fa1e
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-03.cpp	
@@ -0,0 +1,27 @@
+//num-pattern-03
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=1,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		k=1;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<k<<" ";
+				k++;
+			}
+			else{
+				cout<<" ";
+			}
+		
+		}
+		
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-04.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-04.cpp
new file mode 100644
index 00000000..87226c59
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-04.cpp	
@@ -0,0 +1,27 @@
+//num-pattern-04
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=1,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<p<<" ";
+				p++;
+			}
+			else{
+				cout<<" ";
+			}
+		
+		}
+			k++;
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-05.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-05.cpp
new file mode 100644
index 00000000..30d5f76e
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-05.cpp	
@@ -0,0 +1,29 @@
+//num-pattern-05
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	k=n;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<p<<" ";
+				p--;
+			}
+			else{
+				cout<<" ";
+			}
+			
+		}
+		
+		cout<<endl;
+		k--;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-06.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-06.cpp
new file mode 100644
index 00000000..7b93798d
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-06.cpp	
@@ -0,0 +1,28 @@
+//num-pattern-06
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	k=n;
+	for(int i=1;i<=n;i++)
+	{
+		k=n;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<k<<" ";
+				k--;
+			}
+			else{
+				cout<<" ";
+			}
+			
+		}
+		
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-07.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-07.cpp
new file mode 100644
index 00000000..fd6d307a
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-07.cpp	
@@ -0,0 +1,21 @@
+//num-pattern-07
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enetr rows"<<endl;
+	cin>>n;
+	k=1;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=i;j++)
+		{
+			cout<<p<<" ";
+			p--;
+		}
+		k++;
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-08.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-08.cpp
new file mode 100644
index 00000000..e7183b9b
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-08.cpp	
@@ -0,0 +1,19 @@
+//num-pattern-08
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		k=n;
+		for(int j=1;j<=i;j++)
+		{
+			cout<<k<<" ";
+			k--;
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-09.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-09.cpp
new file mode 100644
index 00000000..dc3aefe0
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-09.cpp	
@@ -0,0 +1,18 @@
+//num-pattern-10
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=1;
+	cout<<" enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=i;j++)
+		{
+			cout<<k;
+		}
+		cout<<endl;
+		k++;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-10.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-10.cpp
new file mode 100644
index 00000000..7d402792
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-10.cpp	
@@ -0,0 +1,17 @@
+//num-pattern-10
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	k=n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=i;j++)
+		{
+		cout<<k<<" ";}
+		cout<<endl;
+		k--;
+	}}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-11.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-11.cpp
new file mode 100644
index 00000000..ac648e19
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-11.cpp	
@@ -0,0 +1,19 @@
+//num-pattern-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=m;i>=1;i-=2)
+	{
+		for(int j=1;j<=i;j++)
+		{
+			cout<<j<<" ";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-12.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-12.cpp
new file mode 100644
index 00000000..08b50c87
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-12.cpp	
@@ -0,0 +1,36 @@
+//num-pattern-12
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=1,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{	k=1;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				
+			    if(i%2!=0)
+				{
+				
+				   cout<<k<<" ";
+				   k++;
+				}
+				else{
+					
+					cout<<p<<" ";
+					p--;
+				}
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		p=k-2;
+		
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-13.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-13.cpp
new file mode 100644
index 00000000..e323f29a
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-13.cpp	
@@ -0,0 +1,26 @@
+//num-pattern-13
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	k=n;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<p<<" ";
+			}
+		     else{
+		     	cout<<" ";
+			 }
+		}
+		k--;
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-14.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-14.cpp
new file mode 100644
index 00000000..e3cb54be
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-14.cpp	
@@ -0,0 +1,24 @@
+//num-pattern-14
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	k=1;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<k<<" ";
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+		k++;
+	}}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-15.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-15.cpp
new file mode 100644
index 00000000..fb7c87c5
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-15.cpp	
@@ -0,0 +1,28 @@
+//num-pattern-15
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	k=n;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=i)
+			{
+				cout<<p<<" ";
+				p++;
+			}
+			else
+			{
+				cout<<"5 ";
+			}
+		}
+		cout<<endl;
+		k--;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-16.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-16.cpp
new file mode 100644
index 00000000..31b62d0a
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-16.cpp	
@@ -0,0 +1,34 @@
+//num-pattern-16
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k1,k2,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=i;j++)
+		{
+			if(i%2==0)
+			{
+				if(j%2==0)
+				{
+					cout<<"1"<<" ";
+				}
+				else{
+					cout<<"0"<<" ";
+				}
+			}
+			else{
+				if(j%2==0){
+				cout<<"0"<<" ";
+				}
+				else{
+					cout<<"1"<<" ";
+				}
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-17.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-17.cpp
new file mode 100644
index 00000000..4ff6c47e
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-17.cpp	
@@ -0,0 +1,27 @@
+//num-pattern-17
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k1,k2,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	
+	for(int i=1;i<=n;i++)
+	{
+		k1=1;
+	k2=2;
+		for(int j=1;j<=i;j++)
+		{
+			if(i%2==0)
+			{
+				cout<<k2;
+				k2=k2+2;
+			}
+			else{
+				cout<<k1;
+				k1=k1+2;
+			}
+		}
+		cout<<endl;
+	}}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-18.cpp b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-18.cpp
new file mode 100644
index 00000000..f2569e7f
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/num-pattern-18.cpp	
@@ -0,0 +1,26 @@
+//num-pttern-18
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	k=1;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=n;j++)
+		{
+			if(j<=(n+1)-i)
+			{
+				cout<<p<<" ";
+				p=p+2;
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+		k=k+2;
+	}}
diff --git a/Sejal Chanchlani/Number Patterns-Milestone-09/xs.txt b/Sejal Chanchlani/Number Patterns-Milestone-09/xs.txt
new file mode 100644
index 00000000..8b137891
--- /dev/null
+++ b/Sejal Chanchlani/Number Patterns-Milestone-09/xs.txt	
@@ -0,0 +1 @@
+
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-01.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-01.cpp
new file mode 100644
index 00000000..6144c5b5
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-01.cpp	
@@ -0,0 +1,14 @@
+//Pattern-01
+#include<iostream>
+using namespace std;
+int main()
+{
+	for(int i=1;i<6;i++)
+	{
+		for(int j=1;j<=i;j++)
+		{
+			cout<<"*"<<" ";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-02.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-02.cpp
new file mode 100644
index 00000000..1cf4fc7f
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-02.cpp	
@@ -0,0 +1,21 @@
+//pattern -02
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter number of rows and columns"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=(n-i);j++)
+		{
+			cout<<" ";
+		}
+		for(int k=1;k<=i;k++)
+		{
+			cout<<"*";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-03.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-03.cpp
new file mode 100644
index 00000000..f79fbb39
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-03.cpp	
@@ -0,0 +1,24 @@
+//pattern-03.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k;
+	cout<<"enter number of rows and columns"<<endl;
+	cin>>n;
+	int j=0;
+	for(int i=0;i<n;i++)
+	{
+		k=i;
+		while(k)
+		{
+			cout<<" ";
+			k--;
+		}
+		for(int j=0;j<(n-i);j++)
+		{
+			cout<<"*";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-04.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-04.cpp
new file mode 100644
index 00000000..57c16422
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-04.cpp	
@@ -0,0 +1,23 @@
+//pattern-04
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k;
+	cout<<"enter number of rows and columns"<<endl;
+	cin>>n;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<(n-i);j++)
+		{
+			cout<<"*";
+		}
+		k=i;
+		while(k)
+		{
+			cout<<" ";
+			k--;
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-05.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-05.cpp
new file mode 100644
index 00000000..0ad9ff53
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-05.cpp	
@@ -0,0 +1,25 @@
+//pattern-05.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter number of rows"<<endl;
+	cin>>n;
+	cout<<"enter number of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=n-i+1 && j<=((n-1)+i))
+			{
+				cout<<"*";
+			}
+			else
+			{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-06.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-06.cpp
new file mode 100644
index 00000000..b27ace11
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-06.cpp	
@@ -0,0 +1,23 @@
+//pattern-06.
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k;
+	cout<<"Enter number of rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		k=n-i;
+		while(k)
+		{
+			cout<<" ";
+			k--;
+		}
+		for(int j=1;j<=i;j++)
+		{
+			cout<<"* ";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-07(new).cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-07(new).cpp
new file mode 100644
index 00000000..7dfdde3c
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-07(new).cpp	
@@ -0,0 +1,26 @@
+//pattern-07
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter no. of rows"<<endl;
+	cin>>n;
+	cout<<"enter np of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=m;j++)
+		{
+			if(j<=(n+1)-i || j>=(n-1)+i)
+			{
+				cout<<"*";
+			}
+			else
+			{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-08.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-08.cpp
new file mode 100644
index 00000000..87b320ae
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-08.cpp	
@@ -0,0 +1,35 @@
+//pattern-03
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,k;
+	cout<<"enter no.of rows"<<endl;
+	cin>>n;
+	cout<<"enter no.of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=1;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=(n+1)-i && j<=(n-1)+i)
+			{
+				cout<<k;
+				if(j<n)
+				{
+					k++;
+				}
+				else
+				{
+					k--;
+				}
+			}
+			else
+			{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-09.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-09.cpp
new file mode 100644
index 00000000..17aa3ce7
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-09.cpp	
@@ -0,0 +1,35 @@
+//pattern-09
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,k;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=65;
+		for(int j=1;j<=m;j++)
+		{
+			if(j<=(n+1)-i || j>=(n-1)+i)
+			{
+				cout<<(char)(k);
+				if(j<(n))
+				{
+					k++;
+				}
+				else{
+					k--;
+				}
+			}
+			else{
+				cout<<" ";
+				if(j==n)
+				  k--;
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-10.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-10.cpp
new file mode 100644
index 00000000..85966555
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-10.cpp	
@@ -0,0 +1,41 @@
+//pattern-10
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter no of rows"<<endl;
+	cin>>n;
+	int n1,n2;
+	n1=n/2;
+	n2=n-n1;
+	for(int i=1;i<=n1;i++)
+	{
+		for(int j=1;j<=n;j++)
+		{
+			if(j>=(n1+2)-i && j<=n1+i)
+			{
+				cout<<"*";
+			}
+			else
+			{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+	for(int i=1;i<=n2;i++)
+	{
+		for(int j=1;j<=n;j++)
+		{
+			if(j>=i && j<=((n+1)-i))
+			{
+				cout<<"*";
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-11.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-11.cpp
new file mode 100644
index 00000000..b3885cb1
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-11.cpp	
@@ -0,0 +1,28 @@
+//pattern-11
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter no of rows"<<endl;
+	cin>>n;
+	int n1,n2;
+	n1=n/2;
+	n2=n-n1;
+	for(int i=1;i<=n1;i++)
+	{
+		for(int j=1;j<=i;j++)
+		{
+			cout<<"*";
+		}
+		cout<<endl;
+	}
+	for(int i=0;i<=n2;i++)
+	{
+		for(int j=0;j<n2-i;j++)
+		{
+			cout<<"*";
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-12.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-12.cpp
new file mode 100644
index 00000000..aa62fd63
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-12.cpp	
@@ -0,0 +1,25 @@
+//pattern-12
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter no of rows";
+	cin>>n;
+	cout<<"enter no of columns";
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=i && j<=(m+1)-i)
+			{
+				cout<<"*";
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-13.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-13.cpp
new file mode 100644
index 00000000..41ae18f1
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-13.cpp	
@@ -0,0 +1,32 @@
+//pattern-13
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,k;
+	cout<<"emter no of rows"<<endl;
+	cin>>n;
+	cout<<"enter no of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=65;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=(n+1)-i && j<=(n-1)+i)
+			{
+				cout<<(char)(k);
+				if(j<(m/2)+1)
+				{
+					k++;
+				}
+				else{k--;
+				}
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-14.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-14.cpp
new file mode 100644
index 00000000..d937e7df
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-14.cpp	
@@ -0,0 +1,20 @@
+//pattern-14
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k;
+	cout<<"Enter number of rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		k=n-i;
+		for(int j=1;j<=(n+1)-i;j++)
+		{
+			cout<<k<<" ";
+			k--;
+		}
+		cout<<endl;
+	}
+	
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-15.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-15.cpp
new file mode 100644
index 00000000..3964422b
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-15.cpp	
@@ -0,0 +1,40 @@
+//pattern-15
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,n1,n2,l;
+	cout<<"Enter number of rows"<<endl;
+	cin>>n;
+	n1=n/2;
+	n2=n-n1;
+	for(int i=1;i<=n1;i++)
+	{
+		k=1;
+	   for(int j=1;j<=n1-i+1;j++)
+	   {
+	   	cout<<" ";
+	   }
+	   for(int j=1;j<=i;j++)
+	   {
+	   	cout<<k;
+	   	k++;
+	   }
+	   cout<<endl;
+	}
+	for(int i=1;i<=n2;i++)
+	{
+		l=1;
+		for(int j=1;j<i;j++)
+		{
+			cout<<" ";
+		}
+		for(int j=1;j<=n2-i+1;j++)
+		{
+			cout<<l;
+			l++;
+		}
+		cout<<endl;
+	}
+}
+
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-16.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-16.cpp
new file mode 100644
index 00000000..c70468e0
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-16.cpp	
@@ -0,0 +1,31 @@
+//Pattern-16
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"Enter no. of rows and columns"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=n;j++)
+		{
+			if(j==i || j==(n+1)-i)
+			{
+				if(j==i && j!=n/2+1)
+				{
+					cout<<"\\";
+				}
+				else{
+					cout<<"/";
+				}
+		}
+			else
+			{
+				cout<<"*";
+			}
+		}
+		cout<<endl;
+	}
+}
+
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-18.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-18.cpp
new file mode 100644
index 00000000..a42640bb
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-18.cpp	
@@ -0,0 +1,25 @@
+//pattern-18
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m ;
+	cout<<"enter no of rows "<<endl;
+	cin>>n;
+	cout<<"enter no of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=i && j<=(m+1)-i)
+			{
+				cout<<"*";
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-19.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-19.cpp
new file mode 100644
index 00000000..32d2016c
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-19.cpp	
@@ -0,0 +1,32 @@
+//pattern-19
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,k;
+	cout<<"enter no of rows"<<endl;
+	cin>>n;
+	cout<<"Enter no of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=65;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=(n+1)-i && j<=(n-1)+i)
+			{
+				cout<<(char)(k);
+				if(j<=m/2)
+				{k++;
+				}
+				else{
+					k--;
+				}
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-20.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-20.cpp
new file mode 100644
index 00000000..7b00e263
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-20.cpp	
@@ -0,0 +1,34 @@
+ //pattern-20
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,m,x;
+	cout<<"enter no of rows"<<endl;
+	cin>>n;
+	cout<<"Enter no of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=65;
+		x=1;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=(n+1)-i && j<=n+i)
+			{
+				if(j<=m/2)
+				{
+					cout<<(char)(k);
+					k++;
+				}
+				else{
+					cout<<x;
+					x++;
+				}
+			}
+			else{
+				cout<<" ";
+			}		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-21.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-21.cpp
new file mode 100644
index 00000000..4918a9c5
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-21.cpp	
@@ -0,0 +1,20 @@
+//pattern-21
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"enter no of rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=n-i;j++)
+		{
+			cout<<" ";
+		}
+		for(int j=1;j<=5;j++)
+		{
+			cout<<"*";
+		}
+	cout<<endl;}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-22.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-22.cpp
new file mode 100644
index 00000000..b171869a
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-22.cpp	
@@ -0,0 +1,36 @@
+//pattern-22
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,x,k;
+	cout<<"enter no of rows"<<endl;
+	cin>>n;
+	cout<<"enter no of columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=65;
+		x=1;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=(n+1)-i && j<=(n-1)+i)
+			{
+				if(j<=m/2+1)
+				{
+					cout<<x;
+					x++;
+				}
+				else
+				{
+					cout<<(char)(k);
+					k++;
+				}
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-23.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-23.cpp
new file mode 100644
index 00000000..28d61cba
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-23.cpp	
@@ -0,0 +1,23 @@
+//pattern-23
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;
+	cout<<"Enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=i;j++)
+		{
+			if(j%2!=0)
+			{
+				cout<<"1";
+			}
+			else{
+				cout<<"0";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-24.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-24.cpp
new file mode 100644
index 00000000..f73c0f08
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-24.cpp	
@@ -0,0 +1,21 @@
+//pattern-24
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n=7;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=n;j++)
+		{
+			if((i==1 || i==n || j==1 || j==n) || (i>=3&&i<=5&&j>=3&&j<=5) && (i==3||i==5||j==3||j==5))
+			{
+				cout<<"*";
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}}
+	
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-26.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-26.cpp
new file mode 100644
index 00000000..04fad994
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-26.cpp	
@@ -0,0 +1,23 @@
+//pattern-26
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=65,x,y;
+	cout<<"enter rows - "<<endl;
+	cin>>n;
+	y=k;
+	for(int i=1;i<=n;i++)
+	{
+		x=k;
+	
+		for(int j=1;j<=i;j++)
+		{
+			
+			cout<<(char)(x);
+			x--;
+		}
+		k++;
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-27.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-27.cpp
new file mode 100644
index 00000000..8b19352e
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-27.cpp	
@@ -0,0 +1,25 @@
+//pattern-27
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=m;j++)
+		{
+			if(j>+(n+1)-i && j<=(n-1)+i)
+			{
+				cout<<"*";
+			}
+			else{
+				cout<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-28.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-28.cpp
new file mode 100644
index 00000000..ba00bfba
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-28.cpp	
@@ -0,0 +1,51 @@
+//pattern-28
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,k=0,p;
+	
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		if(i%2!=0)
+		{
+			k=k+1;
+		}
+		else{
+			k--;
+			k=k+i;
+		}
+		p=k;
+		for(int j=1;j<=m;j++)
+		{
+			if(j<=i*2-1)
+			{
+				if(j%2==0)
+				{
+					cout<<"*";
+				}
+				else{
+			     if(i%2==0)
+			     {
+			     	cout<<p;
+			     	p--;
+				 }
+				 else{
+				 	cout<<p;
+				 	k++;
+				 	p++;
+				 }
+				}
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+	
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-29.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-29.cpp
new file mode 100644
index 00000000..b90a5704
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-29.cpp	
@@ -0,0 +1,26 @@
+//pattern-29
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=64,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		k=k+i;
+		p=k;
+		for(int j=1;j<=n;j++)
+		{
+			if(j>=(n+1)-i)
+			{
+				cout<<(char)(p);
+				p--;
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-30.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-30.cpp
new file mode 100644
index 00000000..41f2f5c6
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-30.cpp	
@@ -0,0 +1,58 @@
+//pattern-30
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,count;
+	cout<<"enter n"<<endl;
+	cin>>n;
+	for(int i=1;i<=3*n;i++)
+	{
+		for(int j=1;j<=2*n-1;j++)
+		{
+			if(i<=n)
+			{
+			       if(j>=2*n-i)
+			       {
+			       	cout<<"*";
+				   }
+				   else
+				   {
+				   	cout<<" ";
+				   }
+			}
+			else if(i<=2*n){
+				count=0;
+				if(j==n)
+				{
+					cout<<"|";
+					count=1;
+				}
+				if(j<=i-n-1)
+				{
+					count=1;
+					cout<<"*";
+				}
+				if(j>=i)
+				{
+					cout<<"*";
+					count=1;
+				}
+
+				if(count==0)
+				{
+					cout<<" ";
+				}
+			}
+			else if(i<=3*n){
+				if(j<=3*n+1-i)
+				{
+					cout<<"*";
+				}
+				else{cout<<" ";
+				}
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-31.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-31.cpp
new file mode 100644
index 00000000..93b7393a
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-31.cpp	
@@ -0,0 +1,39 @@
+//pattern-31
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,x,k;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		x=1;
+		k=65;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=(n+1)-i &&j<=(n-1)+i)
+			{
+			
+			if(i%2!=0 && j%2==0)
+			{
+				cout<<x;
+				x++;
+			}
+			else if(i%2==0 &&j%2!=0)
+			{
+				cout<<(char)(k);
+				k++;
+			}
+			else{
+				cout<<" ";
+			}}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-32.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-32.cpp
new file mode 100644
index 00000000..d2253316
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-32.cpp	
@@ -0,0 +1,24 @@
+//pattern-32
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		for(int j=1;j<=m;j++)
+		{
+			if(i==j || j==(n+1)-i)
+			{
+				cout<<"*";
+			}
+			else{
+				cout<<" ";
+			}
+		}
+		cout<<endl;
+	}}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-33.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-33.cpp
new file mode 100644
index 00000000..19592923
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-33.cpp	
@@ -0,0 +1,27 @@
+//pattern-33
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,m,k,p;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	cout<<"enter columns"<<endl;
+	cin>>m;
+	for(int i=1;i<=n;i++)
+	{
+		k=65;
+		for(int j=1;j<=m;j++)
+		{
+			if(j>=1 && j<=(n+1)-i || j>=(n-1)+i && j<=m)
+			{
+				cout<<(char)(k);
+			}
+			else{
+
+				cout<<" ";
+			}
+			k++;
+		}
+		cout<<endl;
+	}}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-34.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-34.cpp
new file mode 100644
index 00000000..785c2810
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-34.cpp	
@@ -0,0 +1,21 @@
+//pattern-34
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k=1,p;
+	cout<<"Enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+		p=k;
+		for(int j=1;j<=i;j++)
+		{
+		     cout<<p;
+		     p=p-(n+j-i);
+		}
+		k=k+n+1-i;
+		cout<<endl;
+		
+	}
+}
diff --git a/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-36.cpp b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-36.cpp
new file mode 100644
index 00000000..e09ff58b
--- /dev/null
+++ b/Sejal Chanchlani/Star Patterns-Milestone-08/pattern-36.cpp	
@@ -0,0 +1,21 @@
+//pattern-36
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,k,p,l=0;
+	cout<<"enter rows"<<endl;
+	cin>>n;
+	for(int i=1;i<=n;i++)
+	{
+	k=0;
+		for(int j=1;j<=i;j++)
+		{
+			
+			cout<<k<<" ";
+			k=k+(i-1);
+			
+		}
+		cout<<endl;
+		l++;
+	}}
diff --git a/shristi hore code.ipynb b/shristi hore code.ipynb
new file mode 100644
index 00000000..9ba975c9
--- /dev/null
+++ b/shristi hore code.ipynb	
@@ -0,0 +1,385 @@
+{
+  "nbformat": 4,
+  "nbformat_minor": 0,
+  "metadata": {
+    "colab": {
+      "name": "Untitled0.ipynb",
+      "provenance": [],
+      "collapsed_sections": [],
+      "authorship_tag": "ABX9TyNTTZPQLshtblPLE+NLQ3tg",
+      "include_colab_link": true
+    },
+    "kernelspec": {
+      "name": "python3",
+      "display_name": "Python 3"
+    },
+    "language_info": {
+      "name": "python"
+    }
+  },
+  "cells": [
+    {
+      "cell_type": "markdown",
+      "metadata": {
+        "id": "view-in-github",
+        "colab_type": "text"
+      },
+      "source": [
+        "<a href=\"https://colab.research.google.com/github/sejalchanchlani/Beginner-CPP-Submissions/blob/master/shristi%20hore%20code.ipynb\" target=\"_parent\"><img src=\"https://colab.research.google.com/assets/colab-badge.svg\" alt=\"Open In Colab\"/></a>"
+      ]
+    },
+    {
+      "cell_type": "code",
+      "execution_count": 1,
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "1p0IGOlAZgeA",
+        "outputId": "2ed6bad5-2b7b-46fe-e843-5fac53e5bc08"
+      },
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "Cloning into 'Anomaly-Detection-in-CCTV-Surveillance-Videos'...\n",
+            "remote: Enumerating objects: 111, done.\u001b[K\n",
+            "remote: Total 111 (delta 0), reused 0 (delta 0), pack-reused 111\u001b[K\n",
+            "Receiving objects: 100% (111/111), 47.73 MiB | 10.37 MiB/s, done.\n",
+            "Resolving deltas: 100% (28/28), done.\n"
+          ]
+        }
+      ],
+      "source": [
+        "!git clone https://github.com/ShrishtiHore/Anomaly-Detection-in-CCTV-Surveillance-Videos"
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        ""
+      ],
+      "metadata": {
+        "id": "4j9ZdQCAmvC_"
+      },
+      "execution_count": null,
+      "outputs": []
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "%cd Anomaly-Detection-in-CCTV-Surveillance-Videos/"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "fHz3mRPEZt0V",
+        "outputId": "8a2ecfe9-6124-4574-e2af-077ccb02bdfe"
+      },
+      "execution_count": 2,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "/content/Anomaly-Detection-in-CCTV-Surveillance-Videos\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "%cd STAutoEncoder/"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "Ujx-7xGUZyAF",
+        "outputId": "7e39e557-b5d4-451c-94d5-ecb0a8f9609b"
+      },
+      "execution_count": 3,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "%cd /content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder\n",
+        "!unzip /content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder/training.zip\n",
+        "\n",
+        "\n",
+        "!pwd"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "xQChojMTZ2Nw",
+        "outputId": "73bff593-cf8c-4a39-fc7b-e2bfb002e955"
+      },
+      "execution_count": 7,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder\n",
+            "Archive:  /content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder/training.zip\n",
+            "  inflating: training.npy            \n",
+            "/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "!python test.py"
+      ],
+      "metadata": {
+        "id": "tj43jkcmZ6dh",
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "outputId": "8d275531-af0d-4bc1-8854-f1c8fc3a290e"
+      },
+      "execution_count": 8,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "2022-05-05 10:07:50.196383: E tensorflow/stream_executor/cuda/cuda_driver.cc:271] failed call to cuInit: CUDA_ERROR_NO_DEVICE: no CUDA-capable device is detected\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n",
+            "Bunch Normal\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "from google.colab import drive\n",
+        "drive.mount('/content/drive')"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "OWvvnCuztJnx",
+        "outputId": "1269fb57-8ea8-481b-f830-503338dd651b"
+      },
+      "execution_count": 9,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "Mounted at /content/drive\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "%cd /content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "gnkQjW14mw9h",
+        "outputId": "256b2c5e-fd98-4dce-98f3-eeb14960f803"
+      },
+      "execution_count": 10,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/STAutoEncoder\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "!python preprocess.py"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "S54vCM9ku2JB",
+        "outputId": "935846e6-a187-4496-a4a4-9f2cfbb4685b"
+      },
+      "execution_count": 12,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "Traceback (most recent call last):\n",
+            "  File \"preprocess.py\", line 5, in <module>\n",
+            "    from scipy.misc import imresize\n",
+            "ImportError: cannot import name 'imresize' from 'scipy.misc' (/usr/local/lib/python3.7/dist-packages/scipy/misc/__init__.py)\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        ""
+      ],
+      "metadata": {
+        "id": "xRL7zI-Gwrzh"
+      },
+      "execution_count": null,
+      "outputs": []
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "!pip install scipy==1.1.0\n"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "R594UeKlwd_b",
+        "outputId": "9181157c-a91a-4558-8c8d-5b668ebbc5fd"
+      },
+      "execution_count": 13,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "Collecting scipy==1.1.0\n",
+            "  Downloading scipy-1.1.0-cp37-cp37m-manylinux1_x86_64.whl (31.2 MB)\n",
+            "\u001b[K     |████████████████████████████████| 31.2 MB 82.1 MB/s \n",
+            "\u001b[?25hRequirement already satisfied: numpy>=1.8.2 in /usr/local/lib/python3.7/dist-packages (from scipy==1.1.0) (1.21.6)\n",
+            "Installing collected packages: scipy\n",
+            "  Attempting uninstall: scipy\n",
+            "    Found existing installation: scipy 1.4.1\n",
+            "    Uninstalling scipy-1.4.1:\n",
+            "      Successfully uninstalled scipy-1.4.1\n",
+            "\u001b[31mERROR: pip's dependency resolver does not currently take into account all the packages that are installed. This behaviour is the source of the following dependency conflicts.\n",
+            "pymc3 3.11.4 requires scipy>=1.2.0, but you have scipy 1.1.0 which is incompatible.\n",
+            "plotnine 0.6.0 requires scipy>=1.2.0, but you have scipy 1.1.0 which is incompatible.\n",
+            "jax 0.3.8 requires scipy>=1.2.1, but you have scipy 1.1.0 which is incompatible.\n",
+            "albumentations 0.1.12 requires imgaug<0.2.7,>=0.2.5, but you have imgaug 0.2.9 which is incompatible.\u001b[0m\n",
+            "Successfully installed scipy-1.1.0\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        "!python preprocess.py  \"/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/Avenue/testing_videos\" 30"
+      ],
+      "metadata": {
+        "colab": {
+          "base_uri": "https://localhost:8080/"
+        },
+        "id": "MtvjWViowtLq",
+        "outputId": "758d96a4-9a5f-4748-aa7e-f5a81350bde6"
+      },
+      "execution_count": 32,
+      "outputs": [
+        {
+          "output_type": "stream",
+          "name": "stdout",
+          "text": [
+            "['01.avi']\n",
+            "Found  1  training video\n",
+            "ffmpeg version 3.4.8-0ubuntu0.2 Copyright (c) 2000-2020 the FFmpeg developers\n",
+            "  built with gcc 7 (Ubuntu 7.5.0-3ubuntu1~18.04)\n",
+            "  configuration: --prefix=/usr --extra-version=0ubuntu0.2 --toolchain=hardened --libdir=/usr/lib/x86_64-linux-gnu --incdir=/usr/include/x86_64-linux-gnu --enable-gpl --disable-stripping --enable-avresample --enable-avisynth --enable-gnutls --enable-ladspa --enable-libass --enable-libbluray --enable-libbs2b --enable-libcaca --enable-libcdio --enable-libflite --enable-libfontconfig --enable-libfreetype --enable-libfribidi --enable-libgme --enable-libgsm --enable-libmp3lame --enable-libmysofa --enable-libopenjpeg --enable-libopenmpt --enable-libopus --enable-libpulse --enable-librubberband --enable-librsvg --enable-libshine --enable-libsnappy --enable-libsoxr --enable-libspeex --enable-libssh --enable-libtheora --enable-libtwolame --enable-libvorbis --enable-libvpx --enable-libwavpack --enable-libwebp --enable-libx265 --enable-libxml2 --enable-libxvid --enable-libzmq --enable-libzvbi --enable-omx --enable-openal --enable-opengl --enable-sdl2 --enable-libdc1394 --enable-libdrm --enable-libiec61883 --enable-chromaprint --enable-frei0r --enable-libopencv --enable-libx264 --enable-shared\n",
+            "  libavutil      55. 78.100 / 55. 78.100\n",
+            "  libavcodec     57.107.100 / 57.107.100\n",
+            "  libavformat    57. 83.100 / 57. 83.100\n",
+            "  libavdevice    57. 10.100 / 57. 10.100\n",
+            "  libavfilter     6.107.100 /  6.107.100\n",
+            "  libavresample   3.  7.  0 /  3.  7.  0\n",
+            "  libswscale      4.  8.100 /  4.  8.100\n",
+            "  libswresample   2.  9.100 /  2.  9.100\n",
+            "  libpostproc    54.  7.100 / 54.  7.100\n",
+            "Input #0, avi, from '/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/Avenue/testing_videos/01.avi':\n",
+            "  Metadata:\n",
+            "    encoder         : Lavf53.4.0\n",
+            "  Duration: 00:00:57.56, start: 0.000000, bitrate: 2201 kb/s\n",
+            "    Stream #0:0: Video: mpeg4 (Simple Profile) (XVID / 0x44495658), yuv420p, 640x360 [SAR 1:1 DAR 16:9], 2197 kb/s, 25 fps, 25 tbr, 25 tbn, 25 tbc\n",
+            "Stream mapping:\n",
+            "  Stream #0:0 -> #0:0 (mpeg4 (native) -> mjpeg (native))\n",
+            "Press [q] to stop, [?] for help\n",
+            "\u001b[1;34m[swscaler @ 0x556f9d314000] \u001b[0m\u001b[0;33mdeprecated pixel format used, make sure you did set range correctly\n",
+            "\u001b[0m\u001b[1;36m[mjpeg @ 0x556f9cf87e00] \u001b[0m\u001b[0;33mbitrate tolerance 4000000 too small for bitrate 200000, overriding\n",
+            "\u001b[0mOutput #0, image2, to '/content/Anomaly-Detection-in-CCTV-Surveillance-Videos/Avenue/testing_videos/frames/%03d.jpg':\n",
+            "  Metadata:\n",
+            "    encoder         : Lavf57.83.100\n",
+            "    Stream #0:0: Video: mjpeg, yuvj420p(pc), 640x360 [SAR 1:1 DAR 16:9], q=2-31, 200 kb/s, 0.03 fps, 0.03 tbn, 0.03 tbc\n",
+            "    Metadata:\n",
+            "      encoder         : Lavc57.107.100 mjpeg\n",
+            "    Side data:\n",
+            "      cpb: bitrate max/min/avg: 0/0/200000 buffer size: 0 vbv_delay: -1\n",
+            "frame=    4 fps=2.3 q=1.6 Lsize=N/A time=00:02:00.00 bitrate=N/A dup=0 drop=1435 speed=67.8x    \n",
+            "video:146kB audio:0kB subtitle:0kB other streams:0kB global headers:0kB muxing overhead: unknown\n",
+            "preprocess.py:32: DeprecationWarning:     `imresize` is deprecated!\n",
+            "    `imresize` is deprecated in SciPy 1.0.0, and will be removed in 1.2.0.\n",
+            "    Use ``skimage.transform.resize`` instead.\n",
+            "  img=imresize(img,(227,227,3))\n",
+            "saving the numpy array\n",
+            "array save\n"
+          ]
+        }
+      ]
+    },
+    {
+      "cell_type": "code",
+      "source": [
+        ""
+      ],
+      "metadata": {
+        "id": "pxtubI4z0ItI"
+      },
+      "execution_count": null,
+      "outputs": []
+    }
+  ]
+}
\ No newline at end of file