vfp数据库应用编程

二叉树算法,如何构造二叉树以及对二叉树的操作-BinaryTree

Bugs Integrated, Inc. 解题报告-Bugs Integrated, Inc. Problem-solving report

一个三层应用程序，演示如何通过ADO对象以及存储在SQL Server中的Procedure实现高性能的数据访问(在运行程序前首先要设置SQL Server，在压缩包中有一个Procs.sql的文件，首先在SQL Server上运行该文件设置SQL Server数据库)-a three-tier applications, demonstrating how ADO and SQL Server stored in the Procedure to achieve high-performance data access (in the first before running the program to set up SQL Server, in a compressed Procs.sql a document, the first in SQL Server running on the document set up SQL Server database)

我的数据结构的实验题，停车场，用栈和队列 模拟停车场，实现进车和出车-my data structure experiment, a car park, with Stack and Queue simulated car parks, to achieve progress and out of cars

JDBC 数据库嵌入java内，通过java变成实现数据库的嵌入及调用，可向数据库中添加记录-JDBC

train reservation in visual basic

图书销售管理系统》的数据库课程设计论文，内容完整，结构清晰，是个很好的数据库课程设计实例-Book Sales Management System " database of curriculum design papers, the contents of a complete, structural clarity, the database is a good example of curriculum design

pb实现的气泡窗口，非常实用-pb achieve the bubble window, a very practical

需要alpha控件，使用Delphi开发；

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.