diff --git a/gaurav.122467/.vscode/settings.json b/gaurav.122467/.vscode/settings.json
new file mode 100644
index 0000000..c8ef5a5
--- /dev/null
+++ b/gaurav.122467/.vscode/settings.json
@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "DSA1.C": "cpp"
+    }
+}
\ No newline at end of file
diff --git a/gaurav.122467/DSA1 b/gaurav.122467/DSA1
new file mode 100755
index 0000000..39ea1e6
Binary files /dev/null and b/gaurav.122467/DSA1 differ
diff --git a/gaurav.122467/DSA1.c b/gaurav.122467/DSA1.c
new file mode 100644
index 0000000..a335a7a
--- /dev/null
+++ b/gaurav.122467/DSA1.c
@@ -0,0 +1,76 @@
+//print the index number of a element in an array by binary searching.
+#include <stdio.h>
+void sort(int a[],int size)
+{
+    int temp,j;
+    for(int i=0;i<size;i++)
+    {
+        for(int j=0;j<size-i-1;j++)
+            {
+                if(a[j]>a[j+1])
+                {
+                    temp=a[j+1];
+                    a[j+1]=a[j];
+                    a[j]=temp;
+                }
+            }
+    }
+    printf("Sorting Done !\n");
+    printf("New List Looks Like This :\n");
+    for(int i=0;i<size;i++)
+    {
+        printf("%d\n",a[i]);
+    }
+}
+void search(int a[],int size)
+{
+    int found=1;
+    while(found==1)
+    {
+        int elem=0,ll=0,hl=size-1,x=0;
+        printf("Enter element to be searched-: \n");
+        scanf("%d",&elem);
+        while(ll<=hl)
+        {
+            if(a[(hl+ll)/2] == elem)
+            {
+                printf("Element found in the list! \n");
+                found=-1;
+                x=((hl+ll)/2);
+                printf("At index position : %d \n",x);
+                break;
+            }
+            else if(a[(hl+ll)/2] < elem)
+            {
+                ll=((hl+ll)/2)+1;
+            }
+            else if(a[(hl+ll)/2] > elem)
+            {
+                hl=((hl+ll)/2)-1;
+            }
+        }
+        if(found == 1)
+        {
+            printf("Element not found");
+            break;
+        }
+    }
+}
+int main()
+{
+    int len;
+    printf("Enter the length of array-: \n");
+    scanf("%d",&len);
+    int a[len];
+    printf("Enter %d numbers-: \n",len);
+    for(int i=0;i<len;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    printf("\n");
+    sort(a,len);
+    printf("\n");
+    search(a,len);
+    printf("\n");
+    return 0;
+}
\ No newline at end of file
diff --git a/gaurav.122467/DSA2 b/gaurav.122467/DSA2
new file mode 100755
index 0000000..9b53f01
Binary files /dev/null and b/gaurav.122467/DSA2 differ
diff --git a/gaurav.122467/DSA2.c b/gaurav.122467/DSA2.c
new file mode 100644
index 0000000..22e7c82
--- /dev/null
+++ b/gaurav.122467/DSA2.c
@@ -0,0 +1,43 @@
+#include <stdio.h>
+void sort(int a[],int size)
+{
+    int temp;
+    for(int i=0;i<size;i++)
+    {
+        for(int j=0;j<size-i-1;j++)
+        {
+            if(a[j]>a[j+1])
+            {
+                temp=a[j+1];
+                a[j+1]=a[j];
+                a[j]=temp;
+            }
+        }
+    }
+}
+void print(int a[],int size)
+{
+    printf("Sorting Completed !\n");
+    printf("New List Looks Like This :\n");
+    for(int i=0;i<size;i++)
+    {
+        printf("%d\n",a[i]);
+    }
+}
+int main()
+{
+    int length;
+    printf("Enter Size of array :\n");
+    scanf("%d",&length);
+    int a[length];
+    printf("Enter %d numbers :\n",length);
+    for(int i=0;i<length;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    sort(a,length);
+    printf("\n");
+    print(a,length);
+    printf("\n");
+    return 0;
+}
\ No newline at end of file
diff --git a/gaurav.122467/DSA3 b/gaurav.122467/DSA3
new file mode 100755
index 0000000..760502b
Binary files /dev/null and b/gaurav.122467/DSA3 differ
diff --git a/gaurav.122467/DSA3.c b/gaurav.122467/DSA3.c
new file mode 100644
index 0000000..2c50265
--- /dev/null
+++ b/gaurav.122467/DSA3.c
@@ -0,0 +1,39 @@
+#include <stdio.h>
+void search(int a[],int size)
+{
+    int elem=0,f=0;
+    printf("Enter element to be searched : \n");
+    scanf("%d",&elem);
+    for(int i=0;i<size;i++)
+    {
+        if(elem == a[i])
+        {
+            printf("Element Found !\n");
+            printf("At index position : %d \n",i);
+            f=1;
+            break;
+        }
+        else
+        {
+            continue;
+        }
+    }
+    if(f!=1)
+    {
+        printf("Element Not found.\n");
+    }
+}
+int main()
+{
+    int len;
+    printf("Enter Size of Array-: \n");
+    scanf("%d",&len);
+    int a[len];
+    printf("Enter %d numbers: \n",len);
+    for(int i=0;i<len;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    search(a,len);
+    return 0;
+}
\ No newline at end of file
diff --git a/gaurav.122467/DSA4 b/gaurav.122467/DSA4
new file mode 100755
index 0000000..fbc0f6b
Binary files /dev/null and b/gaurav.122467/DSA4 differ
diff --git a/gaurav.122467/DSA4.c b/gaurav.122467/DSA4.c
new file mode 100644
index 0000000..440ab92
--- /dev/null
+++ b/gaurav.122467/DSA4.c
@@ -0,0 +1,40 @@
+#include <stdio.h>
+void sort(int a[],int size)
+{
+    int temp;
+    for(int i=0;i<size;i++)
+    {
+        for(int j=i+1;j<size;j++)
+        {
+            if(a[i]>a[j])
+            {
+                temp=a[j];
+                a[j]=a[i];
+                a[i]=temp;
+            }
+        }
+    }
+}
+void print(int a[],int size)
+{
+    printf("Sorted Array is-: \n");
+    for(int i=0;i<size;i++)
+    {
+        printf("%d\n",a[i]);
+    }
+}
+int main()
+{
+    int len;
+    printf("Enter Length of the array :\n");
+    scanf("%d",&len);
+    int a[len];
+    printf("Enter elements of the array :\n");
+    for(int i=0;i<len;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    sort(a,len);
+    print(a,len);
+    return 0;
+}
\ No newline at end of file
diff --git a/gaurav.122467/DSA5 b/gaurav.122467/DSA5
new file mode 100755
index 0000000..7be79af
Binary files /dev/null and b/gaurav.122467/DSA5 differ
diff --git a/gaurav.122467/DSA5.c b/gaurav.122467/DSA5.c
new file mode 100644
index 0000000..fafc586
--- /dev/null
+++ b/gaurav.122467/DSA5.c
@@ -0,0 +1,33 @@
+#include <stdio.h>
+int fib(int c) 
+{
+    if(c == 0)
+    {
+        return 0;
+    }
+    else if(c == 1)
+    {
+        return 1;
+    }
+    else
+    {
+        return ( fib(c-1) + fib(c-2) );
+    }   
+}
+int main()
+{
+    int c=0,l=0,lim=0;
+    printf("Enter Limit till which you want to calculate fibonacci series :\n");    
+    scanf("%d",&l);
+    printf("\n");
+    for(int i=1;i<=l;i++)
+    {
+        printf("%d\n",fib(c));
+        c++;
+    }    
+    return 0;
+}
+/* 0 1 1 2 3 5 8 ....
+   a b c
+     a b c
+       a b c */
\ No newline at end of file
diff --git a/gaurav.122467/DSA6 b/gaurav.122467/DSA6
new file mode 100755
index 0000000..3a121c5
Binary files /dev/null and b/gaurav.122467/DSA6 differ
diff --git a/gaurav.122467/DSA6.c b/gaurav.122467/DSA6.c
new file mode 100644
index 0000000..6123395
--- /dev/null
+++ b/gaurav.122467/DSA6.c
@@ -0,0 +1,39 @@
+#include <stdio.h>
+#include <string.h>
+void palindrome(char str[],int len)
+{
+    int p=1;
+    for(int i=0;i<len;i++)
+    {
+        if(str[i] == str[len-1-i])
+        {
+            p=0;
+        }
+        else
+        {
+            p=1;
+            break;
+        }
+    }
+    if (p == 1)
+    {
+        printf("Not Palindrome");
+    }
+    else
+    {
+        printf("Palindrome");
+    }
+}
+int main()
+{
+    char str[1000];
+    int len=0;
+    printf("Enter String :\n");
+    scanf("%s",str);
+    for(int i=0;str[i]!='\0';i++)
+    {
+        len++;
+    }
+    palindrome(str,len);
+    return 0;
+}
\ No newline at end of file
diff --git a/gaurav.122467/DSA8 b/gaurav.122467/DSA8
new file mode 100755
index 0000000..eed95b2
Binary files /dev/null and b/gaurav.122467/DSA8 differ
diff --git a/gaurav.122467/DSA8.c b/gaurav.122467/DSA8.c
new file mode 100644
index 0000000..bd37337
--- /dev/null
+++ b/gaurav.122467/DSA8.c
@@ -0,0 +1,31 @@
+#include <stdio.h>
+void count(char str[],int len)
+{
+    int v=0,c=0;
+    for(int i=0;i<=len;i++)
+    {
+            if(str[i] == 'a' || str[i] == 'e' || str[i] == 'i' || str[i] == 'o' || str[i] == 'u')
+            {
+                v++;
+            }
+            else
+            {
+                c++;
+            }
+    }
+    printf("No. of Vowels : %d\n",v);
+    printf("No. of Consonents : %d\n",c);
+}
+int main()
+{
+    int len=0;
+    char str[1000];
+    printf("Enter string : \n");
+    scanf("%s",str);
+    for(int i=1;i<str[i]!='\0';i++)
+    {
+        len++;
+    }
+    count(str,len);
+    return 0;
+}
\ No newline at end of file