用JSP链接到数据库使用起来非常简单，CUT然后PASTE，原代码中我给出了详细的注释。...

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

人事管理系统VC源码 登录的用户和密码均为RSK-Personnel Management System VC FOSS users and login passwords are RSK

数据结构常用算法：平衡二叉排序树的综合操作 全部程序代码，在C环境编译通过。-algorithm commonly used data structures : a balanced binary sort tree all integrated operation code, the C compiler through the environment.

ben wenjian shi tongguo yong cbainxie chengxu shixian-ben wenjian shi tongguo yong cbainxie Rezeption gxu shixian

遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.

一种基于二维链表的稀疏矩阵模半板类设计 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.-based on two-dimensional chain of sparse matrix model semi-plate design of Class A"s template parse matrix. Key technology : bin. 2-m linked matrix. constructors : 1.normal constuctor 2.copy constuctor. 3.ass ignment constructor. Basic operator : 1. addition (sub) 2 matrix of two. inverse of a ma trix. 3. multiply of two matrix. etc

建立、使用二叉树的程序，内含源程，是数据结构中必学知识。-established procedures for the use of binary tree, the source of intron way, the data structure is certainly knowledge.

题目：有1、2、3、4个数字，能组成多少个互不相同且无重复数字的三位数？都是多少？ 1.程序分析：可填在百位、十位、个位的数字都是1、2、3、4。组成所有的排列后再去掉不满足条件的排列。 2.程序源代码：-topic : 1,2,3,4 figures, the number can be formed with each other with no repeat of the triple-digit figures? How many are? 1. Program Analysis : can fill the 100, 10, 000 the number of spaces are 1,2,3,4. With all the components removed after not satisfied with the conditions. 2. Source code :

一个俄国人实现的数据库系统，同时他的网站上还有一个实时数据库系统-Russian achieve a database system, while the site includes a real-time database system

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output