C#

C# Source Code

Free C# Source Code. Download 10 latest C# system's projects with source code for free here.

Info-App Manager

Submitted by Lan.E on
Info-App manager Language used: Visual basic.net C# & MSSQL Database System Modules Member registration Module Address Book Module Activity/Log Module Tax - Income Tax Module User/Member manager Transaction Log module Backup/Restore Module Rdlc Reports viewer Info-App Manager is a Multi Information windows application System, The system is equip With advanced modules, One can Control, Manage

Expense Management Plus Accounting Software

Submitted by waqaxx on
Complete expense management system developed in C#.net. Full managed database included primary and foreign keys. script included in project. contact for some more features ([email protected]) Some main features are: 1. Admin & Employee Login separate features. 2. Company setup information for printing at the end of reports and invoices 3. Manages personal expense also (with reports) 4

Investment Management System

Submitted by vaibhav02 on
It’s an advanced Investment Management System Project written in C#.Net 4.5.1 as front end and SQL Server 2012 as Back end. Requirement : Visual Studio 2013 (Sql Server 2012) and SAP's Crystal Report for Visual Studio 2013 Its have multiple views for three different-different users : Main Features are: Company Entry Profit master Client Profile Employee Profile Contacts Complaint Box Investment

Snake game

Submitted by ellord on
Hi, i'm a student in informatic and I had to correct and improve an original program. Rule : You must eat the purple square to gain point until you eat yourself accidentally. Control : Arrow key Bug correction/Improvement : -Sounds has been completely reworked. -Game doesn't freeze anymore before your snake die. -Look (Alignement, font, text, antialiasing...) Original version : http://www

Bubble Sort In C#

Submitted by walidsharaar on
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller