动态变量

C++面试试题，值得一看-C interview questions, the eye-catcher

学生管理系统能对学生信息进行管理并查询，本系统采用VB+ACESS工具开发 分为管理员登陆和学生登陆，管理员具有添加，删除，更新的权限。学生则只有查询权限。二者共用以个数据库。下面就对系统的部分功能，模块及代码进行分析。

算符优先函数 设计一个给定算符优先分析表，用有向图法构造算符优先函数的算法。-Operator to design a priority function given priority operator analysis table, and have to graph structure function operator priority algorithms.

假设以如下说明的三元组 (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

数据库界面自动生成的控件- The database contact surface automatic production controls

是一个ibats和struts的整合的实例，包括多个数据库的代码，（有oracle，MySQL等）-Ibats and struts is a example of the integration, including a number of database code, (with oracle, MySQL, etc.)

利用TreeCtr控件访问数据库-use TreeCtr controls access to the database

按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage

编写一个算法，利用栈的基本运算返回指定栈中栈底元素

饭店住房管理服务系统(C#.NET)-hotel housing management system (C#.NET)