diff --git a/BinarySearch.java b/BinarySearch.java
new file mode 100644
index 000000000000..2f19b426fd5b
--- /dev/null
+++ b/BinarySearch.java
@@ -0,0 +1,44 @@
+import java.util.Scanner;
+ 
+class BinarySearch 
+{
+  public static void main(String args[])
+  {
+    int c, first, last, middle, n, search, array[];
+ 
+    Scanner in = new Scanner(System.in);
+    System.out.println("Enter number of elements");
+    n = in.nextInt(); 
+    array = new int[n];
+ 
+    System.out.println("Enter " + n + " integers");
+ 
+ 
+    for (c = 0; c < n; c++)
+      array[c] = in.nextInt();
+ 
+    System.out.println("Enter value to find");
+    search = in.nextInt();
+ 
+    first  = 0;
+    last   = n - 1;
+    middle = (first + last)/2;
+ 
+    while( first <= last )
+    {
+      if ( array[middle] < search )
+        first = middle + 1;    
+      else if ( array[middle] == search ) 
+      {
+        System.out.println(search + " found at location " + (middle + 1) + ".");
+        break;
+      }
+      else
+         last = middle - 1;
+ 
+      middle = (first + last)/2;
+   }
+   if ( first > last )
+      System.out.println(search + " is not present in the list.\n");
+  }
+}
\ No newline at end of file
diff --git a/BucketSort.java b/BucketSort.java
new file mode 100644
index 000000000000..15d58f1b4ab0
--- /dev/null
+++ b/BucketSort.java
@@ -0,0 +1,19 @@
+import java.util.*;
+
+class BucketSort
+{
+	
+	public static void main(String arg[])
+	{
+		Scanner sc=new Scanner(System.in);
+		System.out.println("Enter the size of array->");
+		int n=sc.nextInt();
+		double ar[]=new double[n];
+		System.out.println("Enter "+n+" elements to be sort");
+		for(int i=0;i<n;i++)
+		{
+			ar[i]=sc.nextDouble();
+		}
+	}
+}
+//Not Completed
\ No newline at end of file
diff --git a/CountingSort.java b/CountingSort.java
new file mode 100644
index 000000000000..3859053a9b34
--- /dev/null
+++ b/CountingSort.java
@@ -0,0 +1,50 @@
+import java.util.*;
+class CountingSort
+{
+	public static void main(String arg[])
+	{
+		Scanner sc=new Scanner(System.in);
+		System.out.println("Enter the size of array->");
+		int n=sc.nextInt();
+		int ar[]=new int[n];
+		System.out.println("Enter the elements of array->");
+		for(int i=0;i<n;i++)
+		{
+			ar[i]=sc.nextInt();
+		}
+		System.out.print("Before Sorting --> ");
+		for(int i=0;i<n;i++)
+		{
+			System.out.print(ar[i]+" ");
+		}
+		  //Finding Maximum in Array
+		    int t=ar[0];
+    		for(int i=1;i<n;i++)
+    		{
+    			if(t<ar[i])
+    				t=ar[i];
+    		}
+        int c[]=new int[t+1];
+		int b[]=new int[n];
+       		
+		for(int j=0;j<n;j++)
+		{
+			c[ar[j]]=c[ar[j]]+1;
+		}
+		for(int i=1;i<=t;i++)
+		{
+			c[i]=c[i]+c[i-1];
+		}
+		for(int j=0;j<n;j++)
+		{
+			b[c[ar[j]]-1]=ar[j];
+			c[ar[j]]=c[ar[j]]-1;
+		}
+		System.out.println();
+		System.out.print("After Sorting --> ");
+		for(int i=0;i<n;i++)
+		{
+			System.out.print(b[i]+" ");
+		}
+	}
+}
\ No newline at end of file
diff --git a/FKnapSack.java b/FKnapSack.java
new file mode 100644
index 000000000000..0f15cf6af4ff
--- /dev/null
+++ b/FKnapSack.java
@@ -0,0 +1,93 @@
+import java.util.*;
+public class FKnapSack
+    { 
+	    public static float[] fknapcal(int w[],float p[],int W)
+		  {
+			int n=p.length;
+			float x[]=new float[n];
+			for(int i=0;i<n;i++)
+			{
+				x[i]=0;
+			}
+			int weight=0;
+			for(int i=0;i<n;i++)
+			{
+				if(weight+w[i]<=W)
+				{
+					x[i]=1;
+					weight=weight+w[i];
+				}
+				else
+				{
+					x[i]=(float)(W-weight)/w[i];
+					weight=W;
+					break;
+				}
+			}
+			   return x;
+		  }
+	    public static void main(String args[])
+		   {
+		     Scanner in=new Scanner(System.in);
+			 System.out.println("Enter the no of items:");
+			 int n=in.nextInt();
+			 int v[]=new int[n];
+			 int w[]=new int[n];
+			 System.out.println("Enter the value Array:");
+			 for(int i=0;i<v.length;i++)
+			   {
+			     v[i]=in.nextInt();
+			   }
+			 System.out.println("Enter weight Array:");
+			 for(int i=0;i<v.length;i++)
+			   {
+			     w[i]=in.nextInt();
+			   }
+			 System.out.println("Enter total capacity:");
+			 int W=in.nextInt();
+			 float p[]=new float[n];
+			 for(int i=0;i<n;i++)
+			    {
+				   p[i]=(float)v[i]/w[i];
+				}
+				
+		        SortRatio(p,v,w);
+				
+				float x[]=new float[n];
+				for(int i=0;i<n;i++)
+				{
+					x=fknapcal(w,p,W);
+				}
+				for(int i=0;i<n;i++)
+					System.out.println(x[i]);
+		    }
+		
+      public static void SortRatio(float p[], int v[], int w[])
+	  {
+		  float n=p.length;
+          float temp=0,flag=0;
+           for(int i=0;i<n;i++)
+            {
+              for(int j=1;j<(n-i);j++)
+               {
+                 if(p[j-1]<p[j])
+                   {
+                     temp=p[j-1];
+                     p[j-1]=p[j];
+                     p[j]=temp;
+					 temp=v[j-1];
+                     v[j-1]=v[j];
+                     v[j]=(int)temp;
+					 temp=w[j-1];
+                     w[j-1]=w[j];
+                     w[j]=(int)temp;
+            	     flag++;
+                   }
+               }
+			   if(flag==0)
+                  {
+                    break;
+                  }
+            }
+      }
+	}
\ No newline at end of file
diff --git a/Graph_coloring.java b/Graph_coloring.java
new file mode 100644
index 000000000000..cfe18bce0efa
--- /dev/null
+++ b/Graph_coloring.java
@@ -0,0 +1,44 @@
+import java.util.Scanner;
+public class Graph_coloring {
+
+ public static int store[];
+
+ Graph_coloring(int all_nodes){
+ store=new int [all_nodes];
+ }
+
+ public void coloring(int all_node,int all_colors,int ar[][]){
+ for(int i=1;i<=all_node;i++){
+ for(int j=1;j<=all_colors;j++){
+ if(is_safe(all_node,ar,j,i)){
+ store[i]=j;
+ }
+ }
+ }
+ }
+
+ public boolean is_safe(int all_node,int ar[][],int color,int node){
+ for(int i=1;i<=all_node;i++){
+ if(ar[node][i]==1 && this.store[i]==color){
+ return false; } }
+ return true; }
+
+ public static void main(String args[]){
+ System.out.println("Enter No of Node ");
+ Scanner in=new Scanner(System.in);
+ int n=in.nextInt();
+ System.out.println("Enter No of Colors ");
+ int m=in.nextInt();
+ int arr[][]=new int[n+1][n+1];
+ System.out.print("Enter no of edges\n");
+ int t=in.nextInt();
+ System.out.print("Enter edges\n");
+ for(int i=0;i<t;i++){
+ int x=in.nextInt();int y=in.nextInt();
+ arr[x][y]=1;arr[y][x]=1;
+ }
+ Graph_coloring g=new Graph_coloring(n+1);
+ g.coloring(n, m, arr);
+ int res=store[0];
+ for(int i=0;i<=n;i++){if(store[i]>res){res=store[i];}}
+ System.out.println("Hence Maximum "+res+" colors will be required to color Graph"); }}
\ No newline at end of file
diff --git a/Greedy_activity_selection.java b/Greedy_activity_selection.java
new file mode 100644
index 000000000000..5607e66ec4ae
--- /dev/null
+++ b/Greedy_activity_selection.java
@@ -0,0 +1,27 @@
+import java.util.*;
+public class Greedy_activity_selection 
+{
+	static int solve(int ar[][])
+	{
+		int max=1,lb=ar[0][1];
+        for(int i=1;i<ar.length;i++)
+		{
+			if(lb<ar[i][0])
+			{
+				max++;lb=ar[i][1];
+			} 
+		}
+        return max;
+    }
+ public static void main(String args[])
+ {
+	 System.out.println("Enter No of Activities ");
+	 Scanner in=new Scanner(System.in);
+     int n=in.nextInt(); int arr[][]=new int[n][2];
+     System.out.println("Enter activities lower and upper bound respectively\n");
+     for(int i=0;i<n;i++)
+	 {
+		 arr[i][0]=in.nextInt();
+		 arr[i][1]=in.nextInt();
+	 }
+   System.out.println("We can select maximum "+solve(arr)+" activities"); }}
\ No newline at end of file
diff --git a/InsertionSorting.java b/InsertionSorting.java
new file mode 100644
index 000000000000..1bf97408db1e
--- /dev/null
+++ b/InsertionSorting.java
@@ -0,0 +1,34 @@
+import java.util.*;
+import java.lang.*;
+public class InsertionSorting {
+public static void main(String arg[]){
+	Random r=new Random();
+	Scanner in=new Scanner(System.in);
+	System.out.println("Enter size of Array : ");
+	int n=in.nextInt();
+	int ar[]=new int[n];
+	System.out.println("Unsorted Array : ");
+	for(int i=0;i<n;i++){
+		ar[i]=r.nextInt(n)+1;
+		//System.out.println(ar[i]+" ");
+	}
+	//Implementing insertion sort
+	long startTime = System.nanoTime();
+	for(int i=1;i<n;i++){
+		int j=i-1,k=ar[i];
+		while(j>=0 && ar[j]>k){
+			ar[j+1]=ar[j];
+			--j;
+		}
+		ar[j+1]=k;
+	}
+	long endTime   = System.nanoTime();
+    		long totalTime = (endTime - startTime)/1000	;
+			
+	System.out.println("\nSorted Array : ");
+	for(int i=0;i<n;i++){
+	//System.out.print(ar[i]+" ");
+	}
+	System.out.println("Total Execution Time: "+totalTime);
+}
+}
diff --git a/Knapsack1.java b/Knapsack1.java
new file mode 100644
index 000000000000..6dbbb735601b
--- /dev/null
+++ b/Knapsack1.java
@@ -0,0 +1,72 @@
+import java.util.*;
+class Knapsack1
+{
+	public static void KnapSack(int [] v,int[] w,int n,int W)
+	{
+		int c[][]=new int[n+1][W+1];
+		
+		for(int i=0;i<=n;i++)
+		{
+			for(int j=0;j<=W;j++)
+			{
+				if(i==0 || j==0)
+				{
+					c[i][j]=0;
+				}
+				
+				else if(w[i-1]<=j)
+				{
+					if(v[i-1]+c[i-1][j-w[i-1]]>c[i-1][j])
+					{
+						c[i][j]=v[i-1]+c[i-1][j-w[i-1]];
+					}
+					else
+					{
+						c[i][j]=c[i-1][j];
+					}
+				}
+				else
+				{
+				c[i][j]=c[i-1][j];
+				}
+			}
+		}
+
+		for(int i=0;i<=n;i++)
+		{
+			for(int j=0;j<=W;j++)
+			{
+				System.out.print(c[i][j]+"\t");
+			}
+			System.out.println();
+		}
+		System.out.println();
+		System.out.println("The max value that can be put in knapsack capacity of "+W+" is "+c[n][W]);
+	}
+	
+	public static void main(String ar[])
+	{
+		Scanner sc=new Scanner(System.in);
+		System.out.println("Enter number of items");
+		int n=sc.nextInt();
+		System.out.println("Enter capacity of knapsack");
+		int W=sc.nextInt();
+		int v[]=new int[n];
+		int w[]=new int[n];
+		System.out.println("Enter value array");
+		for(int i=0;i<n;i++)
+		{
+			v[i]=sc.nextInt();
+		}
+		System.out.println("Enter weight array");
+		for(int i=0;i<n;i++)
+		{
+			w[i]=sc.nextInt();
+		}
+		
+		KnapSack(v,w,n,W);
+		
+	}
+  
+	
+}
\ No newline at end of file
diff --git a/LCS.java b/LCS.java
new file mode 100644
index 000000000000..968d42f1136a
--- /dev/null
+++ b/LCS.java
@@ -0,0 +1,111 @@
+import java.util.*;
+
+class LCS  
+{
+	public static void main(String ar[])
+	{   
+	    Scanner sc=new Scanner(System.in);
+		System.out.println("Enter size of first sequence");
+		int n1=sc.nextInt();
+		char[] input1=new char[n1];
+		System.out.println("Enter Characters of first sequence");
+		for(int i=0;i<n1;i++)
+		{
+			input1[i]=sc.next().charAt(0);
+		}
+		System.out.println("Enter size of second sequence");
+		int n2=sc.nextInt();
+		char[] input2=new char[n2];
+		System.out.println("Enter Characters of second sequence");
+		for(int i=0;i<n2;i++)
+		{
+			input2[i]=sc.next().charAt(0);
+		}
+		char[][] b=new char[n1+1][n2+1];
+		int[][] c=new int[n1+1][n2+1];
+		for(int i=0;i<=n1;i++)
+		{
+			c[i][0]=0;
+		    b[i][0]='0';
+		}
+		for(int j=0;j<=n2;j++)
+		{
+			c[0][j]=0;
+		    b[0][j]='0';
+		}
+		for(int i=1;i<=n1;i++)
+		{
+			for(int j=1;j<=n2;j++)
+			{
+				if(input1[i-1]==input2[j-1])
+				{
+					c[i][j]=c[i-1][j-1]+1;
+					b[i][j]='\\';
+				}
+				else if(c[i-1][j]>=c[i][j-1])
+				{
+					c[i][j]=c[i-1][j];
+					b[i][j]='|';
+				}
+				else if(c[i][j-1]>=c[i-1][j])
+				{
+					c[i][j]=c[i][j-1];
+					b[i][j]='-';
+				}
+			}
+		}
+		System.out.println();
+		System.out.println("Matrix for calculating size of LCS ==> ");
+		for(int i=0;i<=n1;i++)
+		{
+			for(int j=0;j<=n2;j++)
+			{
+				System.out.print(c[i][j]+" ");
+			}
+			System.out.println();
+		}
+		System.out.println();
+		System.out.println("Path Matrix for calculating LCS ==> ");
+		for(int i=0;i<=n1;i++)
+		{
+			for(int j=0;j<=n2;j++)
+			{
+				System.out.print(b[i][j]+" ");
+			}
+			System.out.println();
+		}
+        	System.out.println();
+		System.out.print("Longest Common SubSequence is---> ");
+      new LCS().printLcs(b,input1,n1,n2);		
+	}
+	
+	public void printLcs(char[][] b,char[] input1,int i,int j)
+	{
+		if(i==0 || j==0)
+		{
+			return;
+		}
+		if(b[i][j]=='\\')
+		{
+			printLcs(b,input1,i-1,j-1);
+			System.out.print(input1[i-1]+" ");
+		}
+		else if(b[i][j]=='|')
+		{
+			printLcs(b,input1,i-1,j);
+		}
+		else 
+			printLcs(b,input1,i,j-1);
+	}
+}
+
+
+
+
+
+
+
+
+
+
+