介绍了如何用VC存取数据库中的大对象的方法

数据结构：队列程序-data structure : queue procedures

The most popular embedded database. Fastest and stablest.-The most popular embedded database. Faste st and stablest.

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co

本科时参加小竞赛设计的一个代数运算器 1. 能对常用的四则运算，三角, 乘方,开方运行2. 支持变量赋值和运算 3. 增加批处理执行功能（批处理脚本文件） 4. 增加对向量或矩阵运算的支持，如输入 -Undergraduate to participate in the design a little contest an algebraic calculator. Can commonly used four arithmetic, trigonometry, involution, prescribing run 2. Supports variable assignments and operations 3. Increase the batch executive function (a batch script file) 4. increase support for vector or matrix operations, such as the input

在9（3*3）个方格的方阵中填入数字1到N(N>=10)内的某9个数字 每个方格填一个整数，要求相邻两个方格的两个整数之和为质数。 试求所有的解-in 9 (3* 3) grid matrix to fill out a number of N (Ngt; = 10) of a nine figures each box filled an integral require two adjacent box at the two integral to the quality and number. Examination for all solutions

这是一个用来介绍对象关系数据库管理系统，对感兴趣的朋友应该有用-This is an introduction to object-relational database management system should be useful to interested friends

利用随机函数产生30000个随机整数，利用插入排序、起泡排序、选择排序、快速排序、堆排序、归并排序等排序方法进行排序，并统计每一种排序上机所花费的时间-Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort and other sorting methods to sort and sort each type of statistics on the time machine

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree

一些二叉树的功能，包括二叉树的创建，遍历，以及二叉树的深度和叶子数量的统计