餐厅点菜系统，软件工程实习的例子，对理解软件工程的流程很有帮助...

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.

一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究.-a compression algorithm, named PPMD, higher compression ratio, and can make its own decisions and build, please algorithm research colleagues to study together.

dBaseIII的源码。-dBaseIII the source.

its our assignment to build interface for a booking system at UMS spisk school

一种基于数据访问流的数据库索引优化方法该方法通过集成业务流程模型与数据模型，抽取了流程活动中包含的数据访问操作和流程的控制结构形成数据访问流，分析了数据访问流中数据访问操作的频度，为频繁数据访问操作所对应的数据项创建索引，达到改善数据访问性能的目的。实验结果表明，该方法提高了数据查询的速度。-A novel method called data-access-flow based index optimization (DAFIO) is proposed to provide automatic index select for databasein order to improve the data access performance. By integrating the data model and process model of the IT systems and getting data access flow, theDAFIO method can analyze the data access flow to find those data item which are accessed frequently, and then create indexes for these frequentitems. The experiment results show that the novel method is effective to improve the data access performance.

此程序将从给定的字符串中删除模式 (子串)。 这是最简单和容易理解的 c + + 编写的代码。 这是最准确和最佳性能要使用的程序。

航空售票系统- Aviation booking system

对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding

数据库访问原代码-original code database access

这是用c++实现的一个复数重载的实例，对于学习c++中重载的问题很有帮助，来看看吧！-This is achieved with c a plural Heavy examples for learning, c Overrideable very helpful, at the end of!