Rohan-dev-C
Freshman at Cornell University College of Engineering. Lots of experience with C#, C++ and Python.
Los Angeles, CA
Pinned Repositories
8Puzzle-AI-Solver
WIP
ASM-Disassembler
Assembler
This C# Assembler is a powerful tool designed to effortlessly convert byte code into assembly language (ASM).
AStarVisualizer
The A* Visualizer showcases the A* path finding algorithm in finding the shortest path between two points. This interactive tool allows users to witness the algorithm in action, visually demonstrating its optimal route-finding capabilities
B-Tree
This B-Tree implementation offers efficient insertion, deletion, and search operations on large datasets. Perfect for handling sorted data, it provides fast and balanced tree-based storage, making it an essential for dealing with vast amounts of structured information.
BellmanFord
Implementation of Bellman-Ford cycle detection in a weighted graph
ComputerVisionCalculator
CustomJVM
This custom Java Virtual Machine (JVM) in C# is a high-performance implementation, enabling execution of Java bytecode on the C# platform. It has a flexible environment for running Java applications, this JVM bridges the gap between Java and C# ecosystems, providing a tool for cross-language development and compatibility testing.
NystagmuSense
Mobile Phone-based Contrast Sensitivity Function exam that measures the user's ability to resolve fine details based on the contrast.
Rohan-dev-C
Config files for my GitHub profile.
Rohan-dev-C's Repositories
Rohan-dev-C/ASM-Disassembler
Rohan-dev-C/8Puzzle-AI-Solver
WIP
Rohan-dev-C/AStarVisualizer
The A* Visualizer showcases the A* path finding algorithm in finding the shortest path between two points. This interactive tool allows users to witness the algorithm in action, visually demonstrating its optimal route-finding capabilities
Rohan-dev-C/B-Tree
This B-Tree implementation offers efficient insertion, deletion, and search operations on large datasets. Perfect for handling sorted data, it provides fast and balanced tree-based storage, making it an essential for dealing with vast amounts of structured information.
Rohan-dev-C/NystagmuSense
Mobile Phone-based Contrast Sensitivity Function exam that measures the user's ability to resolve fine details based on the contrast.
Rohan-dev-C/Rohan-dev-C
Config files for my GitHub profile.
Rohan-dev-C/Assembler
This C# Assembler is a powerful tool designed to effortlessly convert byte code into assembly language (ASM).
Rohan-dev-C/BellmanFord
Implementation of Bellman-Ford cycle detection in a weighted graph
Rohan-dev-C/BloomFilter
This Bloom Filter implementation offers probabilistic data structure for fast set membership testing. Efficiently handling large datasets with minimal space, it ensures quick and accurate element existence checks, limits memory usage and retains speed.
Rohan-dev-C/ComputerVisionCalculator
Rohan-dev-C/CustomJVM
This custom Java Virtual Machine (JVM) in C# is a high-performance implementation, enabling execution of Java bytecode on the C# platform. It has a flexible environment for running Java applications, this JVM bridges the gap between Java and C# ecosystems, providing a tool for cross-language development and compatibility testing.
Rohan-dev-C/HashMap
This hash map implementation provides fast and constant-time average lookup, insertion, and deletion operations. Ideal for managing key-value pairs, it offers efficient data retrieval and storage, ensuring seamless handling of dynamic datasets in various applications.
Rohan-dev-C/HuffmanCoding
This Huffman Coding implementation provides compression and decompression capabilities for various data types. Its encoding algorithm enables space-saving storage and swift data transmission, sees use in effective data compression solutions.
Rohan-dev-C/LRUCache
Custom cache object that clears the least-recently-used items.
Rohan-dev-C/Union-Find
Rohan-dev-C/BinaryHeap
This binary heap implementation is a complete binary tree with efficient insertion and extraction of the minimum element. It's ideal for priority queue implementations, ensuring fast access to the smallest element in constant time.
Rohan-dev-C/Advanced-Problem-1
Rohan-dev-C/BinarySearchTree
Full BST
Rohan-dev-C/brickbreaker
Rohan-dev-C/DataStructures_SimpleSorts
Bubble Sort, Insertion Sort, Selection Sort, Sort Visualizer
Rohan-dev-C/HundredsMonogame
yes
Rohan-dev-C/LinkedListDataStructures
Rohan-dev-C/obstaclecourse
Rohan-dev-C/RedBlackTree
This is a left Leaning RedBlackTree
Rohan-dev-C/SkipList
This implementation of skip list offers efficient search, insertion, and deletion operations in sorted collections. Its balanced design enables logarithmic time complexity.
Rohan-dev-C/snake
Snake Game Using Monogame
Rohan-dev-C/Stacks