Monday, February 13, 2017

GitHub Narrative

GitHub Link: https://github.com/rajivking6

Repositories:

  1. Repos

  • Repos contains all the code for the Coursera courses Algorithms Part 1 and Part 2 by Princeton(coded in java)
  • follow the path Repos to percolation to src
  • inside src folder is all the code for Algorithms Part 1 and Part 2

       2. MachineLearning

  • MachineLearning contains all the code for the Coursera course Machine Learning by Stanford (coded in Matlab)
  • under Machine Learning all the code for the course is subdivided based on different unit; the code is inside folders under the naming convention of machine-learning-ex1,2,3....
  • inside each of those folders is the code specific to each unit (1 corresponds to unit 1, and 2 to unit 2, and so on) 
       3. FTC app
  • app for FTC robotics, contains the necessary code needed to run robot
  • code to run robot is under TeamCode/src/main/java/org/firstinspires/ftc/teamcode/
       4. Python-Projects
  • many side projects but mainly contains research work done at GMU (George Mason University)
  • inside gmuwork folder is all the code with smaller folders organizing it more
       5. DataStructuresAndAlgorithmsjava
  • My personal collection of data structures and algorithms that I implement in java. Some of these structures are made because I could not find the needed structure in the standard java libraries, and some are created simply for the purpose of learning. 


Specific Project Notes:

      -Hamiltonian Path project is under Repos to percolation to src in file called HamiltonCircuit.java
      Additional Non-Github Projects
            -weather app written in 2012/2013: http://www.sarvepalli.net/weather/
                   -data was collected from backyard through simple measurement tools



Friday, February 10, 2017

Graph Theory: Hamiltonian's Path


Finding a Path in a Graph

An efficient solution to Hamiltonian's Path has eluded computer scientists for many years. Well first, what is Hamiltonian's Path? It is a path in an undirected or directed graph that visits each vertex exactly once (https://en.wikipedia.org/wiki/Hamiltonian_path).