maneshreyash Goto Github PK

babysittermanagement

A babysitter management system developed using JSP, Bootstrap and CSS for for front end and JAVA Spring Framework for parameter passing and Hibernate for database management using MySQL.

bfsoo

bigintpackagejava

Big Integer Package in Java for performing calculator operations in any base.

bigram-probabilities-and-transformation-based-pos-tagging-

Calculation of sentence probabilities using Bigram Probabilities, Brills Transformation rules and Naive Bayes POS Tagging.

binaryheap

A binary heap is a complete binary tree which satisfies the heap ordering property. The ordering can be one of two types: the min-heap property or the max-heap property.

binarysearchtree

Binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory. They allow fast lookup, addition and removal of items, and can be used to implement either dynamic sets of items, or lookup tables that allow finding an item by its key.

bounded-queue

A bounded queue is a queue with a limited capacity. When the bounded queue is full, no more items can be put into the queue until some items are taken out.

coding-interview-university

A complete computer science study plan to become a software engineer.

cracking-the-coding-interview_solutions

Efficient solutions to "Cracking the Coding Interview" (6th Edition) problems

dfs

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.

doodle

Meeting Scheduler web application

doublylinkedlist-java

A doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields, called two link fields, that are references to the previous and to the next node in the sequence of nodes and one data field in between the link fields. The beginning and ending nodes' previous and next links, respectively, point to some kind of terminator, typically a sentinel node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list is circularly linked via the sentinel node. Extend the SinglyLinkedList.java to a doubly linked list (DoublyLinkedList class)

earthquake_prediction

Prediction of laboratory earthquakes using lab recorded data.

interview

Interview questions

klargestusingpqorselectalgo

Comparison of finding the K largest elements using Priority Queue vs Select Algorithm

leetcode

Solutions to LeetCode problems that I have attempted.

linearregression

Implementation of Machine Learning algorithm of Linear Regression.

mergesort_improved

Improved Merge Sort by introducing Insertion Sort for array size of below a threshold value because Insertion Sort performs better for less number of elements.

multi_dimensional_search

An object 'product' has 3 attributes: id, price and a list of descriptive tags. MDS helps retrieive that product based on any of the attributes as search term. Implemented using a combination of TreeMap, HashMap and HashSet

neural_networks

Predict whether income exceeds $50K/yr based on census data using Neural Network algorithm from scratch implementation.

robinhoodhashing

The idea is that a new key may displace a key already inserted, if its probe count is larger than that of the key at the current position. The net effect of this is that it reduces worst case search times in the table. This is similar to ordered hash tables except that the criterion for bumping a key does not depend on a direct relationship between the keys. Since both the worst case and the variation in the number of probes is reduced dramatically, an interesting variation is to probe the table starting at the expected successful probe value and then expand from that position in both directions.

skiplist

A skip list is a data structure that allows fast search within an ordered sequence of elements. Fast search is made possible by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one.

stronglyconnectedcompo

twitter-sentiment-analysis-using-spark-streaming-and-kafka

Twitter Sentiment Analysis using Spark and Kafka

viterbi-algorithm

Implementation of Viterbi algorithm for computing the most liekly sequence of weather using probabilities.

word-sense-disambiguation

Implementation of WSD algorithm of Simplified Lesk. No modifications over the base algorithm.