学生运动会成绩数据库 学生运动会成绩数据库系统记录某校运动会上全部运动项目，各系获得的分数及排名的情况，包括50、100、200，400，1500米，跳高，...

自制C语言贪食蛇小游戏，里面包含两个文件，一个是源程序，一个是图形化驱动，只要两个文件放在一个目录下即可运行，语句简单易懂-Self-made C-Snake game, which contains two files, one source, one is graphical driver, as long as two files in a directory to run, easy to understand statements

材料仓库管理系统,这是本人课程做的课程设计,有源代码,可以运行的哦-materials warehouse management system, this is my courses do curriculum design, the active code can run the oh

实现基于二叉树表示的算术表达式实现基于二叉树表示的算术表达式-eeeeaaaaaaaaaaaaaannnnnnnnnnnnnnnnnnnn

常用的几种排序算法的实现源码，同时还给出了几种排序算法的比较结果，源码中的排序内容都是随机产生的-several commonly used algorithm to achieve source, but also gives several algorithm result of the comparison, the ranking source content are randomly generated

哈夫曼树算法 根据给定的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

栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe

Visual C#数据库开发中 简单论坛的开发sql2000数据库-Visual C# Database development in a simple forum for the development of SQL2000 database

数据库系统概论（第三版） pdf格式图书 萨师煊著-Introduction to Database Systems (third edition) pdf format book with Savimbi division Xuan

一个演示如何根据数据库动态建立访问数据库的DSN程序。-a demonstration of how dynamic database access to the database to establish procedures for the DSN.

说明: 这一段在复习数据结构和算法，有一些零星笔记，在Others这个归类下，欢迎指正。 对于排序算法，想做一个动态演示的东东，因此今天使用VB.net大概实现了一个，界面如下，代码有2个版本，一个可以指示当前循环的位置（但设计感觉不好，也找不到更好的办法），一个没有。 -Note : This section of the review of data structure and algorithm, a few scattered notes, in the classified Others, welcomed the correction. For Sorting Algorithm and do a demonstration of the dynamic page, and it is probably using VB.net achieved one of the following interface, the code has two versions, one can instruct the current cycle position (but feel bad design, but also find better ways), a no.