Computer Science & Algorithms Collection
Overview & Objective
A comprehensive collection of Computer Science implementations showcasing fundamental and advanced software engineering paradigms: full-stack Library Management System with Django and SQLite, real-time Lotka-Volterra Predator-Prey visual simulation with Pygame, intelligent constraint-satisfaction Sudoku solver using recursive backtracking, and exhaustive modules covering Recursion, Trees & BSTs, Graph Theory (BFS/DFS, Dijkstra), Divide & Conquer, Cryptography, and Turing computability.
Key Engineering Highlights
Predator-Prey Simulation (Lotka-Volterra)
Real-time biological ecosystem modeling with sprite graphics and population oscillation dynamics.
Intelligent Backtracking Sudoku Solver
Constraint satisfaction recursive solver exploring candidate matrices with pruning.
Full-Stack Library Management (Django)
Complete web application managing loans, book cataloging, authentication, and relational SQLite storage.
Core Algorithmic Foundations
Comprehensive implementations of Graph traversal (BFS/DFS), Binary Search Trees, Cryptographic hashing, and Turing Machines.