Skip to content
View DEMiHAT's full-sized avatar

Block or report DEMiHAT

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
DEMiHAT/README.md

⚡ Sanjeev Sriram

Systems Architect | Full-Stack Engineer | Algorithmic Optimization

Typing SVG

🚀 Flagship Engineering (Production & Architecture)

These projects represent end-to-end system design, from memory management to cloud deployment.

Project Architecture & Tech Stack Engineering Impact
Thirty
Distributed Geospatial Framework
Flutter Firebase CMake Engineered a location-bound attendance protocol using dynamic QR tokenization and geofencing. Implemented cryptographic verification for immutable audit logs.
C V-Table Demo
Polymorphic Runtime Engine
C Memory Low Level A manual implementation of C++ Virtual Tables in pure C. Demonstrates deep understanding of ABI layout, function pointers, and dynamic dispatch mechanisms at the compiler level.
IMS
Enterprise Resource Planning
Python Flask MySQL Full-stack Insurance Management System. Features rigorous ACID compliance, Role-Based Access Control (RBAC), and optimized CRUD operations for high-volume transaction handling.

🧠 Computational Logic & Optimization (DSA)

A structured approach to solving NP-Hard problems and optimizing Space-Time complexity.

Repository Focus Area Key Concepts Applied
leetcode-patterns Algorithm Design 150+ Solutions focusing on Sliding Window, DP, and Graph Topology. Includes $T(n)$ analysis and memory optimization notes.
data-structures-fundamentals ADT Implementation Raw C implementations of Hash Tables, Binary Trees, and Graphs. Includes Dijkstra's Algorithm and Stack-based expression parsing.
searching-sorting Performance Tuning Comparative analysis of $O(N^2)$ vs $O(N \log N)$ sorting algorithms (Quick/Merge) and Binary Search space reduction techniques.

🌐 Web Protocols & Data Persistence

Foundational work in backend logic, database normalization, and client-side scripting.

  • mysql-basics: Comprehensive documentation of Relational Modeling, Schema Normalization (1NF-3NF), and complex JOIN/Constraint logic.
  • php-basics: Server-side logic implementation covering Session Management, Form Processing, and mathematical computation scripts.
  • javascript-basics: Client-side DOM manipulation, Event Bubbling/Capturing, and asynchronous input handling.

Popular repositories Loading

  1. IMS IMS Public

    A full-stack Insurance Management System using Python, Flask, and MySQL. This web application provides a complete interface for administrators and agents to perform CRUD operations on customers, po…

    Python 1

  2. leetcode-patterns leetcode-patterns Public

    A systematic repository of algorithmic design patterns and computational logic. Focuses on memory optimization, rigorous Big-O analysis, and reusable frameworks for high-performance software engine…

    Python 1

  3. utility_v1 utility_v1 Public

    A C utility library providing a comprehensive toolkit for array manipulation and analysis. Includes routines for sorting (bubble_sort), searching (linear, first/last occurrence), in-place modificat…

    C

  4. javascript-basics javascript-basics Public

    This project is a collection of beginner-friendly JavaScript programs demonstrating core concepts like DOM manipulation, event handling, user input, and form validation. It includes examples such a…

    HTML

  5. php-basics php-basics Public

    A collection of PHP scripts demonstrating core backend fundamentals. Covers server-side logic (factorial, prime, fibonacci), form data processing ($_POST/$_GET), session-based user login, and input…

    PHP

  6. data-structures-fundamentals data-structures-fundamentals Public

    C implementations of core data structures (ADTs, trees, hash tables) and algorithms, including graph traversal (Dijkstra's) and expression evaluation (infix-to-postfix)

    C