-
New-Carrom-Rules Public
Place to track the progress of incorporating any changes to existing Carrom rules from 1994.
UpdatedNov 27, 2022 -
-
Array-based implementation of Calculator of very large integers with the length of the numbers as large as 2,147,483,647 (2^31 - 1), with Postfix and Infix evaluation of Arithmetic Expressions.
-
SP09-Divide-and-Conquer Public
Implementation of divide and conquer algorithm to sort an array of integers - Merge Sort (take1, take2, take3), and O(n) vs O(log n) algorithms for Fibonacci Term using BigInteger Java library, and…
-
-
Implementation of data structures (Lists, Stacks, Queues, Trees, Balanced Search Trees, Hashing, Graphs); Implementation of algorithms (Sorting and searching, Recursion, Graph algorithms).
-
SP13-String-Algorithms Public
Implementation of String Algorithms
-
Orthodontist-Expert-System Public
Programmed an expert system for aligning the crooked teeth generating optimal sequence of required fix using Constraint Logic Programming over Finite Domains (CLPFD).
-
Built a maximizing agent using Support Vector Regression with Gaussian kernel model using datapoints in the form of all possible moves generated using Prolog, in Depth First Search manner.
1 UpdatedFeb 4, 2019 -
Enumeration of all Permutations (Recursion, Single Swap, and in Lexicographic Order), and Combinations. Enumeration of all Topological Orderings on a Directed Graph. Enumeration of all Paths in a c…
-
Implementation of MDS for a website seller (like Amazon), having thousands of Products (each with its own ID, Price, Description). Organizing data into a TreeMap (Red-Black Tree), used HashMap, and…
-
-
Designed and Developed a comprehensive Database Management System for a modern Pharmacy.
-
SP08-Depth-First-Search Public
Implementation of Depth First Search algorithm for a Directed Acyclic Graph, Connected Components and Topological Orderings using rbk/Graph.java.
-
Implementation of MST Algorithms - 1. Prim's Algorithm (with 3 versions - PriorityQueue<Edge>, PriorityQueue<Vertex>, and IndexedBinaryHeap<Vertices>) and 2. Kruskal's Algorithm on Connected Graphs.
-
Implementation of Balanced Binary Search Trees - AVLTree, RedBlackTree, SplayTree.
-
SP04-Binary-Search-Tree Public
Implementation of Binary Search Tree, with Bounded-size Stack, BST Map (like a TreeMap) on top of BST class, and solution to the 3 problems using TreeMap/ TreeSet.
-
LP2-Skip-List-Implementation Public
Skip Lists: A generalization of sorted linked lists for implementing Dictionary ADT (insert, delete, find, min, floor, ceiling) in O(log n) expected time per operation. And competing with balanced …
-
SP06-Applications-of-Hashing Public
3 Problems from SP04 to be solved using HashMap/ HashSet instead of TreeMap/ TreeSet.
-
Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.
-
Logic-Programming Public
Logic Programming using Prolog.
-
ML-A01-Decision-Trees Public
Implementation of Decision Tree using two heuristics for Assignment 01 of the course CS6375: Machine Learning.
Java MIT License UpdatedJan 15, 2019 -
Implementation of Naive Bayes and Logistic Regression Algorithms for Assignment 02 in the course CS6375: Machine Learning.
java machine-learning naive-bayes naive-bayes-classifier logistic-regression naive-bayes-algorithm naive-bayes-classificationJava MIT License UpdatedJan 15, 2019 -
Implementation of K-Means Clustering Algorithm for Assignment 03 of the course CS6375: Machine Learning.
java machine-learning machine-learning-algorithms k-means k-means-clustering k-means-clustering-javaJava MIT License UpdatedJan 15, 2019 -
CS301 Software Engineering Project: An online system to handle the payroll and HR management activities of the IIIT Vadodara
MIT License UpdatedJan 12, 2019 -
JavaScript-Programming Public
Collection of my JavaScript Projects
-
Implementation of DFS - strongly connected components on a Directed Graph, using same Object Oriented approach from SP08. Implementation of two versions of partition algorithms of Quick Sort and th…
-
Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, an…
-
Implementation of O(n) Select Algorithm to find K largest elements and compare it's performance with an Algorithm to find K largest elements using Priority Queue. Implementation of Enumeration algo…
-
SP03-Priority-Queue Public
Implementation of Priority Queue as Binary Heap, with applications of Linked Lists and Bounded Queue and Shunting Yard Algorithm.
{{ message }}