bank-system

This is my banking system project. This project uses PostgreSQL and python to track financial flows in the bank.

data-mining-homeworks

This repository contains my solutions and implementations for assignments assigned during the Data Mining course.

database-lab-project

ftp

a simple FTP protocol

genetic-code

My Python code that uses the A* algorithm to generate the desired genetic code.

js-fundamentals

In this repository, my practice code of JavaScript is stored, which I have used to familiarize myself with the syntax of this language.

linux-kernel-module

My bank system, this bank runs on the Linux kernel.

machine-learning-homeworks

This repository contains my solutions and implementations for assignments assigned during the Machine Learning course.

mano-simulator

Mano-simulator : A 16-bit assembler that execute your assembly commands

max-sat-solver

My MAX-SAT solver uses stochastic local search, tabu search, and simulated annealing.

microprocessor-laboratory

In this repository, I have placed the codes of the micro lab assignments that I have passed in IUT.

mini-wireshark

Mini-WireShark and mini-Nmap

mohammadyasinkarbasian

persim

Distances and representations of persistence diagrams

probability_statistics

Jupyter Notebooks for Probability & Statistics (Persian Language)

simon-game

My simon-game project that is written in C language for the AVR ATMEGA32 microcontroller.

social-media

space-farm

A game like "Hay Day" but written in Qt (C++)

stable-marriage

This repository contains a Python implementation of the Stable Marriage Algorithm, a mechanism for solving the stable marriage problem. The algorithm is widely used in the field of matching theory to find a stable matching between two sets of elements, such as job applicants and employers or medical students and residency programs.

sudoku-solver

My sudoku solver using python

top-trading-cycle

This repository contains a Python implementation of the Top Trading Cycle Algorithm, a mechanism for solving the problem of allocating indivisible items or resources among agents with preferences. The algorithm is widely used in the field of matching theory, particularly in the context of school choice and house allocation problems.