成绩分析系统 可分析学生几个学期以来的学习状况

VB6.0下对Access数据库文件进行查找、添加、删除记录的源代码！-VB6.0 under the Access database files to search, add, delete records of the source code!

选课系统的数据模型，在线的选课系统，包括学生，老师，课程，课程与老师的安排，对老师的评价，问卷调查，及结果统计。

学生运动会成绩数据库 学生运动会成绩数据库系统记录某校运动会上全部运动项目，各系获得的分数及排名的情况，包括50、100、200，400，1500米，跳高，跳远，标枪，铅球铁饼等。进入系统后可以输入和修改某个项目的结果情况，可以按各系院编号输出总分；按总分排序；按男团体总分排序 ；按系院编号查询；按项目编号查询；按女团体总分排序。-Student Games Student Games results database performance database system for recording all the games of a school sports scores and faculty rankings, including 50,100,200,400,1500 meters, high jump, long jump, javelin, shot put discus and so on. After entering the system can enter and modify the outcome of a project can be output by each department Total Number of Hospitals by sorting scores male groups by sorting scores by the Department of Hospital No. inquiries by Item Number inquiries by women groups Total sort.

矩形编码压缩源代码是针对图象压缩设计的程序，该算法可用于生物信息学，图象处理等方面-rectangular Coding source code is against image compression design process, the algorithm can be used bioinformatics, image processing, etc.

求K阶斐波那契序列 一个难得的数据结构示例 有详细注解 适合正在学习数据结构的STU-For K-order Fibonacci sequence a rare example of data structure has detailed annotations are learning the data structure suitable for the STU

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

visualbasic的完整功能和运行代码，用于带条形码的超市库存和销售点

数据结构迷宫求解：用非递归方法求迷宫路径-Data structure to solve the maze: a maze with non-recursive method, to calculate the path

前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder

这是一个家庭信息管理的小软件！-This is a family of small information management software!