实验室设备管理系统 vb 需要的可以参考下

数据结构的第二个实验-data structure to the second experiment

数据结构――C语言版配套源代码-Data structure- C language version of matching source code

跟着鼠标转的眼睛控-with eyes turned to the mouse control

VC操作ADO对象，精简操作过程，包含了大多数数据库操作方法，很实用 使用ADO前必须在工程的stdafx.h文件最后用直接引入符号＃import引入ADO库文件 生成应用程序框架并初始化OLE/COM库环境 程序最后要调用   ::CoUninitialize()；//释放程序占用的COM   资源

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).

单链表的一些简单算法。-some simple algorithm.

利用Access数据库制作的学生管理系统，可以方便的进行查询和其他管理。-use Access database produced by the student management system, to facilitate the conduct of inquiries and other management.

本模拟考试系统设计考生登录及考试界面模板，各模块的功能能具有考试的各个功能，本系统采用了VB。net2008作为开发工具，后台采用了SQL server2005数据库-Examination of the simulation system design and test candidate interface template registry, the functions of each module can have various functional tests, the system uses the VB. net2008 as a development tool, the background database using SQL server2005

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

最大频繁项集挖掘算法。运行前需将release中的data和result数据拷贝到上一级目录下。-Maximal frequent itemsets mining algorithm. Needs to be run before the release of data and result data are copied to the directory level.