Projects - Velagala Deeraj Sathvik Reddy

Handwritten Digit Classification using Neural Networks

Implemented and trained both Convolutional Neural Network (CNN) and Artificial Neural Network (ANN) on the MNIST dataset. Achieved a test accuracy of 98.64% for CNN and 97.82% for ANN.

Technologies: Python, TensorFlow, Keras

Algorithmic Profiling

Implemented and optimized data structures like stacks, queues, dictionaries, and red-black trees. Developed algorithms for insertion, deletion, and traversal to ensure data integrity and fast access.

Technologies: C++

Galton Board: Simulating Normal Distributions

Developed a Python-based simulation of ball movements in a Galton Board. Illustrated binomial-to-normal distribution convergence using histograms and advanced probabilistic models.

Technologies: Python, NumPy, Matplotlib

MIPS and Verilog

Designed a 4-state counter using an FSM in Verilog. Implemented binary search recursively in MIPS assembly language with a stack frame.

Technologies: Verilog, MIPS

Gaussian Distribution Visualizer

Created a Python tool to simulate and visualize Gaussian distributions using NumPy, SciPy, and Matplotlib. Developed overlapping histograms to better illustrate statistical concepts.

Technologies: Python, NumPy, SciPy, Matplotlib

Optimized Employee Ordering with Binary Search Tree Validation

Developed a system to order employees based on department and ID using a Binary Search Tree (BST). Implemented custom comparison operators and ensured tree integrity with validation algorithms.

Technologies: C++

Entrepreneurship Team Project (PhonePe Presentation)

Collaborated in a team to create a video presentation about PhonePe. Researched its history and differentiated it from other payment systems. Led discussions and coordinated team efforts.

Technologies: Presentation, Research

CP Boot Camp

Specialized in Dynamic Programming and Two-pointer methods. Developed problem-solving skills and implemented efficient algorithms.

Technologies: C++, Python

Summer of Science: Algorithm Studies

Studied Greedy algorithms, recursion-based problems, and binary search during a summer project. Gained hands-on experience with algorithm design and problem-solving.