数据结构的课后练习，全会做就能过这门课了

给paradox表增加、修改口令。-paradox to the table, change passwords.

数据库程序，可实现数据的查询与修改，希望喜欢-database, which enables the data query and amended in the hope that like

我已经寄给这个网站的数据库管理系统项目。这是对每个数据库管理员非常有用谁对此工作。这一项目被实施使用 java 服务器 page(JSP)

过JAVA编程产生一系列伪随机数，掌握平方取中法、乘同余法、混合同余法产生均匀随机数的方法。-off Java programming produce a series of pseudo-random numbers, master Mid-square method, I took with the law, mixed with the law I have Random Number method.

c语言小程序100个-100 small programs

Database Viewer application. Allows you to view and scroll through all of the records in a database.

数据结构与算法里，陈列馆中机器人看守问题。-dormitories

Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plemen

这是俺编写的一个堆栈，采用模版函数编写，面向过程设计，供大家参考-I prepared a stack, using templates prepared function, process-oriented design, for your reference

―图数据类型的实现――问题描述：图是一种较线性表和树更为复杂的数据结构。在图形结构中，结点之间的关系是任意的，任意两个数据元素之间都可能相关，因此，图的应用非常广泛，已渗入到诸如语言学‘逻辑学、物理、化学、电讯工程、计算机科学及数学的其它分支中。因此，实现图这种数据类型也尤为重要，在该练习中即要实现图的抽象数据类型。基本要求：2、 定义出图的ADT；3、 采用邻接矩阵及邻接表的存储结构（有向图也可使用十字链表）实现以下操作：a. 构造图 b. 销毁图 c. 定位操作d. 访问图中某个顶点的操作e. 给图中某个顶点赋值的操作f. 找图中某个顶点的第一个邻接点g. 找出图G中顶点v相对于w的下一个邻接点h. 在图G中添加新顶点vi. 删除图G中顶点vj. 在图G中插入一条边k. 在图G中删除一条边l. 实现图的深度遍历操作m. 实现图的广度遍历操作参考提示：具体内容参看教科书本156页实验要求：对于以上具体操作要求实现时有良好的用户交互界面。详细设计、编码、测试。-2 ADT3 a. b. c. d. e. f. g. Gvwh. Gvi. Gvj. Gk. Gl. m.