c语言编写上机运行已经通过,实现多道程序的转换调度（作业调度和进程调度结合在一起）...

这是一个好用的MD5的C++类；这个类可以加在控制台 程序中也可用在MFC中， 并且提供了详细的错误处理 函数，是一个安全的类。例程是一个MD5的MFC程序， 支持字符串和文件两种输入。 LPCSTR TargetFile(char *filename=NULL) //计算文件的MD5值 void TargetStr(LPCSTR str) //计算字符串的MD5值 LPCSTR GetDigestKey() //取MD5运算后的结果 LPCSTR GetErr() //如果有错误，取错误字串-This a user-friendly MD5 C; This category can be added to the Console program is available in MFC, and provided a detailed error handling function, is a safety class. MD5 is a routine MFC procedures, and documentation to support a string of two input. LPCSTR TargetFile (char* filename = NULL)// calculate MD5 value of the document void TargetStr (LPCSTR str)// calculate MD5 string value LPCSTR GetDigestKey ()// Operational MD5 from the results LPCSTR GetErr ()// If there were mistakes from the wrong string

这是一个人力资源管理系统，可用于机构的日常管理，可供学习-This is a human resources management system can be used for the daily management of institutions available for study and

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

数据结构典型算法实现，c实现二叉树的遍历以及赫夫曼编码-data structure typical algorithm, c achieve the traversal of a binary tree Huffman coding

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

c#编写的一个数据库批量更新小工具。对测试人员来说比较有用。(可以一次性批量添加N条记录）-c# prepared a database batch update gadget. The test more useful for the staff. (You can add a one-time volume records N)

施伯乐@黄皮书《数据结构教程》part2-Shi Bole @ beige book Data Structure Course part2

fastdb-241源码，俄国人开发实时数据库系统！-fastdb-241 source, the Russians to develop real-time database system!

6个经典数据结构JAVA解法，供学习。-six classic data structures Java Solution for learning.

设有n个人站成一圈，每个人持有一个密码（正整数)。现从第t个人开始，按顺时针方向“1,2,3,4,…”循环报数，数到m1（第t个人所持密码）的人出列，然后从出列者的下一个人重新开始报数，数到m2（刚出列者所持密码）的人又出列，如此重复进行，直到n个人都出列为止。-something like Joseph problem