C++数据结构的用法 适合对C++语意思有一定了解的人

这是一个程序集级程序，以接收来自另一个 microcrontroller 的并行端口数据。它储存在暂存器。这些数据是时间标记和中继到 PC 串行端口上。该代码使用中断使并行处理成为可能。已测试和用于应用程序的代码。此代码将讨论两个主要 issues:(a) 时间 tagging(b) 平行于串行转换。

学生选课系统，具有注册，删除，选课等选课系统的基本功能-Student elective system, with registration, delete, elective classes, such as the basic functions of the system

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

精心链表操作,对单向双向的链表操用实例，精当-carefully chain operation, a one-way pairs two-way linked list speaks examples of elder

固定资产管理系统-Fixed Assets Management System

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

彩电故障信息共享系统 本程序使用Visual C++６.0编程制作信息共享系统,实现信息管理共享的自动化。由此实现了信息的增加、删除、修改、查看等功能，并且进而实现信息的安全管理，使信息的管理更加人性化，规范化。从而提高故障排除效率，提高信息利用率，有助于进一步提高了生产效率。-TV fault information sharing system of the present procedures using Visual C 6.0 programming produced information sharing system, Sharing information management automation. This realization of the information to add, delete, modify, check, and other functions, and thereby achieve information security management, information management more humane and standardized. Improve troubleshooting efficiency, improve utilization of information and help further enhance the efficiency of production.

功能：四阶幻方全解 运算时间：3、40秒 结果：7040个 环境：Visual Studio.net 2003的vc++的控制台项目-Function: fourth-order magic square-wide computing solutions Time: 3,40 seconds Results: 7040 Environment: Visual Studio.net 2003 the vc++ Console project

数据结构常用算法：图的最小生成树 经典算法：图的最小生成树-algorithm commonly used data structures : Figure the minimum spanning tree algorithm classic : Figure the minimum spanning tree

有关zip的一个开发实例。主要包括图片和程序源代码。-Zip database .Plaese use.