Added solutions for program 1 and 2
Create QuickPlot.gpl

This is a gnuplot script to plot the data in QuickPlot.dat generated by QuickSort.c
to execute
$ gnuplot QuickPlot.dat
Create Dijkstra.cpp

Dijkstra.cpp
Create Prim.cpp

This program finds the minimum cost spanning tree using Prim's Algorithm
Create BFS.cpp

The program determines which nodes are reachable from a given node in the graph using Breadth First Search
Create SubSet.cpp

This program find all possible subsets of a given Set whose sum of the elements is the same as a specified number
Create Warshall.c

This program finds  Transitive Closure of a given digraph using Warshall's Algorithm
Moved the programs to directory for CCP Lab inside the sem directory
Added Syllabus for various sem
Added Syllabus for various sem
Merge branch 'addSyllabus'
Fixes #13
Readme.md updated
Doc-a-thon mentioned
Merge pull request #15 from prometheansacrifice/CorrectingReadMe

Readme.md updated
Merge pull request #7 from pcputta/patch-2

Create QuickPlot.gpl
Merge pull request #8 from pcputta/patch-3

Create Dijkstra.cpp
Merge pull request #9 from pcputta/patch-4

Create Prim.cpp
Merge pull request #10 from pcputta/patch-5

Create BFS.cpp
Merge pull request #11 from pcputta/patch-6

Create SubSet.cpp