是比较好的SVM 代码，对一些初学者而言，可以好好利用，可能开始自己编写代码会比较困难，但是多看看别人写的代码 ，可能会对自己有所帮助，所以上传此代码，为了让更多人好好利用资源，好好学习

一个c语言开发的小型的dbms系统，支持造表查询，删除等一些简单的操作-a small development of DBMS systems to support table made inquiries, delete some simple operation

MaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoMaxtoCode StandardMaxtoCode StandardCode StandardMaxtoCode StandardvvvvvvMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode Standard

模糊查询源码,实现简单的数据库条目查找。

our homework big project

排课表，对于给定的课程及其先序关系，给出所需学期数最少的排法。-Course Scheduling table, for a given sequence of courses and their relationship first, given at least the required number of semester scheduling method.

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

ODBC数据源注册小工具，简化数据库连接-ODBC data source registered a small tool to simplify database connection

宾馆酒店管理系统