design_2

一个关于FAT16文件系统的说明与源码，对FAT16文件系统的开发好处(A note on the FAT16 file system with the source code, the FAT16 file system, the development of the benefits of)

基于数据库的VC++提醒精灵软件，设置好日期、时间、内容，就会在指定的日期、时间提示，须确定看到提示，否则两分钟后又提示。修改，删除，查询，日期，待自动启动到时间一会提示。 　　其中包括一个数据库操作类觉得不错，这个类是CPingDatabase，能插入、修改、查看、删除ACCESS数据库、SQLSERVER及所有的ODBC得用数据源来连接的数据库。使用类时出现一个警告，不用管它，那是微软的一个动态的原因。 (VC++ based on database software to remind the wizard, set the date, time, content, will be in the specified date, time, tips, to be sure to see tips, or two minutes later prompt. Modify, delete, query, date, to be automatically activated to the time for a prompt. Including a class of database operations that good, this class is CPingDatabase, to insert, modify, view, delete the ACCESS database, SQLSERVER and all ODBC starting a data source to connect to the database. A warning when using the class, do not ignore it, that is the reason Microsoft is a dynamic.)

一个用c++写的ado数据库连接作品 对初学者有一定的参考作用 主要是应用了mfc类库的知识 希望对大家有参考作用(A with c++ to write the ado database connection works for beginners of some reference value is applied knowledge mfc class library reference for all of us hope that the role of)

MIMO-OFDM仿真程序，包含完整的信道仿真程序，信道估计程序(MIMO-OFDM simulation program, include the full channel simulation program, the channel estimation procedure)

c语言编写的电话簿管理系统，含可运行的程序，可参考《C语言程序设计案例精编》(c language phone book management system, including operable program, refer to " C Programming Language design case for fine" )

并口程序 测试PC并口输入输出文件，挺不错的一个程序 分享(this is a little )

VS2010中MFC实现菜单，工具栏，状态栏，并静态分割界面(MFC to achieve the VS2010 menu, toolbar, status bar, and the static segmentation interface)

list控件的基本适应方法，简单易懂。。很适合初学者(The basic adaptation list controls, easy to understand. . It is suitable for beginners)

CAT系统中的自动化技术软件实现CAT system automation software(CAT system automation software)

斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作(Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the basis of further to the O (1) to achieve specified nodes and reduce the value of O (log n) time to complete the deletion of arbitrary nodes parade for)