堆栈的应用及操作 利用堆栈实现对任意进制的数的转换；

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

STL哈希表的使用范例：包括哈希表的创建、插入、查找、删除、内存分配和释放内存。-STL use examples include : Hash Table creation, insert, search, delete, memory allocation and release memory.

实现M/M/1单窗口无限排队系统的系统仿真，利用事件调度法实现离散事件系统 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

湖南大学文献信息检索课综合实习报告 2． 进入湖大图书馆网站http://lib.hnu.cn/ 的“数字资源”各数据库（即文献库）查找课题相关文献信息资料，辅助以手工检索（图书馆八楼文献信息检索室）和纸本期刊（图书馆一楼、四楼、七楼）以及因特网上资源。检索年限不作限定，以能了解本课题的全貌和最新进展为原则。-Hunan University literature class information retrieval integrated internship 2. Library Web site to enter the lake http://lib.hnu.cn/

ASP直接存取ACCESS数据库-ASP direct access ACCESS database

根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。-According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.

excel仪表盘，很强大的仪表盘功能，做得很漂亮-excel

一个用来储存资料的数据库用C++builder 与jet 4.0编写-used to store a database with information on the C jet builder with 4.0 preparation

西电的VC++课上的几个通用模板,完全是可用的-West electricity VC++ Class several generic template is completely available

数据结构答案2，经多次修改而成，比答案册的还要简单清楚。-answer two data structure, several revisions, the book also answers simple and clear.