数据库基础教程chm

files about dsp applications control

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来自bi), 第4行存放0或１（０代表作业序号未进入最优调度方案；１代表作业序号已进入最优调度方案） （２） 排序完后，按课本所述方法求一种最优调度方案，存放在S中。 -(1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.

考勤管理系统VC源码 登录的用户和密码均为KQ -Attendance Management System VC FOSS users and login passwords are stretch

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

这是一个简单的实用程序，允许您在不安装MS access的情况下压缩和修复access数据库。对于使用commondialogs和简单的文件复制/删除以及compact&；repair例程的示例来说，它也很好。

一个能求图中任两顶点之间的最短距离的程序-seeking a map to the two vertices of the shortest distance between the procedures

有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non- recursive algorithm, undirected graph of the non- recursive depth-first traversal, and we hope that it needs! !

ORACLE数据库的交集查询-the intersection of inquiries

数据结构效验算法-data structure well-tested algorithm

数据结构中的AVL TREE的实现-data structure of the realization of AVL TREE