Debug命令大全, DOS下ASM程序调试很有用

UML与设计模式 包含Facade设计模式、Abstract Factory设计模式、Visitor设计模式结合Rose使用设计模式。-UML and design patterns with Facade design pattern, Abstract Factory design pattern, Visitor design pattern with the use of design patterns Rose.

停车场收费系统系统平台 GPS/GSM车辆监控及调度指挥系统 基于移动通信网络的车辆管理系统+ 远程无线通信的视频、图像监控管理系统-parking fees Systems platform GPS/GSM vehicle control and command system for dispatching mobile communications network traffic management system of long-range wireless communications video, image monitoring and management system

后台管理部份： 商店图书管理：添加，修改，删除，查看。 用户信息管理：查看，修改，删除。 订单信息管理：查看订单清单，更新订单付款，出货状态。删除订单。-management background part : stores library management : add, modify, delete, check. Users Information Management : View, modify, delete. Orders for information management : View a list of orders, updating of payment orders, shipping status. Delete orders.

ccna 网络的教程 中文教程 ccna 的初级教程-CCNA Network Chinese Tutorial Tutorial Tutorial CCNA junior

Aplikasi untuk 系统 pengambilan keputusan 系统 persedian obat 帕达 sebuah 东光通过 menggunakan 语 pemrograman 视觉基本 6.0

圣安德鲁斯大学 lan sommerville著 机械工业出版社出版 软件工程 中文版电子书-University of St Andrews lan sommerville the Mechanical Industry Publishing Software Engineering Chinese e-books

Altera Quartus Ii 7.2 实用指南-Altera Quartus Ii 7.2 实用??南

The Finite Difference Time Domain Method for Electromagnetics With MATLAB Simulations Atef Elsherbeni and Veysel Demir Chapter 6

CH372调试程序,软件代码及编译好的执行程序-USB debugging procedures, software and compiled code enforcement procedures

求迷宫中从入口到出口的所有路径是一个经典的程序设计问题。由于计算机解迷宫室，通常用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向在继续探索，直到所有可能的通路都探索到为止。为了保证在任何位置上都能沿原路返回，显然需要用一个后进先出的结构来保存从入口到当前位置的路径。因此，在球迷宫通路的算法中应用“栈”也就是自然而然的事了。 -seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past.