SANJANA T G
sanjanatg
IDK
Languages
Top Repositories
This repository is a collection of Pygame projects that showcase a variety of games and simulations. Each folder contains the game code and a README file with detailed instructions. The projects include Bouncing Balls, Brick Breaker, Dot Chase, Maths Quiz Game, Maze, Random Walk Simulation, Reaction Time Tester, and Snake Game. 👾👾👾
Legal Document Summarizer - AI-powered tool for Indian legal documents using Gemini 2.0 API. Features: dark UI, multi-model selection, OCR for scanned docs, legal validation, and chatbot for follow-up queries.
Road anomoly
A prototype for a solar-powered mobile charging station controlled via a web interface and ESP32 microcontroller, featuring UPI payment integration.
Adding 'n' polynomials with the data structure ,singly linked list.
Repositories
18Legal Document Summarizer - AI-powered tool for Indian legal documents using Gemini 2.0 API. Features: dark UI, multi-model selection, OCR for scanned docs, legal validation, and chatbot for follow-up queries.
No description provided.
Road anomoly
This repository is a collection of Pygame projects that showcase a variety of games and simulations. Each folder contains the game code and a README file with detailed instructions. The projects include Bouncing Balls, Brick Breaker, Dot Chase, Maths Quiz Game, Maze, Random Walk Simulation, Reaction Time Tester, and Snake Game. 👾👾👾
Relational Database Design on Library management system
A prototype for a solar-powered mobile charging station controlled via a web interface and ESP32 microcontroller, featuring UPI payment integration.
My personal repository
A cheat sheet for Git commands
Machine Learning Foundations: Linear Algebra, Calculus, Statistics & Computer Science
No description provided.
AI-powered text analysis API using Google's Gemini
A complete Java implementation of lab exercises from the Design and Analysis of Algorithms (DAA) course (Course Code: 23CS253), aligned with the VTU syllabus. Covers brute-force, divide and conquer, greedy, dynamic programming, and backtracking strategies—complete with problem statements, code, and performance analysis plots.
No description provided.
No description provided.
Adding 'n' polynomials with the data structure ,singly linked list.
Dynamically allocates memory for an array of polynomials using calloc(). Allows the user to input the number of polynomials to be added. Reads the coefficients of each polynomial from the user. Adds the polynomials together and stores the result in a new polynomial. Prints the resulting polynomial.
The C code implements a stack using a linked list. It allows users to push, pop, and display elements in the stack. Error handling for overflow and underflow is included.
The C code implements a queue data structure using a singly linked list. It allows users to enqueue elements to the rear of the queue, dequeue elements from the front, and display the queue. Error handling for queue overflow and underflow is included