COOL的PB框架界面

简单的access应用程序-simple access applications

酷Grid控件示例 ... ..cj.CDX ..............cj.dbf ..............MyGrid.SCT ..............MyGrid.scx ..............MZ.DBF .............. eadme.dbf .............. eadme.FPT .............. eadme.txt ..............xsda.CDX ..............xsda.dbf -Cool Grid Control example .............. cj.CDX ...... ........ cj.dbf .............. MyGrid.SCT .............. MyGrid.scx .............. MZ.DBF .............. readme.dbf ......... ..... readme.FPT .............. readme.tx t .............. xsda.CDX .............. x sda.dbf

VC++下的不规则三角网生成算法,这是不规则三角网的生长算法,通过建立TIN类,在TIN类内实现一些方法.-VC under the TIN generation algorithm, which is triangular irregular network growth algorithm, through the establishment of TIN category, the category TIN achieve some ways.

约瑟夫环源代码,前中后序递归遍历二叉树-Josephus source code, before, during and after recursive traversal sequence binary tree

很好用的c 注：前两个文件存储为m文件并放在工作目录下，运行结果为 p = 0.0000 -0.0000 0.0055 大家可以直接绘出f(x)的图形来大概看看f（x）的最值是多少，也可是使用优化函数来验证。matlab命令行执行命令： fplot("x+10*sin(5*x)+7*cos(4*x)",[0,9]) evalops是传递给适应度函数的参数，opts是二进制编码的精度，termops是选择maxGenTerm结束函数时传递个maxGenTerm的参数，即遗传代数。xoverops是传递给交叉函数的参数。mutops是传递给变异函数的参数。

在远距离数据通信中，为确保高效而无差错地传送数据，必须对数据进行校验即差错控制。循环冗余校验CRC(Cyclic Redundancy Check/Code)是对一个传送数据块进行校验，是一种高效的差错控制方法。-in long-distance data communication, in order to ensure efficient without error to transmit data, the data must check that the error control. Cyclic Redundancy Check (Cyclic Redundancy Check/Code) is to block transmission of data over a check out, is a highly efficient error control methods.

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

操作系统――进程调度算法实现 本程序主要实现了进程调度中最常见的优先数算法和轮转时间片算法。-operating system-- the process of scheduling algorithm to achieve the main procedures of the process of scheduling priority to the most common algorithms and several Web-time algorithm.

哈夫曼树的基本运算与实现的基本算法，对于数据结构初学者很有用 -Huffman tree basic operations and realization of the basic algorithm, for data structures useful for beginners

题目：设有一航班售票系统，要求完成以下功能： 1）假设该民航有若干航班，要求实现增加航班和取消某个航班的功能。 2）查询：根据用户提出的终到站查询航班号、售票情况等航班信息；也可根据航班号，列出该航班已订票的乘客名单。 3）订票：根据航班号为客户订票，如该航班有余票，则为客户订票；如该航班已满员，则显示相应信息。 4）退票：按乘客要求退出已预定的机票。 -Topic: First flight with the ticketing system, required to complete the following functions: 1) It is assumed that the Civil Aviation have a number of flights, calls for increased flights and cancellation of a flight functions. 2) query: Based on user queries raised by the end of the arrival flight number, booking flight information, etc. also available under the flight number, listed in the flight