Hi, I'm Prakruthi Koteshwar

CLI tool that prevents documentation drift by synchronizing source code and method documentation using AST parsing and Llama-3.3-70B. Processes 100+ functions in parallel using concurrent execution, reducing manual documentation effort by ~70%.

Built a deep learning system to recognize handwritten digits (0 - 9) from uploaded images. Implemented and compared MLP and CNN architectures, demonstrating CNN’s superior performance for image data. The system includes image preprocessing with OpenCV and a FastAPI-based REST API for real-time predictions.

A specialized financial LLM fine-tuned using LoRA (Low-Rank Adaptation) to map 10-K risk factors with high precision. By freezing the base model and training rank-decomposition matrices, I achieved state-of-the-art FinQA accuracy while reducing trainable parameters by over 90%.

In Progress

In Progress

Designed and developed a web-based system for a multi-location medical clinic that enables patients to book appointments with doctors based on specialty and facility availability. The platform supports dynamic doctor scheduling, facility capacity management, secure patient/doctor accounts with 2FA, and an admin dashboard for managing clinics, doctors, and website content.

Built a distributed task scheduler in Go with a gRPC-based communication layer between a centralized Master node and multiple Worker nodes. Implemented a priority-aware scheduling engine using a bin-packing strategy to efficiently allocate resources across the cluster and maximize utilization. Added constraint-based scheduling (Node Affinity) to intelligently match tasks with appropriate hardware profiles. The system is designed for scalability and resilience, with ongoing enhancements including fault recovery, resource quotas, and real-time cluster telemetry.

Developed full-stack blogging platform with markdown editor, user authentication, and SEO optimization. Implements lazy loading for performance.

Implemented recursive algorithm to solve Tower of Hanoi puzzle. Visualizes move sequences and calculates optimal solution count (2^n - 1).

Created interactive simulation of Dijkstra's algorithm for finding shortest paths in weighted graphs. Includes step-by-step visualization and performance metrics.

Passwords are stored and organized using a tree structure that enables efficient searching, insertion, and categorization of credentials by platform or service.