wenjiankunbanqi

类似windows的计算器功能..有加减乘除乘方运算(Jun comparable number of windows cavity算器 .. bleed at the nose floor features Endure-effect pot算efficiency source side of bridge)

一个输入日期时自动判断合法性、补全格式的模块调用示例，有详细注释。(Automatically when an input to determine the legitimacy of the date, call up the whole format of the module example, there are detailed notes.)

VC++从DLL中获得资源的小实例源代码，从DLL中获得背景图像，可者是一个图标资源或是其它类型的文件，总之，学会了一种，就可以举一反三，灵活掌握了。(VC++ from the DLL resources, source code examples to get a background image from the DLL, can an icon resource, or other types of documents, in short, learned, you can learn by analogy, flexibility.)

抑制载波型差分相位调制，借鉴了主成分分析算法（PCA），有CDF三角函数曲线/三维曲线图。( Suppressed carrier type differential phase modulation, It draws on principal component analysis algorithm (PCA), There CDF trigonometric curve/3D graphs.)

用beep蜂鸣器写的婚礼进行曲，循环播放》。(music from beep )

简单易行，很好玩很简单那，我都没费什么功夫(Simple and fun it is very simple)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

校运动会代码（部分），使用VB编程，由学生自己开发(yundonghui)

利用上题的线性表，编程下列功能：假设以两个元素依值递增有序排列的线性表A和B 分别表示两个集合，现要求另辟空间构成一个线性表C，其元素为A和B元素的交集，且表C中的元素也是依值递增有序排列。(The use of the title of the linear form, programming the following features: Assuming two elements by incrementing the value ordered linear tables A and B represent two sets, are now required to open up space to form a linear table C, whose elements A and intersection B elements, and the elements in the table C is incremented by an orderly arrangement.)

说明：  实验题目：5.1 基于顺序栈的括号匹配程序设计验证 一、实验目的 1. 掌握栈的顺序存储结构； 2. 掌握栈的操作特性； 3. 掌握基于顺序栈的基本操作的实现方法。 二、实验内容 1. 实现顺序栈的成员函数； 2. 基于顺序栈的括号匹配程序设计验证。 实验题目：5.2 基于链式栈的表达式的计算程序设计验证 一、实验目的 1. 掌握栈的链式存储结构； 2. 掌握栈的操作特性； 3. 掌握基于链式栈的基本操作的实现方法。 二、实验内容 1. 实现链式栈的成员函数； 2. 基于链式栈的表达式的计算程序设计。 (Experiment Title: 5.1 Based on the order of the stack in parentheses matching program design verification 1, experimental purposes 1. To master the order of the stack storage structure 2. Master stack operating characteristic 3. To master the basic operation of stack based on the order of the realization method. Second, experimental content 1. To achieve the order of the stack member function 2. Based on the order of the stack in parentheses matching program design verification. Experiment Title: 5.2 Based on the expression stack chain calculation program design verification 1, experimental purposes 1. Master stack chain storage structure 2. Master stack operating characteristic 3. To master the basic operation of stack-based chain implementations. Second, experimental content 1. To achieve chain stack member function 2. Based on the calculation of the expression stack chain programming)