Shubham617/lkm
Linux Kernel Module
Repositories
Shubham617/gridWorld
Used various reinforcement learning techniques to determine the optimal policy for travelling throughout the Grid World
Shubham617/data-analysis
Implemented various ML models from scratch in Python (absolute zero use of sklearn)
Shubham617/Text-Suggestions-Auto-Complete
Used Markov Chain Building algorithms to make predictive textual suggestions
Shubham617/LRU_Cache
Implemented the popular LRU (Least Recently Used) caching mechanism
Shubham617/Huffman_Encoding
Implemented the popular lossless data compression algorithm for text files
Shubham617/Tweet_Analytics
Used functional programming to perform statistical analyses of tweets from popular individuals
Shubham617/MapReduce-Project
A thorough analysis of an inspection result of over 448,000 restaurants in New York City. Used MapReduce
Shubham617/San-Francisco-Salaries
Used Apache Pig to analyze and draw conclusions about the salaries and professions of employees in San Francisco
Shubham617/NBA-shot-logs
Used Apache Hive to thoroughly analyze shot log data for the entire 14 -15 NBA Season (908 games)
Shubham617/Maze-Search
This project involves using Depth-First and Breadth-First search to find a path to a goal in a given maze. I worked on this project in my CMPSCI 187 class at UMass
Shubham617/Postfix-Evaluator
An evaluator for postfix expressions that I worked on in my CMPSCI 187 class at UMass
Shubham617/Towers-of-Hanoi
An interesting game that involves getting rings from a starting peg to a destination peg, whilst abiding to a ring size rule. I worked on this project in my CMPSCI 187 class at UMass
Shubham617/Hangman
The traditional letter-guessing game. I worked on this project in my CMPSCI 187 class at UMass.
Shubham617/Scapegoat-Trees
This project is my implementation of a Scapegoat Tree, which is one of the many types of self-balancing binary search trees. I worked on this project in my CMPSCI 187 class at UMass.
Shubham617/MazeGame
The objective of the game is to reach the finish point of the maze with the least path sum possible. Used Java