ADO操作数据库强大封装类

假设某银行有4个窗口对外接待客户,从早晨银行开门起不断有客户进入银行。由于每个窗口在某个时刻只能接待一个客户，因此在客户人数众多时需要在每个窗口前顺次排队，对于刚进入银行的客户，如果某个窗口的业务员正空闲，则可上前输业务；反之，若4个窗口均有客户所占，他便会排在人数最少的队伍后面。

ssd7考试2的答案，自己做的，98分的-2 answers ssd7 examination that he did, 98 points

本程序实现调用开放式数据库连接 (ODBC) 函数，及调用 ODBC 函数 SQLTables 和 SQLColumns。 显示选定数据库中的所有表，以及为每一个表显示列的列表和有关每一列的信息.-the program called Open Database Connectivity (ODBC) functions, and ODBC function calls and SQLColumns SQLTables. Shows selected database of all the tables, and each table shows a list of columns and each of the information.

VB+access+ado

通过builder实现的数据结构各种算法 由于本人编程技术还没成熟，不足之处还请见谅-builder achieve through the data structure algorithms as I mature programming No shortage Department also requested forgiven

计算圆周率 Pi (π)值, 精确到小数点后 10000 位 只需要 30 多句代码！-Pi calculated pi () values, accurate to 10,000 decimal places only need more than 30 sentence code!

一个精彩的奥运会成绩统计系统，可以统计金牌榜，总分榜，包含精彩的VFP界面，即时迅速统计各个国家的金牌及奖牌总数的变化-one of the highlights of the Olympic Games scores system, the gold medal tally and statistics, scores charts, Highlights include the VFP interface, immediate rapidly statistics in various countries gold and total medals changes

有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non- recursive algorithm, undirected graph of the non- recursive depth-first traversal, and we hope that it needs! !

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

在主要功能框内我设置了房东身份查询、租户身份查询、空置出租屋资料、租户资料、业务管理、加载管理人员信息、加载租户相关信息、加载出租屋相关信息。-Box in the main function of the identity of the landlord and I set up inquiries, the status of tenant inquiries, vacant rented information, tenants information, business management, load management information, load information about tenants, rented load related information.