I've wrote some program that some of them are summarized below :
1. Nemodar : Nemodar is 2D/3D mathematical Function Plotting System for Microsoft Windows Platform, It also support many mathematical functions and standard procedure like Zooming or Rotating. [Awards : 6th Kharazmi Youth Festival 2nd grade , 2nd Sampad Research Festival 1st grade]
2. SQL+ : Sql+ is a relational Data Base Model System, compatible with SQL language for quering or working with data, aslo can support some advance features like Union , Intersect & MD5 hashing.It is OpenSource and licensed under GNU-GPL Download Project ( binary file, Documents & Sources )
3. Jelveh : Jelveh is photo editing utility based on mathematical functions, means user can change an image by defining mathematical function and applying that to image, usefull for viewing the effects of mathematical function in real world. [download]
4. eFiction2 [translation] : translation of efiction2 into Farsi language, eFiction is a web based fan fiction management system powered by PHP & MySQL. also support for Persian calendar. [view][download]
5. Graphica : graphica is a frontend environment for working with graph theory. you can draw graph or apply algorithms into them.
6. JNemodar : JNemodar is simplified rewritten version of Nemodar, which is written in Java and based on Object Oriented Design. also it has a good mathematical parser. the project main purpose was for Advance Programming course mid-term project. [download]
6. Graph Algorithms : implemention of some graph algorithms for discrete structure curse(:-)), written in C++ and Object-Oriented ( each algorith is in separate class ). algorithms like :
Bipartite Checking ( Both using DFS and Color ), NumOfPath ( between two vertex ) + Path Construction,Connectivity Component,Euilerian Tour and Cycle ( in simple & directed graph ) + finding Cycle ,Shortest Path: using Dijekstra alg ( single-source shortest path ): using BellmanFord alg ( single-source shortest path for negative weight ):using Floyd ( All-pair shortest path ), Graph Coloring ( using Approximate Graph Coloring method ) ,Cutting Edge, Cutting Vertex, Diagonal of the Graph ( Diameter ), Edge Coloring, Hamiltonian Path ( NP-complete ), Maximum Flow & Minimum Cut ( Ford-Fulkerson algorithm ) , Minimum Cut (Wagner Algorithm ) , Strongly Connected Component (DFS) . it also has a good graph class and well-formed structure. [download]
[to be concluded...]