Prateek Srivastava's Projects
Implementation of the game 15-Puzzle solver which finds the shortest possible sequence of moves that restores the canonical configuration given an initial board configuration provided in a text file called "input.txt" by the user.
Blink Led on Virtex Ultrascale+ board - VCU118
blinking led and simple pulse wave modulation on Pynq-Z1 board
Chess playing engine using heuristic based minimax with alpha-beta pruning
Configuration of my Doom-Emacs
Spam Classifier using Naive Bayes and Decision Tree method
Implementation of Pulse Wave Modulation in verilog on Pynq-Z1 board (Zynq 7020 chip)
A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm
Graph500 reference implementations
Implementation of "Basic Local Alignment Search Tool" in Hadoop for DNA analysis
Implementation of word count algorithm using HBase
Implementation of K-nearest neighbors, adaptive boosting, and neural networks to detect the orientation of an image
Implementation of basic statistics such as min, max, average, and standard deviation of a given data set using MapReduce paradigm
Implementation of web page ranking algorithm using the MapReduce paradigm
Implementing MapReduce's word count algorithm
Implementation of mountain ridge detector using monte-carlo markov chain
Game of N-K-Coh-Coh (Inverse Tic-tac-toe)
N-queens is a typical search problem in Artificial Intelligence. In a chess board of NxN dimension, it is an algorithm to place N number of queens such that no queen can attack each other
A parallel variant of a graph algorithm (dijkstra’s algorithm) using OpenMP on a Cray machine (XE6/XK7) and performed the benchmarking for single node up to 32 processing units
Two implementations of part-of-speech tagger. Long implementation uses Viterbi algorithm and the short uses NLTK's HMM function
Implementation of forward-backward algorithm for part-of-speech tagging
Part-of-Speech tagger using word count, naive bayes and hmm approach
Conducted a comparative analysis on scaling results for graph algorithms like single source shortest path (SSSP) algorithm using multiple runtime systems thereby reducing time to solution for graph processing with message driven runtime systems (like Charm++, HPX5), parallel boost graph library, or Graph500
Implementation of opinion mining on Kaggle IMDB dataset and Stanford Large Movie Review Dataset
Implementation of a simplified GPS system using search algorithm
Game of Tetris
Every book has conversations and this piece of code finds the total conversations that happened in a text
A genre detection tool for classifying books according to their genres such as science fiction, science, history, math etc.
Implementation of Naive Bayes' classifier to classify topics from text