# nayonika_narayanan

Hi 👋, I'm Nayonika

A Computer Science student from BITS Pilani- Hyd Campus

💻 Skills

Language/Tool	Icon
C
C++
Java
Python (Learning)
SQL (MySQL, PL/SQL)

💻 Projects

• 📚 DBMS: Pharmacy Management System
  Designed and implemented a robust backend system to manage critical healthcare data including patients, doctors, prescriptions, medicines, pharmacies, and hospital records.
  Ensured data integrity through carefully structured schemas, stored procedures, and triggers that automatically updated prescription records upon changes in doctor or pharmacy information.
  My role: Led the creation of the ER Diagram, Database Schema, and SQL table definitions.
  Demonstrated strong ownership in designing relational models and enforcing business logic.
  🔗 Project Documentation

• 🏗️ OOPS Project – Interactive 2D Floor Plan Builder (Java)
  Developed a graphical user interface (GUI) application to simulate a 2D floor plan design tool using Java Swing.
  The project allowed users to place, move, and visualize room layouts and interior elements interactively.
  My role: Contributed to the architectural design and implemented key object-oriented programming principles including encapsulation, inheritance, and polymorphism to ensure modular and scalable code.

• Quantum K-Means Clustering (Qiskit)
  Hybrid quantum-classical clustering model using distance metrics.
  Uses quantum computing (instead of classical computing using the Euclidean algorithm) for speed and efficiency, to cluster a given dataset of points to find centriods, and use them to calulate distances between the point.

  link for the presentation: https://docs.google.com/presentation/d/1iUgPT_qlJYbUyonYT5t_XpLpIolAjMOIBFQlDpfBq5o/edit?usp=sharing

  link for the code: https://colab.research.google.com/drive/1iKpgYFnXRxslO55-IqgIvd8lDtMVbiT5?usp=sharing

  Tools & Frameworks Used

• 📐 Discrete Math Project – Dependency-Based Task Scheduling (C)
  Designed and implemented a topological sorting algorithm to simulate task scheduling with dependencies, ensuring each task executes only after all its prerequisites are met.
  The program reads a directed acyclic graph (DAG) and assigns tasks to execution rounds, allowing tasks with no remaining dependencies to be processed in parallel.
  Features include dynamic memory allocation, adjacency list creation, dependency degree tracking, and round-based output of sorted tasks.
  Language used: C, with custom data structures and sorting logic to optimize scheduling performance.

  🔗 View Code on Google Drive

🤖 AI Chatbot Assistant

Designed to be an executive assistant to help with professional jargon, emails, daily/weekly planners etc.

Link to the chatbot: https://hf.co/chat/assistant/6832f0fdb3d5c4446da37875

Reviews: https://code.swecha.org/nayonika_narayanan/nayonika_narayanan/-/blob/main/reviews.md

📚 Learning

• Python
• LLM
• AI
• UI/UX

Extracurricular Activities

• Classicical Vocals (Carnatic and Robindro Sangeet)
• Run (Long distance)