Discover @rahul1947 Open Source projects

Rahul Nalawade (@rahul1947)

rahul1947

Stars
96
Global Rank 214,022 (Top 8 %)
Followers 32
Following 30
Registered almost 10 years ago
Most used languages

Java
82.6 %

JavaScript
4.3 %

Python
4.3 %

HTML
4.3 %

Prolog
4.3 %
Location 🇺🇸 United States
Country Total Rank 47,030
Country Ranking

Prolog
100

Java
3,610

Database-Design-Pharmacy-Management-System

Designed and Developed a comprehensive Database Management System for a modern Pharmacy.

SP07-Comparison-of-Hashing-Implementations

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.

Implementation-of-Data-Structures-and-Algorithms

Implementation of data structures (Lists, Stacks, Queues, Trees, Balanced Search Trees, Hashing, Graphs); Implementation of algorithms (Sorting and searching, Recursion, Graph algorithms).

LP1-Integer-Arithmetic-with-Arbitrarily-Large-Numbers

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.

Logic-Programming

Logic Programming using Prolog.

LP4-PERT-Enumeration-of-Topological-Orders

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 connected Graph. Evaluates Critical Path using PERT Algorithm.

Orthodontist-Expert-System

Programmed an expert system for aligning the crooked teeth generating optimal sequence of required fix using Constraint Logic Programming over Finite Domains (CLPFD).

SP03-Priority-Queue

Implementation of Priority Queue as Binary Heap, with applications of Linked Lists and Bounded Queue and Shunting Yard Algorithm.

SP01-Linked-Lists

Doubly Linked List Implementation using Singly Linked List with best Object Oriented practices.

SP08-Depth-First-Search

Implementation of Depth First Search algorithm for a Directed Acyclic Graph, Connected Components and Topological Orderings using rbk/Graph.java.

LP2-Skip-List-Implementation

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 search trees like AVL, Red-Black, and B-Trees.

LP3-Multidimensional-Search-MDS-Implementation

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 HashSet to achieve insertion, deletion, search, modification efficiently.

JavaScript-Programming

Collection of my JavaScript Projects

LP5-Minimum-Spanning-Tree-Algorithms

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.

Javascript

SP04-Binary-Search-Tree

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.

SP02-Lists-Stacks-and-Queue

SP09-Divide-and-Conquer

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 their comparison.

SP06-Applications-of-Hashing

3 Problems from SP04 to be solved using HashMap/ HashSet instead of TreeMap/ TreeSet.

SP10-DFS-and-Divide-and-Conquer

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 their comparison. Implementation of Dual-Pivot Quick Sort Algorithm.

SP12-Breadth-First-Search-and-Enumeration

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, and Enumeration of all permutation with alternate parities.

SP11-K-Largest-Elements-and-Enumeration

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 algorithms - permutations(), combinations(), heap(), and Knuth's Algorithm L.

rbk

Code for using Graph Algorithms by Prof. Balaji Raghavachari https://www.utdallas.edu/~rbk/

Intelligent-Game-Play-for-Pylos

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.

Tesla-Light-Show

Collection of my custom light shows.

SP13-String-Algorithms

Implementation of String Algorithms

SP05-Balanced-Binary-Search-Trees

Implementation of Balanced Binary Search Trees - AVLTree, RedBlackTree, SplayTree.