diff --git a/README.md b/README.md
deleted file mode 100644
index 51757b0..0000000
--- a/README.md
+++ /dev/null
@@ -1,16 +0,0 @@
-# Buffer-4.0
-Buffer is a Data Structures and Algorithms Project series, in which students can participate as mentees in teams of 3-4 people. 
-This year the themes on which students can create a project are-
-
-1. Healthcare
-2. Digital Society
-3. Open Innovation
-4. Custom data structure to store data
-
-This repository is created for all the teams to be able to upload their final project source code for the same. 
-
-While submitting, note that: 
-
-Each folder should have the name of the team and inside a readme file with team member details, (name, year, branch) and their theme. The readme file should also contain the link to their presentation as well as the drive link where all the three report documents would be stored. 
-
-Happy Coding :)
diff --git a/ReadMe.md b/ReadMe.md
new file mode 100644
index 0000000..1230e1d
--- /dev/null
+++ b/ReadMe.md
@@ -0,0 +1,38 @@
+TEAM RAMP
+
+Theme:Digital Society
+
+Project Theme:Parking Management System
+
+Project Name:RAMP PARKING SOLUTIONS
+
+Team Members:
+
+Madhavi Dewalkar-SY ENTC
+
+Anushka Desai-SY ENTC
+
+Riya Barne-SY ENTC
+
+Purva Bhosale-SY ENTC
+
+
+Project Description:
+
+RAMP is one stop solution for solving all your parking needs!
+It helps you find the best possible parking spot according to type of vehicle, proximity to current loaction, government dating system(even/odd parking),etc.
+
+Project Drive link: https://drive.google.com/drive/folders/1DyMzXsDtXPRPtQ-dLy2_VAP7h9JpjBqR?usp=sharing
+(Video Explanation and Reports)
+
+Sample Website:https://madhavidewalkar.github.io/RAMP_SY/
+
+Data Structures Used:
+Hash Maps
+Graphs
+Arraylist
+Arrays
+
+
+
+
diff --git a/bufferproject-java/bin/Final/Sitch.class b/bufferproject-java/bin/Final/Sitch.class
new file mode 100644
index 0000000..81812ce
Binary files /dev/null and b/bufferproject-java/bin/Final/Sitch.class differ
diff --git a/bufferproject-java/bin/garrage/dijkstra.class b/bufferproject-java/bin/garrage/dijkstra.class
new file mode 100644
index 0000000..6d52766
Binary files /dev/null and b/bufferproject-java/bin/garrage/dijkstra.class differ
diff --git a/bufferproject-java/bin/module-info.class b/bufferproject-java/bin/module-info.class
new file mode 100644
index 0000000..643845b
Binary files /dev/null and b/bufferproject-java/bin/module-info.class differ
diff --git a/bufferproject-java/bin/weightedgraph/Maingraph.class b/bufferproject-java/bin/weightedgraph/Maingraph.class
new file mode 100644
index 0000000..de7f948
Binary files /dev/null and b/bufferproject-java/bin/weightedgraph/Maingraph.class differ
diff --git a/bufferproject-java/bin/weightedgraph/firstgraph$Edge.class b/bufferproject-java/bin/weightedgraph/firstgraph$Edge.class
new file mode 100644
index 0000000..0e8d3ad
Binary files /dev/null and b/bufferproject-java/bin/weightedgraph/firstgraph$Edge.class differ
diff --git a/bufferproject-java/bin/weightedgraph/firstgraph$Node.class b/bufferproject-java/bin/weightedgraph/firstgraph$Node.class
new file mode 100644
index 0000000..52c5624
Binary files /dev/null and b/bufferproject-java/bin/weightedgraph/firstgraph$Node.class differ
diff --git a/bufferproject-java/bin/weightedgraph/firstgraph.class b/bufferproject-java/bin/weightedgraph/firstgraph.class
new file mode 100644
index 0000000..1a98f39
Binary files /dev/null and b/bufferproject-java/bin/weightedgraph/firstgraph.class differ
diff --git a/bufferproject-java/src/Final/Sitch.class b/bufferproject-java/src/Final/Sitch.class
new file mode 100644
index 0000000..81812ce
Binary files /dev/null and b/bufferproject-java/src/Final/Sitch.class differ
diff --git a/bufferproject-java/src/Final/Sitch.java b/bufferproject-java/src/Final/Sitch.java
new file mode 100644
index 0000000..417cd9f
--- /dev/null
+++ b/bufferproject-java/src/Final/Sitch.java
@@ -0,0 +1,52 @@
+package Final;
+import java.util.*;
+import weightedgraph.*;
+
+public class Sitch {
+	
+	static String name;
+	private static Scanner sc;
+   
+	public static void main(String[] args)
+	{   
+		String str;
+		 Maingraph m=new Maingraph();
+		sc = new Scanner(System.in);
+	do
+	{   System.out.println("*************WELCOME TO RAMP PARKING SOLUTIONS***********");
+		System.out.println("\nEnter your name");
+	    name=sc.next();
+	    System.out.println("\nHello "+ name + "!");
+	    System.out.println("\nChoose your current location");
+		System.out.println("\n1.Bavdhan\n2.Kothrud\n3.Karvenagar\n4.Warje");
+		int ch=sc.nextInt();
+		
+		switch(ch)
+		{
+		case 1:   
+			System.out.println("\nYou are at Bavdhan");
+			m.NodeA();
+			break;
+			
+		case 2:
+			System.out.println("\nYou are at Kothrud");
+			m.NodeB();
+			break;
+		case 3:
+			
+			System.out.println("\nYou are at Karvenagar");
+			m.NodeC();
+			break;
+		case 4: 
+			System.out.println("\nYou are at Warje");
+			m.NodeD();
+		  break;
+		}
+		System.out.println("\nDo you want to continue using the app?(Y/N)");
+        str=sc.next();
+   }while(str.equalsIgnoreCase("Y"));
+		
+	System.out.println("THANKYOU FOR USING OUR APP!" );
+}
+	
+}
\ No newline at end of file
diff --git a/bufferproject-java/src/garrage/dijkstra.class b/bufferproject-java/src/garrage/dijkstra.class
new file mode 100644
index 0000000..6d52766
Binary files /dev/null and b/bufferproject-java/src/garrage/dijkstra.class differ
diff --git a/bufferproject-java/src/garrage/dijkstra.java b/bufferproject-java/src/garrage/dijkstra.java
new file mode 100644
index 0000000..6100ab4
--- /dev/null
+++ b/bufferproject-java/src/garrage/dijkstra.java
@@ -0,0 +1,182 @@
+package garrage;
+import java.util.*;
+
+
+import java.util.function.*;
+import java.util.stream.Collectors;
+
+import weightedgraph.Maingraph;
+import weightedgraph.firstgraph;;
+
+
+public class dijkstra   
+{  
+	Scanner sc=new Scanner(System.in);
+	 int whirl;
+	 int source;
+	 int two;
+	static final int totalVertex = 8; 
+	
+	int minimumDistance(int distance[], Boolean spSet[])  
+	{  
+		int m = Integer.MAX_VALUE, m_index = -1;  
+		  
+		for (int vx = 0; vx < totalVertex; vx++)  
+		{  
+			if (spSet[vx] == false && distance[vx] <= m)   
+			{  
+				m = distance[vx];  
+				m_index = vx;  
+			}  
+		}  
+		return m_index;	  
+	}
+	void conditions(int source,int distance[], int n, firstgraph g,String a,String b)  
+	{	
+			this.source=source; 
+			List<Integer> list=new ArrayList<Integer>();
+			for(int j=0;j<n;j++)
+			{
+				
+			if(a.equalsIgnoreCase("E"))
+			{
+				if( j%2==0 && distance[j]!=0 && g.getNodes().get(j).isAvail()==true)
+		    		
+				   {
+			    		list.add(distance[j]);			    		
+			       }
+			}
+			else
+			  {
+				
+				if(j%2!=0 && distance[j]!=0 && g.getNodes().get(j).isAvail()==true )
+			    	
+			    	   list.add(distance[j]);
+		      
+			  }
+		
+	       }
+			
+			if(b.equalsIgnoreCase("F"))
+			{
+				 Predicate<Integer> Fourwheeler = four->four%3==0;
+				 List<Integer> Streamlist=list.stream().filter(Fourwheeler).collect(Collectors.toList());
+				 spot(Streamlist, distance, g);
+				 
+			}
+			else
+		
+		spot(list, distance, g);
+
+	}
+	
+	public void dij(int s, int graph[][],firstgraph g,String a,String b)  
+	{   
+		this.source=s;
+		int distance[] = new int[totalVertex]; 
+	  
+		Boolean spSet[] = new Boolean[totalVertex];  
+		
+		for (int j = 0; j < totalVertex; j++)   
+		{  
+			distance[j] = Integer.MAX_VALUE;  
+			spSet[j] = false;  
+		}  
+		distance[s] = 0;  
+		for (int cnt = 0; cnt < totalVertex - 1; cnt++)   
+		{   
+		int ux = minimumDistance(distance, spSet);  
+		spSet[ux] = true;  		 
+		for (int vx = 0; vx < totalVertex; vx++)  	  
+			if (!spSet[vx] && graph[ux][vx] != -1 && distance[ux] != Integer.MAX_VALUE && distance[ux] + graph[ux][vx] < distance[vx])  
+			{  
+				distance[vx] = distance[ux] + graph[ux][vx]; 
+				
+			}  
+		
+		}  		
+		
+		
+		 conditions(source,distance, totalVertex,g,a,b);  //call to function conditions		
+	}  
+	
+	public void avail(int a,firstgraph g,int k)
+	{   
+		
+		if(a==1)
+		{
+	     g.getNodes().get(k).setAvail(false);
+	     displayavailability(g,k);
+		}
+	
+	}
+	
+	void displayavailability(firstgraph g,int k)
+	{
+		if(g.getNodes().get(k).isAvail()==false)
+		{
+			System.out.println("This spot is filled now");
+				
+		}		
+		
+	}
+	
+	public void spot(List<Integer> list,int distance[],firstgraph g)
+	{    
+		int ch=0,nearestSpot=99;
+		if(list.isEmpty())
+		{
+			System.out.println("Sorry!No spots are available right now");
+			
+		}
+		else
+			
+	{	
+		Collections.sort(list);
+		
+		do
+		{  
+		
+			for(int i=0;i<list.size();i++)
+			 {
+				 for(int j=0;j<distance.length;j++)
+				 {    
+					 if(list.get(i)==distance[j])
+					 {
+						 System.out.println("\nYour Nearest Parking spot is " + g.getNodes().get(j) + " At a distance of " + distance[j] + "kms");
+						 nearestSpot=j;
+						 System.out.println("\nPress 1 to confirm your parking spot\nPress 2 for other parking spot\nPress 3 to exit the app");
+						 ch=sc.nextInt();
+						 
+	                    }
+				 }
+				 
+				 if(ch==1)
+                 {
+               	  avail(ch,g,nearestSpot);
+               	 break;
+               	
+                 }
+				 
+				 else  if(ch==3)
+	         {
+	        	  exit(1);
+	         }
+			 
+			
+			 }
+				
+		}while(ch==2);
+	}
+}
+	private void exit(int i)
+	{
+
+	        if(i==1)
+		{
+			System.out.println("\nTHANKYOU FOR USING OUR APP!");
+			System.exit(i);
+		}
+	}
+}
+	
\ No newline at end of file
diff --git a/bufferproject-java/src/module-info.class b/bufferproject-java/src/module-info.class
new file mode 100644
index 0000000..643845b
Binary files /dev/null and b/bufferproject-java/src/module-info.class differ
diff --git a/bufferproject-java/src/module-info.java b/bufferproject-java/src/module-info.java
new file mode 100644
index 0000000..3ef2685
--- /dev/null
+++ b/bufferproject-java/src/module-info.java
@@ -0,0 +1,9 @@
+/**
+ * 
+ */
+/**
+ * @author anushka
+ *
+ */
+module garrage {
+}
\ No newline at end of file
diff --git a/bufferproject-java/src/weightedgraph/Maingraph.class b/bufferproject-java/src/weightedgraph/Maingraph.class
new file mode 100644
index 0000000..de7f948
Binary files /dev/null and b/bufferproject-java/src/weightedgraph/Maingraph.class differ
diff --git a/bufferproject-java/src/weightedgraph/Maingraph.java b/bufferproject-java/src/weightedgraph/Maingraph.java
new file mode 100644
index 0000000..9b6c31c
--- /dev/null
+++ b/bufferproject-java/src/weightedgraph/Maingraph.java
@@ -0,0 +1,192 @@
+package weightedgraph;
+
+import java.util.Scanner;
+import garrage.dijkstra;
+
+public class Maingraph
+{   
+	Scanner sc=new Scanner(System.in);
+public void NodeA() 
+	{
+     
+    firstgraph g=new firstgraph();
+	
+	
+	g.addNode(0,"Bavdhan");
+	g.addNode(1,"P1");
+	g.addNode(2,"P2");
+	g.addNode(3,"P3");
+	g.addNode(4,"P4");
+	g.addNode(5,"P5");
+	g.addNode(6,"P6");
+	g.addNode(7,"P7");
+	
+	g.addEdge(0, 1, 2);
+    g.addEdge(0,4, 5);
+    g.addEdge(0, 3, 3);
+    g.addEdge(1, 2, 4);
+    g.addEdge(2, 3, 6);
+    g.addEdge(3, 4, 2);
+    g.addEdge(0, 7, 1);
+    g.addEdge(4, 5, 7);
+    g.addEdge(5, 6, 3);
+    g.addEdge(6, 2, 8);
+    g.addEdge(7, 4, 6);
+    
+    int grph[][] = new int[][] { 
+	    {-1,2,-1,3,5,-1,-1,1},
+		{2,-1,4,-1,-1,-1,-1,-1},
+		{-1,4,-1,6,-1,-1,-1,-1},
+		{3,-1,6,-1,2,-1,-1,-1},
+		{5,-1,-1,2,-1,7,-1,6},
+		{-1,-1,-1,-1,7,-1,3,-1},
+		{-1,-1,8,-1,-1,3,-1,-1},
+		{1,-1,-1,-1,6,-1,-1,-1}};
+		
+		
+		
+			
+		ask(grph,g);	
+	
+		
+	
+	}
+
+public void NodeB()
+ {
+	firstgraph g=new firstgraph();
+	
+	
+	g.addNode(0,"Kothrud");
+	g.addNode(1,"P1");
+	g.addNode(2,"P2");
+	g.addNode(3,"P3");
+	g.addNode(4,"P4");
+	g.addNode(5,"P5");
+	g.addNode(6,"P6");
+	g.addNode(7,"P7");
+	
+	g.addEdge(0, 1, 2);
+    g.addEdge(0,4, 5);
+    g.addEdge(0, 3, 3);
+    g.addEdge(1, 2, 4);
+    g.addEdge(2, 3, 6);
+    g.addEdge(3, 4, 2);
+    g.addEdge(0, 7, 1);
+    g.addEdge(4, 5, 7);
+    g.addEdge(5, 6, 3);
+    g.addEdge(6, 2, 8);
+    g.addEdge(7, 4, 6);
+    
+    
+ 
+int grph[][] = new int[][] { 
+    {-1,3,-1,4,5,-1,-1,2},
+	{3,-1,2,-1,-1,-1,-1,-1},
+	{-1,2,-1,5,-1,-1,4,-1},
+	{4,-1,5,-1,6,-1,-1,-1},
+	{5,-1,-1,6,-1,4,-1,6},
+	{-1,-1,-1,-1,4,-1,3,-1},
+	{-1,-1,4,-1,-1,3,-1,-1},
+	{2,-1,-1,-1,6,-1,-1,-1}};
+  
+	ask(grph,g);
+
+ }
+ public void NodeC()
+ {
+	 firstgraph g=new firstgraph();
+		
+		g.addNode(0,"Karvenagar");
+		g.addNode(1,"P1");
+		g.addNode(2,"P2");
+		g.addNode(3,"P3");
+		g.addNode(4,"P4");
+		g.addNode(5,"P5");
+		g.addNode(6,"P6");
+		g.addNode(7,"P7");
+		
+		g.addEdge(0, 1, 2);
+	    g.addEdge(0,4, 5);
+	    g.addEdge(0, 3, 3);
+	    g.addEdge(1, 2, 4);
+	    g.addEdge(2, 3, 6);
+	    g.addEdge(3, 4, 2);
+	    g.addEdge(0, 7, 1);
+	    g.addEdge(4, 5, 7);
+	    g.addEdge(5, 6, 3);
+	    g.addEdge(6, 2, 8);
+	    g.addEdge(7, 4, 6);
+	    
+	    int grph[][] = new int[][] { 
+		    {-1,1,-1,1,3,-1,-1,7},
+			{1,-1,2,-1,-1,-1,-1,-1},
+			{-1,2,-1,5,-1,-1,3,-1},
+			{1,-1,5,-1,2,-1,-1,-1},
+			{3,-1,-1,2,-1,5,-1,6},
+			{-1,-1,-1,-1,5,-1,4,-1},
+			{-1,-1,3,-1,-1,4,-1,-1},
+			{7,-1,-1,-1,6,-1,-1,-1}};
+	    
+			ask(grph,g);
+	 
+	 
+ }
+ 
+ public void NodeD()
+ { 
+	 firstgraph g=new firstgraph();
+			
+		g.addNode(0,"Warje");
+		g.addNode(1,"P1");
+		g.addNode(2,"P2");
+		g.addNode(3,"P3");
+		g.addNode(4,"P4");
+		g.addNode(5,"P5");
+		g.addNode(6,"P6");
+		g.addNode(7,"P7");
+		
+		g.addEdge(0, 1, 2);
+	    g.addEdge(0,4, 5);
+	    g.addEdge(0, 3, 3);
+	    g.addEdge(1, 2, 4);
+	    g.addEdge(2, 3, 6);
+	    g.addEdge(3, 4, 2);
+	    g.addEdge(0, 7, 1);
+	    g.addEdge(4, 5, 7);
+	    g.addEdge(5, 6, 3);
+	    g.addEdge(6, 2, 8);
+	    g.addEdge(7, 4, 6);
+	    
+	   
+	    
+	    int grph[][] = new int[][] { 
+		    {-1,3,-1,2,-1,-1,-1,4},
+			{3,-1,1,-1,-1,-1,-1,-1},
+			{-1,1,-1,5,-1,-1,6,-1},
+			{2,-1,5,-1,-1,-1,4,3},
+			{-1,-1,-1,-1,-1,1,-1,2},
+			{-1,-1,-1,-1,1,-1,2,-1},
+			{-1,-1,6,4,-1,2,-1,-1},
+			{4,-1,-1,3,2,-1,-1,-1}};
+	    
+	    
+	 
+			ask(grph,g);
+	 
+	 
+ }
+ 
+ public void ask(int grph[][],firstgraph g)
+ {  
+	 System.out.println("\nWhat is today's date?\nPress E for Even and O for Odd(E/O):");
+	 String a=sc.next();
+	 System.out.println("\nWhat type is your vehicle?\nPress T for two-wheeler and F for four-wheeler(T/F) ");
+	 String b=sc.next();
+     dijkstra obj=new dijkstra();  
+     obj.dij( 0,grph,g,a,b); 
+    
+ }
+
+}
+
diff --git a/bufferproject-java/src/weightedgraph/firstgraph$Edge.class b/bufferproject-java/src/weightedgraph/firstgraph$Edge.class
new file mode 100644
index 0000000..0e8d3ad
Binary files /dev/null and b/bufferproject-java/src/weightedgraph/firstgraph$Edge.class differ
diff --git a/bufferproject-java/src/weightedgraph/firstgraph$Node.class b/bufferproject-java/src/weightedgraph/firstgraph$Node.class
new file mode 100644
index 0000000..52c5624
Binary files /dev/null and b/bufferproject-java/src/weightedgraph/firstgraph$Node.class differ
diff --git a/bufferproject-java/src/weightedgraph/firstgraph.class b/bufferproject-java/src/weightedgraph/firstgraph.class
new file mode 100644
index 0000000..1a98f39
Binary files /dev/null and b/bufferproject-java/src/weightedgraph/firstgraph.class differ
diff --git a/bufferproject-java/src/weightedgraph/firstgraph.java b/bufferproject-java/src/weightedgraph/firstgraph.java
new file mode 100644
index 0000000..7b49dcb
--- /dev/null
+++ b/bufferproject-java/src/weightedgraph/firstgraph.java
@@ -0,0 +1,88 @@
+package weightedgraph;
+import java.util.*;
+
+
+
+public class firstgraph {
+      
+	private Map<Integer,Node> nodes = new HashMap<>();
+	public class Node
+	{
+		 private String label;
+		 boolean avail=true; 
+
+	        public boolean isAvail() {
+			return avail;
+		}
+
+		public void setAvail(boolean avail) {
+			this.avail = avail;
+		}
+
+			public Node(String label) {
+	            this.label = label;
+	        }
+
+	        @Override
+	        public String toString() {
+	            return label;
+	        }
+
+	}
+	
+	
+	public Map<Integer, Node> getNodes() {
+		return nodes;
+	}
+
+	public void setNodes(Map<Integer, Node> nodes) {
+		this.nodes = nodes;
+	}
+
+
+	public class Edge
+	{
+		private Node from;
+        private Node to;
+        private int weight;
+
+        public Edge(Node from, Node to, int weight) {
+            this.from = from;
+            this.to = to;
+            this.weight = weight;
+        }
+        
+        public int getWeight() {
+        	return weight;
+        }
+
+        public Node getTo() {
+			return to;
+		}
+
+		public void setTo(Node to) {
+			this.to = to;
+		}
+
+    }
+
+    public void addNode(Integer index,String label) {
+        var node = new Node(label);
+
+        nodes.putIfAbsent(index,node);
+        //adjacencylist.putIfAbsent(node,new ArrayList<>());
+    }
+
+    public void addEdge(Integer from, Integer to, int weight) {
+        var fromNode = nodes.get(from);
+        if (fromNode == null) throw new IllegalArgumentException();
+
+        var toNode = nodes.get(to);
+        if (toNode == null) throw new IllegalArgumentException();
+
+    }
+      
+
+
+}
+