数据结构中离散事件的实现

关于图遍历的演示包括所有的源代码和执行文件，内容齐全，数据结构的有关作业-Ergodic on the map presentation, including all source code and implementation of document, content complete, the data structure of the operating

用vb做的一个关于学生信息管理的系统，功能齐全，适合做学生毕业设计。-Vb make use of a student information management system, full-featured, suitable for graduate students to do the design.

相对于实验一，新增了2个类。 Class Listing vector. Class Group vector. 使用到了向量。增强了大家对STL向量容器，以及实现所给的声明函数。 压缩包里面有代码，指导书，以及Apache服务器。-Prerequisites: Students should have mastered the following prerequisite skills. C++ Class Specification- Produce C++ class implementations Standard Template Library- Knowledge of the STL, particularly sequential containers and iterators Goals: This assignment is designed to reinforce your understanding and use of the STL vector container and the Standard Template Library. Outcomes: Students successfully completing this assignment would master the following outcomes. Produce C++ class implementations given class declarations

大二，数据结构，8套期末考试试题，仅供学习之用-Sophomore year, data structure, 8 sets of examination papers at the end, only learning

本例主要是学习单向链表时的一个基础试验，当练手用，功能上包括链表的建立，节点的删除、修改、遍历。

循环链表的应用 循环链表的应用 很方便的实现-cycle Chain cyclic chain of convenience Implementation

数据库编程 DAO连接数据库-DAO Database Programming connect to the database

本代码经过验证，绝对可以运行，并附有解析，对初学者有很大帮助-Verified the code and it can definitely run with a resolution, has great help for beginners

编写一个算法，利用栈和队列的基本运算将指定队列中的内容进行逆转。 含完整程序

此为编译原理实验报告 学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: （1）把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行 （2）FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则； 消除关于Pi规则的直接左递归性 END （3）化简由（2）所得的文法。即去除那些从开始符号出发永远无法到达的非终结符的 产生规则。-to compile this report principle experiment to eliminate learning grammar rules Left delivery algorithm, left the Elimination delivery grammar rules in grammar analysis of the role of the design algorithm containing purpose algorithm source code .... etc. : Elimination left recursive algorithm : (1) grammar, of all non-G website by the end of a paramagnetic Arrange sequence P1, P2, ... Pn implementation of this order (2) FOR i : n = 1 DO TO BEGIN FOR j : = 1 DO put the shape of Pi Gamma approximate rewrite the rules 1 into Pi Gamma Gamma 2 k .... These ions 1 2 ... k ions on all the rules; Pi elimination of the direct rule left recursive END (3) Reduction from (2) from the grammar. Removing that those symbols s