Technical Portfolio

Impact-driven software engineering projects focused on scalability, performance, and architecture.

Smart Campus Collaboration Hub

Full Stack Developer
Jan 2024 - April 2024
  • Spearheaded the development of a centralized resource-sharing platform for a community of 2,000+ university students.
  • Engineered a real-time collaboration engine using Socket.io, decreasing study group synchronization latency by 45%.
  • Architected a robust MongoDB schema to support complex multi-entity relationships between students, courses, and resources.
  • Implemented a secure JWT-based authentication layer integrated with existing institutional identity providers.
React
Node.js
Express.js
MongoDB
Socket.io

EduDisaster – Crisis Management Platform

Lead Backend Engineer
Sept 2023 - Dec 2023
  • Designed and deployed a high-availability backend for an emergency protocol training suite serving 10+ pilot schools.
  • Developed a suite of 50+ RESTful API endpoints for interactive disaster simulation and knowledge assessment.
  • Optimized database performance by 30% through strategic indexing and aggregation pipeline refactoring.
  • Integrated Docker-based CI/CD workflows, achieving a 99.9% deployment success rate during the testing phase.
MongoDB
Express
React
Node
Docker

Community Lost and Found Portal

Frontend Engineer
May 2023 - Aug 2023
  • Built a high-performance progressive web app (PWA) for localized item tracking and recovery.
  • Leveraged Firebase Firestore for real-time data streaming, ensuring sub-200ms listing updates across clients.
  • Engineered an image processing pipeline using Cloud Functions to optimize user-uploaded media for mobile devices.
  • Achieved a perfect 100/100 Accessibility score on Google Lighthouse by implementing rigorous ARIA standards.
React
Firebase
Tailwind CSS
Framer Motion

Priority-Based System Task Scheduler

Systems Programmer
Jan 2023 - March 2023
  • Developed a low-level desktop application for optimized CPU task scheduling using custom C implementations.
  • Engineered Min-Heap and Red-Black Tree structures from scratch to maintain strict O(log n) scheduling priority.
  • Minimized memory overhead by 25% through manual heap management and pointer optimization techniques.
  • Conducted extensive benchmarking against standard Linux CFS (Completely Fair Scheduler) models.
C
Data Structures
Linux Kernel APIs
Benchmarking