这是一个学院管理系统

可以对多个Excel文件中的数据，进行合并-Excel files can be multiple data merge

该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.

徐工集团

串口工具，PComm第三方库，做的串口工具，支持界面拉伸，支持的波特率包括50-912600kbps，支持窗口置顶、流控选择等操作。不依赖windows的Comm控件，增加配置文件的读取和解析等

C语言的常用算法-C language commonly used algorithm

该程序生成一个城市网络的最小生成树，可以按需求自己设置定点数和路径-The program generates a network of cities of the minimum spanning tree can be set according to demand their own set points and path

英文文章中单词拼写检查，并推荐可能存在的正确单词示例源码-Article in the English word spelling checker, and recommend the correct word there may be examples of source

hello word --ficest-hello word--ficest

VFP7高级编程电子书,顶好的VFP教程-VFP7 advanced programming e-books, top good VFP Tutorial

本次设计要求我使用最不经常使用页面淘汰算法。该算法在需要太太某一页是，首先淘汰到当前时间为止，被访问次数最少的那一页。这只要在页表中给每一页增设一个访问计数器即可实现。每当该页被访问时，访问计数器加1，而发生一次缺页中断时，则淘汰计数值最小的那一页，并将所有的计数器清零。-Abstraction: This design require me use a most unusual swap algorithm. When swap operation is demanded, this algorithm first swap the least accessed page up to present. To implement this algorithm, only need add a counter variable to eash page of the page table. When one page is accessed, the counter increase one. When page invalid interrupt occur, wash out the page with least count, then reset all the counters to zero.