dynamic-memory

Evolving, Collaborative, Local AI Partners Framework

Adaptive memory for agents: durable local-first state, scoped recall, reinforcement, forgetting, consolidation, and reproducible benchmarks.

A community-driven educational platform and documentation repository for the C++ Basic Programming course, combining conceptual overviews, hands-on workshops, weekly assignments, and project-based learning.

A modular Connect Four game in C with a console-based TUI. Features Human vs Human, Human vs File (Automated Testing), Look-ahead AI, and a Game Replay system. Developed as an Advanced Programming final project.

A C-based student management system that allows adding, modifying, deleting, searching, and listing students. The system also manages grades for multiple subjects, calculates averages, and supports saving and loading data using text and binary files.

⚖️Agentic Context Engineering (https://arxiv.org/abs/2510.04618) implementation using Agent Framework

Efficient line-by-line file reader in C using static buffers and dynamic memory management, developed for the 42 get_next_line project.

ReMind — Teaching Video Generators to Remember: Eliciting Dynamic Memory for Out-of-Sight State Evolution.

A comprehensive C programming repository covering basics to advanced topics including pointers, dynamic memory allocation, file handling, and interactive console applications.

👉 A C++ project focused on pointers, dynamic memory allocation, heap management, and multi-file architecture.

Simple std::vector<int> implementation in C++

CPS125 - This course is for Engineering Students and introduces concepts, theory and practice of computer programming, using the C programming Language. This course is taken at TMU, formally known as Ryerson.

A C99 implementation of Ultimate Tic-Tac-Toe featuring dynamic memory allocation, linked lists, file persistence, and a modular architecture.

Simple excercises in C++.

Variable-width integers for C

Exercising C++ classes

Real-time smart parking manager in C++ & SFML — 4D dynamic arrays, Euclidean smart allocation, live occupancy bars

A C implementation of the N-Queens problem comparing brute force, optimized search methods, and backtracking with execution-time analysis.

🕹️ Interactive graphical project implemented in C, featuring modular design, dynamic memory management, robust error handling, and file operations. Developed as part of coursework requirements for achieving a top academic grade (5.0).

Implementation of the matrix.h library in C programming language.