这是一个学生数据库管理的小程序，本人乃学生，刚学习数据库编程，做了个这个，献丑了...

使用VBA可以将SQLServer数据库生成数据库，用word宏实现的数据字典生成器。 打开word文档后，按alt+f11即可看到源码。 需要修改其中的数据库连接串，否则无法连接数据库成功，也无法生成数据字典。 按F5即可运行查看生成的数据字典。 目前只支持SQL Server，不支持其他数据库

实现如何上传图片等数据，并存储其至数据库的源码-How do I upload pictures to achieve the data and store it to database source

数据结构中应用于图的演示源代码。供参考学习-Data structure used in Fig demo source code. For information, learning

回文算法实现,代码已经验证-Palindrome algorithm, code validation

从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法，即新插入的节点均为改二叉树的叶子节点，且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as binary sort tree nodes in the data field" s value, and the establishment of a binary sort tree to achieve binary tree insertion sort. To leaf insertion method, that the new nodes are inserted to change the binary tree leaf node, and in order to meet the orderliness.

源树b，b树结构，删除，插入，相当于搜索，搜索功能的范围

所有数理统计知识的源代码都在此,是一本数理统计数的配套光盘.里面有各种分布类型及参数估计插值-all mathematical statistical knowledge of the source code here is a mathematical statistical matching CD. There are various types and the distribution parameter estimation interpolation, etc.

p2pdbanywhere 可以通过之udp方式远程连接数据库的组件,这个组件非常好,是Delphi7,9,2006能够使用,包含源码.-p2pdbanywhere adoption udp can approach the remote database connectivity components, this component was very good Delphi7, 9,2006 to use, contains source.

动态连接ODBC数据库.使用通过数据源的名称动态链接访问ODBC数据库，如果程序中使用的数据库程序运行时是不确定的，数据库表中的域和记录可能被改变，那么通过指向数据库的数据源动态的对该数据库进行操作是比较好的方法．-Dynamic Link ODBC database. Data sources through the use of the name of Dynamic Link visit ODBC databases, If the procedure is used in the database program running is uncertain, database table fields and the record is likely to be altered, So, through the database at the data source dynamic database operation that is a better one.

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution