diff --git a/.DS_Store b/.DS_Store
index 2aa4c3c..a327355 100644
Binary files a/.DS_Store and b/.DS_Store differ
diff --git a/C Programs/Fcfs.c b/C Programs/Fcfs.c
index f777db3..86569b9 100644
--- a/C Programs/Fcfs.c	
+++ b/C Programs/Fcfs.c	
@@ -1,37 +1,45 @@
-#include<stdio.h>
-#include<stdlib.h>
-#include<unistd.h>
-
-void main(){
-    int i=0,n,at[100],bt[100],ct[100],tat[100],wt[100];
-    float totalTat =0, totalWt=0;
-
-    printf("enter the limit of process required");
-    scanf("%d",&n);
-
-    for(i=0;i<n;i++){
-
-        printf("enter the arrival time of %d process ",i+1);
+#include <stdio.h>
+int main()
+{
+  int i,n,at[20],bt[20],ct[20],tat[20],wt[20],sum=0;
+  float totWT=0,totTAT=0;
+  printf("Enter the no:of processes:");
+  scanf("%d",&n);
+ 
+  for(i=0;i<n;i++)
+  {
+        printf("\nEnter arrival time of process %d :",i);
         scanf("%d",&at[i]);
-        printf("enter the burst  time of %d process",i+1);
+        printf("\nEnter burst time of process %d :",i);
         scanf("%d",&bt[i]);
-    }
-     ct[0]= bt[0];
-    for(i=1;i<n;i++){
-        ct[i] =ct[i-1]+bt[i] ;
-    }
-
-    for(i=0;i<n;i++){
+  }
+ 
+  for(i=0;i<n;i++)
+  {
+        sum+=bt[i];
+        ct[i]=sum;
+  }
+ 
+  for(i=0;i<n;i++)
+  {
         tat[i]=ct[i]-at[i];
-        totalTat += tat[i];
-    }
-    for(i=0;i<n;i++){
+        totTAT+=tat[i];
+  }
+ 
+  for(i=0;i<n;i++)
+  {
         wt[i]=tat[i]-bt[i];
-        totalWt += wt[i];
+        totWT+=wt[i];
+  }
+  printf("\nTABLE");
+  printf("\n-----------");
+  printf("\n\nP.NO\t AT\t BT\t CT\t TA\t WT");
+ 
+  for(i=0;i<n;i++)
+    {
+        printf("\nP%d\t %d\t %d\t %d\t %d\t %d",i,at[i],bt[i],ct[i],tat[i],wt[i]);
     }
-    for(i=0;i<n;i++){
-    printf("%d %d %d %d %d %d \n",(i+1),at[i],bt[i],ct[i],tat[i],wt[i]);
-    }
-    printf("Avg tat: %f",totalTat/n);
-    printf("Avg wt: %f",totalWt/n);
-}
+
+  printf("\nAverage Turnaround Time: %f",totTAT/n);
+  printf("\nAverage Waiting Time: %f\n",totWT/n);
+}
\ No newline at end of file
diff --git a/C Programs/Hary.c b/C Programs/Hary.c
index 5785ca9..815c16a 100644
--- a/C Programs/Hary.c	
+++ b/C Programs/Hary.c	
@@ -1,28 +1,13 @@
-#include <stdio.h>
+#include <reg51.h>
 void main()
-{
-char base_digits[16] =
-{'0', '1', '2', '3', '4', '5', '6', '7',
-'8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};
-int converted_number[64];
-int number_to_convert;
-int next_digit, base, index=0;
-printf("Decimal to other base conversion program \n");
-printf("Enter a decimal number ");
-scanf("%d",&number_to_convert);
-printf("Enter desired base to convert: ");
-scanf("%d",&base);
-while (number_to_convert != 0)
-{
-converted_number[index] = number_to_convert % base;
-number_to_convert = number_to_convert / base;
-++index;
-}
---index;
-printf("\n\nConverted Number from base 10 to base %d= ",base);
-for( ; index>=0; index--)
-{
-printf("%c", base_digits[converted_number[index]]);
-}
-printf("\n");
+{ 
+	unsigned char xdata *ptr=0x4000;
+  unsigned char xdata *ptr1=0x401a;
+	int i;
+	for(i=0;i<5;i++)
+	{
+		*ptr1=*ptr;
+		ptr++;
+		ptr1++;
+	}
 }
diff --git a/C Programs/HelLoworld.c b/C Programs/HelLoworld.c
index b0ed29d..39c85c8 100644
--- a/C Programs/HelLoworld.c	
+++ b/C Programs/HelLoworld.c	
@@ -1,9 +1,6 @@
 #include <stdio.h>
 int main() {
-  printf("Hello, world");
-  printf("https://github.com/Gowrishankarvv");  
-  return 0;
+   printf(" Hello, World!");
+
 }
- /* HELLO WORLD PROGRAM */
- /* code by gowrishankarvv */
-  
+
diff --git a/C Programs/InsertElement.c b/C Programs/InsertElement.c
new file mode 100644
index 0000000..adaeb1e
--- /dev/null
+++ b/C Programs/InsertElement.c	
@@ -0,0 +1,29 @@
+#include <stdio.h>
+
+int main()
+{
+    int arr[100];
+    int i, x, pos, n = 7;
+ 
+    for (i = 0; i < 7; i++)
+        arr[i] = i + 1;
+ 
+    for (i = 0; i < n; i++)
+        printf("%d ", arr[i]);
+    printf("\n");
+ 
+    x = 28;
+    pos = 5;
+    n++;
+ 
+    for (i = n-1; i >= pos; i--)
+        arr[i] = arr[i - 1];
+
+    arr[pos - 1] = x;
+
+    for (i = 0; i < n; i++)
+        printf("%d ", arr[i]);
+    printf("\n");
+ 
+    return 0;
+}
diff --git a/C Programs/MatrixTranspose.c b/C Programs/MatrixTranspose.c
index be93599..8b7be0f 100644
--- a/C Programs/MatrixTranspose.c	
+++ b/C Programs/MatrixTranspose.c	
@@ -1,34 +1,33 @@
-/*Program to print transpose of a matrix*/
 #include<stdio.h>
-      void main()
-      {
-	int i,j,a,b;
-	int n[10][10];
-	int m[10][10];
-	printf("Enter number of rows and columns of matrix\n");
-	scanf("%d%d",&a,&b);
-	printf("Enter matrix\n");
-	for(i=0;i<a;i++)
-	  {
-	    for(j=0;j<b;j++)
-	      {
-		scanf("%d",&n[i][j]);
-	       }
-	  }
-	for(i=0;i<b;i++)
-	  {
-	    for(j=0;j<a;j++)
-	      {
-		m[i][j]=n[j][i];
-	       }
-	   }
-	printf("Transpose of given matrix\n");
-	for(i=0;i<b;i++)
-	  {
-	    for(j=0;j<a;j++)
-	      {
-		printf("%d ",m[i][j]);
-	       }
-	    printf("\n");
-	  }
-        }
+void main()
+{
+ int i,j,a,b;
+ int n[10][10];
+ int m[10][10];
+ printf("enter the order of the matrix \n");
+ scanf("%d%d",&a,&b);
+ printf("enter the matrix \n");
+ for(i=0;i<a;i++)
+  {
+    for(j=0;j<b;j++)
+     {
+       scanf("%d",&n[i][j]);
+     }
+  }
+ for(i=0;i<b;i++)
+  {
+    for(j=0;j<a;j++)
+     {
+       m[i][j]=n[j][i];
+     }
+  }
+ printf("transpose of the given matrix \n");
+ for(i=0;i<b;i++)
+  {
+    for(j=0;j<a;j++)
+     {
+       printf("%d ",m[i][j]);
+     }
+    printf("\n");
+  }
+}
diff --git a/C Programs/MergeArrays.c b/C Programs/MergeArrays.c
new file mode 100644
index 0000000..05d05c5
--- /dev/null
+++ b/C Programs/MergeArrays.c	
@@ -0,0 +1,45 @@
+/* C Program to Merge Two Arrays using For Loop */
+#include<stdio.h>
+ 
+int main()
+{
+ 	int aSize, bSize, mSize, i, j;
+	int a[10], b[10], Merged[20];
+  
+ 	printf("\n Please Enter the First Array Size  :  ");
+ 	scanf("%d", &aSize);
+ 
+ 	printf("\nPlease Enter the First Array Elements :  ");
+ 	for(i = 0; i < aSize; i++)
+  	{
+      	scanf("%d", &a[i]);
+  	}
+  	printf("\n Please Enter the Second Array Size  :  ");
+ 	scanf("%d", &bSize);
+   
+ 	printf("\nPlease Enter the Second Array Elements  :  ");
+ 	for(i = 0; i < bSize; i++)
+  	{
+      	scanf("%d", &b[i]);
+  	}
+  	
+  	for(i = 0; i < aSize; i++)
+  	{
+      	Merged[i] = a[i];
+  	}
+  	
+	mSize = aSize + bSize;
+ 
+ 	for(i = 0, j = aSize; j < mSize && i < bSize; i++, j++)
+  	{
+  		Merged[j] = b[i];
+  	}
+ 
+ 	printf("\n a[%d] Array Elements After Merging \n", mSize); 
+ 	for(i = 0; i < mSize; i++)
+  	{
+    	printf(" %d \t ",Merged[i]);
+  	}
+ 
+  	return 0;
+}
\ No newline at end of file
diff --git a/C Programs/Producer_Consumer.c b/C Programs/Producer_Consumer.c
index 7004707..d4a23f1 100644
--- a/C Programs/Producer_Consumer.c	
+++ b/C Programs/Producer_Consumer.c	
@@ -1,71 +1,68 @@
-//Producer Consumer
 #include<stdio.h>
 #include<stdlib.h>
- 
-int mutex=1,full=0,empty,x=0;
- 
-int main()
-{
-    int n;
-    printf("Enter the size: ");
-    scanf("%d",&n);
-    empty=n;
-    void producer();
-    void consumer();
-    int wait(int);
-    int signal(int);
-    printf("\n1.Producer\n2.Consumer\n3.Exit");
-    while(1)
-    {
-        printf("\nEnter your choice:");
-        scanf("%d",&n);
-        switch(n)
-        {
-            case 1:    if((mutex==1)&&(empty!=0))
-                        producer();
-                    else
-                        printf("Buffer is full!!");
-                    break;
-            case 2:    if((mutex==1)&&(full!=0))
-                        consumer();
-                    else
-                        printf("Buffer is empty!!");
-                    break;
-            case 3:
-                    exit(0);
-                    break;
-        }
+#include<unistd.h>
+
+void producer();
+void consumer();
+int wait(int);
+int signal(int);
+
+ int mutex =1,c,produced=0,empty,item=0;
+void main(){
+
+    printf("enter the space required");
+    scanf("%d",&empty);
+    printf("1.produce 2.consume 3.exit");
+    while(1){
+
+       printf("enter the choice");
+       scanf("%d",&c);
+
+       switch(c){
+           case 1 :if(mutex == 1 && empty!=0)
+                      producer();
+                    else{
+                        printf("buffer is full");
+                    }
+                      break;
+            case 2 :if(mutex == 1 && produced!=0)
+                      consumer();
+                      else{
+                        printf("buffer is empty");
+                    }
+                      break;
+            case 3 :exit(0);
+                    break;       
+            default : printf("error");
+                      break;
+       }
+
     }
-   
-    return 0;
+
 }
- 
-int wait(int s)
-{
-    return (--s);
+
+int signal(int p){
+    return (++p);
 }
- 
-int signal(int s)
-{
-    return(++s);
+int wait(int p){
+    return (--p);
 }
- 
-void producer()
-{
+
+void producer(){
     mutex=wait(mutex);
-    full=signal(full);
+    produced=signal(produced);
     empty=wait(empty);
-    x++;
-    printf("\nProducer produces the item %d",x);
-    mutex=signal(mutex);
+    item++;
+   printf("%d item created",item);
+
+   mutex=signal(mutex);
 }
- 
-void consumer()
-{
+
+void consumer(){
     mutex=wait(mutex);
-    full=wait(full);
-    empty=signal(empty);
-    printf("\nConsumer consumes item %d",x);
-    x--;
-    mutex=signal(mutex);
+    produced=wait(produced);
+    empty=signal(empty); 
+   printf("%d item created",item);
+   item--;
+   mutex=signal(mutex);
 }
diff --git a/C Programs/Sjf.c b/C Programs/Sjf.c
index de606e1..d0273ec 100644
--- a/C Programs/Sjf.c	
+++ b/C Programs/Sjf.c	
@@ -1,118 +1,81 @@
-//2. PROGRAM OF STF
-
-#include <stdio.h>
-
+#include<stdio.h>
 int main()
-
-{
-
-int at [100], bt[100], proces [100], ct [100], tat [100], wt [100]; 
-int n, i, j, temp, current_time=0, start_time, completed=0 ,count;
-float avg_tat=0.0, avg_wt=0.0;
-
-
-
-printf ("Enter the number of processes:");
-
-scanf ("%d", &n);
-for(i=0; i<n; i++)
-{
-printf ("\n Enter the arival time of process %d :", i); 
-scanf ("%d", & at [i]); 
-printf ("\n Enter the burst time of process %d :", i); 
-scanf ("%d", & bt[i]); 
-proces [i]= i; 
-printf("\n");
-}
-for(i=0; i<n-1; i++)
-{
-for (j=i+1; j<n; j++) 
-{ 
-	if (at[i]> at [j])
-
-	{
-
-temp=at[i]; 
-at[i] = at[j];
-
-at[j] = temp;
-temp=bt[i];
-bt[i]=bt[j];
-bt[j]=temp;
-
-temp = proces [i]; 
-proces [i] = proces [j];
-proces[j]=temp;
-}
-}
-}
-
-//Scanned with CamScanne
-
-printf ("\n\n Process\t Arival time\t Burst Time\t Completion time\t Turn Around time\t waiting Time\n\n");
-
-while (completed <n)
-
-{
-
-count = 0;
-
-for (i=completed; i<n; i++)
-{
-if (at[i]<= current_time)
-count++;
-
-else{
-
-break;
-}
-}
-if (count >1)
-
-for (i=completed; i< (completed + count-1); i++)
 {
- for(j=i+1; j<completed + count; j++)
-
-{
-
-if (bt[i]>bt[j])
-
-{
-temp=at[i]; 
-at[i] = at[j];
-
-at[j] = temp;
-temp=bt[i];
-bt[i]=bt[j];
-bt[j]=temp;
-
-temp = proces [i]; 
-proces [i] = proces [j];
-proces[j]=temp;
-
-}}}
-
-
-start_time = current_time; 
-ct[completed]=start_time + bt [completed]; 
-tat [completed]= ct [completed]-at [completed]; 
-wt [completed]=tat [completed]-bt[completed]; 
-current_time = ct [completed]; 
-printf ("P%d\t\t%d\t\t%d\t\t%d\t\t %d\t\t %d", proces [completed], at[completed], bt[completed],ct[completed], tat [completed], wt [completed]);
-printf("\n");
-
-avg_tat+=tat [completed];
-avg_wt+= wt[completed];
-
-completed++;
-}
-avg_tat=avg_tat/n;
-
-avg_wt = avg_wt/n;
-
-printf ("Average Turn around time=%.f\n", avg_tat); 
-printf ("Average waiting time = %f \n", avg_wt);
-
-return 0;
-
-}
+            int at[10],bt[10],pr[10];
+            int n,i,j,temp,time=0,count,over=0,sum_wait=0,sum_turnaround=0,start;
+            float avgwait,avgturn;
+            printf("Enter the number of processes\n");
+            scanf("%d",&n);
+            for(i=0;i<n;i++)
+            {
+                        printf("Enter the arrival time and execution time for process %d\n",i+1);
+                        scanf("%d%d",&at[i],&bt[i]);
+                        pr[i]=i+1;
+            }
+            for(i=0;i<n-1;i++)
+            {
+                        for(j=i+1;j<n;j++)
+                        {
+                                    if(at[i]>at[j])
+                                    {
+                                                temp=at[i];
+                                                at[i]=at[j];
+                                                at[j]=temp;
+                                                temp=bt[i];
+                                                bt[i]=bt[j];
+                                                bt[j]=temp;
+                                                temp=pr[i];
+                                                pr[i]=pr[j];
+                                                pr[j]=temp;     
+                                    }
+                        
+                        }
+            }
+            printf("\n\nProcess\t\tArrival time\t\tBurst time\t\tWaiting time\t\t\t\tTurnaround time\n\n");
+            while(over<n)
+            {
+                        count=0;
+                        for(i=over;i<n;i++)
+                        {
+                                    if(at[i]<=time)
+                                    count++;
+                                    else
+                                    break;
+                        }
+                        if(count>1)
+                        {
+                                    for(i=over;i<over+count-1;i++)
+                                    {
+                                                for(j=i+1;j<over+count;j++)
+                                                {
+                                                            if(bt[i]>bt[j])
+                                                            {
+                                                                        temp=at[i];
+                                                                        at[i]=at[j];
+                                                                        at[j]=temp;
+                                                                        temp=bt[i];
+                                                                        bt[i]=bt[j];
+                                                                        bt[j]=temp;
+                                                                        temp=pr[i];
+                                                                        pr[i]=pr[j];
+                                                                        pr[j]=temp;     
+                                                            }
+                                                }                     
+                                    }
+                        }
+                        start=time;
+                        time+=bt[over];
+                         printf("p[%d]\t\t\t%d\t\t\t\t\t%d\t\t\t\t\t%d\t\t\t\t\t\t%d\n",pr[over],
+                                    at[over],bt[over],time-at[over]-bt[over],time-at[over]);
+                        sum_wait+=time-at[over]-bt[over];
+
+
+                        sum_turnaround+=time-at[over];
+                        over++;
+            }
+            avgwait=(float)sum_wait/(float)n;
+            avgturn=(float)sum_turnaround/(float)n;
+            printf("Average waiting time is %f\n",avgwait);
+            printf("Average turnaround time is %f\n",avgturn);
+            return 0;
+}   
diff --git a/C Programs/Sum.c b/C Programs/Sum.c
index 0647b49..3accdd8 100644
--- a/C Programs/Sum.c	
+++ b/C Programs/Sum.c	
@@ -1,8 +1,6 @@
-#include<stdio.h>
-int main() {
-int a, b, sum;
-printf("\nEnter two no: ");
-scanf("%d %d", &a, &b);
-sum = a + b;
-printf("Sum : %d", sum);
-return(0);
+#include<iostream.h>
+void main()
+{
+  int s=10;
+  printf("sum=%d",s);
+}
diff --git a/C Programs/Thread.c b/C Programs/Thread.c
index 372eecb..b9de86c 100644
--- a/C Programs/Thread.c	
+++ b/C Programs/Thread.c	
@@ -1,37 +1,36 @@
-/*
-   program to create a thread called add, which acess two integers from the user and print the sum.
-   
-*/
 #include <stdio.h>
-#include <pthread.h> //Include the header file " pthread.h ".
 #include <unistd.h>
+#include <pthread.h>
 
-int global[2];  //// Global variable
+int global[2];
 
-void *sum_thread(void *arg)
+void *sumOf(void *arg)
 {
+    int *arr;
+    arr = arg;
+
     int n1,n2,sum;
-    n1 = global[0];
-    n2 = global[1];
+    n1=arr[0];
+    n2=arr[1];
     sum = n1+n2;
 
-    printf("Sum = %d\n",sum);
+    printf("Sum , %d + %d = %d\n",n1,n2,sum);
 
     return NULL;
 }
-int main()
+
+int main() 
 {
-    printf("Enter the first integer:- ");
+    printf("Enter First number : ");
     scanf("%d",&global[0]);
 
-    printf("Enter the second integer:- ");
+    printf("Enter Second number : ");
     scanf("%d",&global[1]);
 
-    pthread_t add_thread;  //thread decleration.Here " pthread_t " is the datatype.
-    pthread_create(&add_thread, NULL, sum_thread, global);  //thread is created.
-    pthread_join(add_thread,NULL);  // // Waiting for the created thread to terminate.
-   
+    pthread_t add; //unsigned integer value that stores the thread id of the thread created.
+    pthread_create(&add,NULL,sumOf,global); //thread creation
+    pthread_join(add,NULL);//waiting for the termination of a thread.
+    printf("Thread ID: %lu ",add );//Printing thread ID
+
     return 0;
 }
-// to compile the program --->" gcc -o test prgrmName.c -pthread "
-//  instead of ./a.out use --> "  ./test  "   
\ No newline at end of file
diff --git a/C++ Programs/Haaryy.cpp b/C++ Programs/Haaryy.cpp
index 66b62f6..33c5628 100644
--- a/C++ Programs/Haaryy.cpp	
+++ b/C++ Programs/Haaryy.cpp	
@@ -1,42 +1,19 @@
-// C++ program for implementation of Bubble sort 
-#include <bits/stdc++.h> 
-using namespace std; 
+#include <iostream>
+using namespace std;
 
-void swap(int *xp, int *yp) 
-{ 
-	int temp = *xp; 
-	*xp = *yp; 
-	*yp = temp; 
-} 
+int main() {
+    int n, reversedNumber = 0, remainder;
 
+    cout << "Enter an integer: ";
+    cin >> n;
 
-void bubbleSort(int arr[], int n) 
-{ 
-	int i, j; 
-	for (i = 0; i < n-1; i++)	 
-	
-	// Last i elements are already in place 
-	for (j = 0; j < n-i-1; j++) 
-		if (arr[j] > arr[j+1]) 
-			swap(&arr[j], &arr[j+1]); 
-} 
+    while(n != 0) {
+        remainder = n%10;
+        reversedNumber = reversedNumber*10 + remainder;
+        n /= 10;
+    }
 
+    cout << "Reversed Number = " << reversedNumber;
 
-void printArray(int arr[], int size) 
-{ 
-	int i; 
-	for (i = 0; i < size; i++) 
-		cout << arr[i] << " "; 
-	cout << endl; 
-} 
-
- 
-int main() 
-{ 
-	int arr[] = {64, 34, 25, 12, 22, 11, 90}; 
-	int n = sizeof(arr)/sizeof(arr[0]); 
-	bubbleSort(arr, n); 
-	cout<<"Sorted array: \n"; 
-	printArray(arr, n); 
-	return 0; 
-} 
+    return 0;
+}
diff --git a/C++ Programs/Mergesort.cpp b/C++ Programs/Mergesort.cpp
index 0e6f39b..d5c424d 100644
--- a/C++ Programs/Mergesort.cpp	
+++ b/C++ Programs/Mergesort.cpp	
@@ -1,81 +1,67 @@
-# Merge Sort is a kind of Divide and Conquer algorithm in computer programming. It is one of the most popular sorting algorithms and a great way to develop confidence in building recursive algorithms.
-
 #include<iostream>
+#include<bits/stdc++.h>
+
+
 using namespace std;
-int Merge(int A,int L,int R,)
-{
-  int i=0;
-  int j=0;
-  int k=0;
-  while(i<L.length() && j<R.length())
-  {
-    if(L[i]<=R[i])
-    {
-      A[k]=L[i];
-      i=i+1;
-      k=k+1;
-    }
-    else
-    {
-      A[k]=R[j];
-      j=j+1;
-      k=k+1;
-    }
-  }
-  while(i<L.length())
-  {
-    A[k]=L[i];
-    i=i+1;
-    k=k+1;
-  }
-  while(j<R.length())
-  {
-    A[k]=R[j];
-    j=j+1;
-    k=k+1;
-}
 
-void MergeSort(A)
-{
-  int n=A.length();
-  if(n<2)
-  {
-    return;
-  }
-  int mid=n/2;
-  for(i=0;i<mid-1;i++)
-  {
-    L[i]=A[i];
-  }
-  for(i=mid;i<n-1;i++)
-  {
-    R[i-mid]=A[i];
-  }
-  MergeSort(L);
-  MergeSort(R);
-  Merge(L,R,A);
+int merge(vector <int> &arr,int s,int e){
+	int i=s;
+	int m =(s+e)/2;
+	int j = m+1;
+   vector <int> temp;
+    vector <int> res;
+
+
+   int cnt =0;
+	while(i <= m and j <=e){
+		    
+		if(arr[i]<arr[j]){
+			temp.push_back(arr[i]);
+			i++;
+		}else{
+			cnt += (m-i+1);
+			res.push_back(cnt);
+			temp.push_back(arr[j]);
+			j++;
+		};
+
+	};
+
+   while(i <=m){
+		temp.push_back(arr[i]);
+		i++;
+	}
+	while(j <=e){
+		temp.push_back(arr[j]);
+		j++;
+	};
+   int k =0;
+   for(int idx = s; idx <=e;idx++){
+   	arr[idx] = temp[k++];
+   }
+   
+   return cnt;
 }
 
-int main()
-{
-int n, i;
-	cout<<"\nEnter the number of data element to be sorted: ";
-	cin>>n;
- 
-	int arr[n];
-	for(i = 0; i < n; i++)
-	{
-		cout<<"Enter element "<<i+1<<": ";
-		cin>>arr[i];
+int mergeSort(vector <int> &arr,int s ,int e){
+	if(s >= e){
+		return 0;
 	}
- 
-	MergeSort(arr, 0, n-1);
- 
-	// Printing the sorted data.
-	cout<<"\nSorted Data ";
-	for (i = 0; i < n; i++)
-        cout<<"->"<<arr[i];
- 
-	return 0;
+
+	int mid = (s+e)/2;
+	int c1 = mergeSort(arr,s,mid);
+	int c2 =mergeSort(arr,mid+1,e);
+    int ci = merge(arr,s,e);
+
+    //merge function
+    return c1 +c2 + ci;
+
 }
+
+int main(){
+	vector <int> arr{3,66,5,2,78,9};
+	int s = 0;
+	int e = arr.size()-1;
+	cout << mergeSort(arr,s,e) <<endl;
+    return 0;
 }
diff --git a/Java Programs/Haaryy.java b/Java Programs/Haaryy.java
index 2c7dba5..01d73d8 100644
--- a/Java Programs/Haaryy.java	
+++ b/Java Programs/Haaryy.java	
@@ -1,22 +1,14 @@
-import java.io.*;
-public class Main {
+import java.util.*;
 
-    public static void main(String[] args) {
+public class tempConverter {
 
-        int num = 29;
-        boolean flag = false;
-        for(int i = 2; i <= num/2; ++i)
-        {
-            if(num % i == 0)
-            {
-                flag = true;
-                break;
-            }
-        }
+	public static void main(String[] args) {
+		System.out.println("Enter temperature in Celsius");
+		Scanner sc = new Scanner(System.in);
+		float temp=sc.nextFloat();
+		temp=(temp*9/5)+32;
+		System.out.println("Converted temp in Fahrenheat : "+temp);
+		sc.close();
+	}
 
-        if (!flag)
-            System.out.println(num + " is a prime number.");
-        else
-            System.out.println(num + " is not a prime number.");
-    }
 }
diff --git a/Java Programs/Queue.java b/Java Programs/Queue.java
index 3094f7c..41b851e 100644
--- a/Java Programs/Queue.java	
+++ b/Java Programs/Queue.java	
@@ -1,84 +1,106 @@
-class Queue 
-{ 
-	int front, rear, size, capacity, array[] ; 
-	
-	public Queue(int capacity) 
-	{ 
-		this.capacity = capacity; 
-		front = this.size = 0; 
-		rear = capacity - 1; 
-		array = new int[this.capacity]; 
-	} 
-
-
-	boolean isFull(Queue queue) 
-	{ 
-		return (queue.size == queue.capacity); 
-	} 
- 
-	boolean isEmpty(Queue queue) 
-	{ 
-		return (queue.size == 0); 
-	} 
-
-	void enqueue(int item) 
-	{ 
-		if (isFull(this)) 
-			return; 
-		this.rear = (this.rear + 1) 
-					% this.capacity; 
-		this.array[this.rear] = item; 
-		this.size = this.size + 1; 
-		System.out.println(item 
-						+ " enqueued to queue"); 
-	} 
-
-	int dequeue() 
-	{ 
-		if (isEmpty(this)) 
-			return Integer.MIN_VALUE; 
-
-		int item = this.array[this.front]; 
-		this.front = (this.front + 1) 
-					% this.capacity; 
-		this.size = this.size - 1; 
-		return item; 
-	} 
-
-	int front() 
-	{ 
-		if (isEmpty(this)) 
-			return Integer.MIN_VALUE; 
-
-		return this.array[this.front]; 
-	} 
-
-	int rear() 
-	{ 
-		if (isEmpty(this)) 
-			return Integer.MIN_VALUE; 
 
-		return this.array[this.rear]; 
-	} 
-} 
- 
-public class Test { 
-	public static void main(String[] args) 
-	{ 
-		Queue queue = new Queue(1000); 
+import java.util.Scanner;
 
-		queue.enqueue(10); 
-		queue.enqueue(20); 
-		queue.enqueue(30); 
-		queue.enqueue(40); 
+public class Queue {
 
-		System.out.println(queue.dequeue() 
-						+ " dequeued from queue\n"); 
-
-		System.out.println("Front element is "
-						+ queue.front()); 
+	static Scanner sc = new Scanner(System.in);
+	static int  n, front = -1, rear = -1, item;
+	static int[] Ar = new int[10];
+	
+	Queue() {
+		
+	}
+	
+	Queue(int n){
+		int ch;
+		do
+		  {
+			System.out.printf("\n----Menu----\n\n1.Enqueue\n2.Dequeue\n3.Exit\n");
+			System.out.printf("Enter the choice#:");
+			ch=sc.nextInt();
+		    switch (ch)
+		    {
+		    case 1:
+		      enqueue(n);
+		      break;
+		    case 2:
+		      dequeue();
+		      break;
+		    default:
+		      break;
+		    }
+		  } while (ch < 3);
+	}
+		
+	public static void main(String[] args) {
+		Scanner sc1 = new Scanner(System.in);
+		int n;
+		
+		System.out.printf("Enter the size of Queue:");
+		n=sc1.nextInt();
+		
+		new Queue(n);
+		  
+	}
+	
+	//Function To Insert Element To Queue
+	public static void enqueue(int n)
+	{
+	  if (rear >= n - 1)
+	  {
+	    System.out.println("\n---Overflow!!!---\n\n");
+	  }
+	  else
+	  {
+	    if (front == -1 && rear == -1)
+	    {
+	      front++;
+	    }
+	    System.out.println("Enter the element to be inserted:");
+	    item= sc.nextInt();
+	    rear++;
+	    Ar[rear] = item;
+	  }
+	  display(rear);
+	}
+	
+	//Function To Delete Element In Queue
+	public static void dequeue ()
+	{
+	  if (front == -1)
+	  {
+		  System.out.println("\n---Error! Underflow!!!---\n\n");
+	  }
+	  else
+	  {
+	    item = Ar[front];
+	    System.out.printf("The element deleted is %d\n", item);
+	    if (front == rear)
+	    {
+	      front = -1;
+	      rear = -1;
+	      System.out.printf("\n---Error! Queue is empty---\n\n");
+	    }
+	    else
+	    {
+	      front++;
+	      display(rear);
+	    }
+	  }
+	}
+	
+	//Function To Display Elements In Queue
+	public static void display(int rear)
+	{
+	  int i;
+	  System.out.printf("\nThe current Queue is\n");
+	  for (i = front; i <= rear; i++)
+	  {
+		  System.out.printf("%d ", Ar[i]);
+	  }
+	  System.out.printf("\n");
+	}
+	
+	
+}
 
-		System.out.println("Rear element is "
-						+ queue.rear()); 
-	} 
-} 
diff --git a/Python Programs/Function.py b/Python Programs/Function.py
index b8c083e..fc3bd16 100644
--- a/Python Programs/Function.py	
+++ b/Python Programs/Function.py	
@@ -1,4 +1,12 @@
-def Hello():
-  print("Hello from a function")
+def filter_even(number_list):
+    result_list = []
+    for number in number_list:
+        if number % 2 == 0:
+            result_list.append(number)
+    return result_list
+my_list = [1, 2, 3, 4, 5, 6, 7, 8, 9]
 
-Hello()
+even_list = filter_even(my_list)
+print(even_list)
+
+type(even_list)
diff --git a/Python Programs/Sreelakshmi-M.py b/Python Programs/Sreelakshmi-M.py
index 807dada..bc816aa 100644
--- a/Python Programs/Sreelakshmi-M.py	
+++ b/Python Programs/Sreelakshmi-M.py	
@@ -1,16 +1,43 @@
-#archery board
+# Program make a simple calculator that can add, subtract, multiply and divide using functions
 
-#Run pip install opencv-python 
-import cv2
-import numpy as np
+# This function adds two numbers 
+def add(x, y):
+   return x + y
 
-img=np.zeros((512,512,3),np.uint8)*255
-img[:]=(0,255,255)
-text="OpenCV"
+# This function subtracts two numbers 
+def subtract(x, y):
+   return x - y
 
-cv2.putText(img,text,(10,250),cv2.FONT_HERSHEY_SIMPLEX,2,(0,0,0),5)
-cv2.imshow("text",img)
+# This function multiplies two numbers
+def multiply(x, y):
+   return x * y
 
-cv2.waitkey(0)
-cv2.destroyWindow("text")
-cv2.imwrite("text.jpg",img)
+# This function divides two numbers
+def divide(x, y):
+   return x / y
+
+print("Select operation.")
+print("1.Add")
+print("2.Subtract")
+print("3.Multiply")
+print("4.Divide")
+
+# Take input from the user 
+choice = input("Enter choice(1/2/3/4):")
+
+num1 = int(input("Enter first number: "))
+num2 = int(input("Enter second number: "))
+
+if choice == '1':
+   print(num1,"+",num2,"=", add(num1,num2))
+
+elif choice == '2':
+   print(num1,"-",num2,"=", subtract(num1,num2))
+
+elif choice == '3':
+   print(num1,"*",num2,"=", multiply(num1,num2))
+
+elif choice == '4':
+   print(num1,"/",num2,"=", divide(num1,num2))
+else:
+   print("Invalid input")