早期的WINDOWS编程,适合刚接触WINDOWS编程的初学者

《VB精华文摘-其他篇》.chm-"Potpourri VB best-other articles." Chm

实用Visual C++ 6.0 编程实例与技巧-practical Visual C 6.0 programming examples and techniques

Visual C++实践与提高－－数据库开发与工程应用篇 随书代码 希望对用ADO开发的人会有所帮助 这是第6、7章的-Visual C Practice and improve-- database development and application articles with the hope that the code book to use ADO development will be helpful, this is the first six, seven chapters

详细系统介绍了windows下多线程程序的开发.包含示例源码.-detailed system introduced under the windows multithreaded program development. Examples include the source code.

PCB设计走线参考书，是硬件设计初学者有价值的指导教材！-PCB trace reference design, hardware design is a valuable guide for teaching beginners!

oreilly - managing nfs and nis 2nd edt-oreilly- managing nfs and nis 2nd edt

我上课用的数据库课件,比较适合初学数据库的人以及想考计算机三级的,希望对大家有用!-a database courseware database more suitable for beginners as well as those who would like to test computer three, I hope useful for all!

抽象窗口工具箱 (AWT) 由某些图形用户界面 (GUI) 组件所构成。这些组件都是用各自的本地平台版本来实现的 ，提供了所有本地平台所共有功能的子集。大部分功能都被“Swing 集合”所取代。另 见 Swing 集合。-abstract window toolkit (AWT) from some of the graphical user interface (GUI) components as a result. These components are used in their respective versions of the local platform to achieve, and to provide a platform for all local shared by the functional subset. Most functions were "Swing Set" replaced. See also Swing Set.

写给想当程序员的朋友 开发者最好的初学思想 -To those who want to become programmers The best thinking for new developers

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小: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.