Embedded hardware book

T6939使用资料-T6939 use the information

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.

这是大学里面学习《数据结构》，严蔚敏版本的配套配套练习册 数据结构C源代码 的答案-This is the university there to study

便携式产品低功耗电路设计的综合考虑 低功耗设计-Low-power portable products integrated circuit design considerations

侯捷译PracticalJava(含源码) rar 压缩文件 大小 1.48MB-translated PracticalJava (including source code) rar compressed file size 1.48MB

这本书教会你如何编写高质量的程序，正如书名所说的，其中存在着很多奥妙-this book you how to prepare the Church of quality procedures, as mentioned in the title, there are a lot of mystery

高级J2EE 平 台 开发的电子书 2003 年9 月15日 出 版-senior J2EE platform of electronic books on September 15, 2003 published

本文档是（作者：钱能）《C＋＋程序设计教程》系列的部分辅助代码。 -C++ code

关于如何设计数据结构和算法的好书（英文），希望对学习数据结构和算法的朋友有所帮助。-on how to design data structures and algorithms of the books (in English), and I hope to learn from data structures and algorithms friends help.

软件工程管理书籍--微软团队-成功秘诀-software project management books-- Microsoft team-secret of success