优先数调度处理器算法，实现处理器调度的程序，

一个实用的数据库实例，采用ODBC接口，对初学者有很大帮助-a practical example of a database, using ODBC interface for beginners will be of great help

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation

课程设计--VB成绩管理系统,希望能得上。-curriculum design-- VB performance management system, hoping to find the last.

利用Linklist实现超大整数之加减乘除-Linklist achieve large integers using the Math

六级单词数据库编程，压缩包中已带数据库 数据库使用的是Acce-six words database programming, which has been compressed with the use of the database is the database Acce

prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.

图的遍历，在连通的无向图上访问全部节点的操作-Graph traversal, in the undirected graph connectivity to access all the nodes to operate

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

约瑟夫环最终运行文件，适合直接使用者，不必再以来C语言来汇成执行文件。-Josephus final run files, suitable for users, having been formed to C language implementation document.

这是研究生课程计算方法与技术中讲到的Prime算法的具体实现，相信学这个课的同学都会感兴趣的。-This is the postgraduate courses calculation methods and technologies referred to the Prime algorithm to achieve specific, I believe that this course of study students will be interested.