C_CAB.zip 是一个C写的查看CAB文件的例子，并可以提取CAB中的文件...

〈EVC高级编程及其应用开发（Embedded Visual C++嵌入式编程）〉书上的源代码 全书共分13章，分别为WinCE及EVC概述、图形编程、对话框控件、进程、线程、文件和注册表、WinCE基础数据库编程、WinCE扩展数据库编程、通讯编程、UDP和PING编程、TCP编程、DLL编程以及COM编程。读者在具有一定C抖和WinCE知识的基础上，通过本书的学习，可以快速提高WinCE的编程能力和实际开发水平。- book on the source code book is divided into 13 chapters, each of WinCE and EVC outlined, graphics programming, dialog controls, processes, threads, documents and the registry, WinCE based database programming, WinCE expanded database programming, communications programming, and PING programming UDP, TCP programming, programming and COM DLL programming. Readers with certain C jerk and WinCE knowledge, based on the book learning, can rapidly improve WinCE programming capacity and the actual level of development.

this article is to understand how to monitor a group of Linked SQL Servers from a SQL Server

在程序中再运行一个exe-the process re-running a exe

使用c++描述,创建一个链表,并在中实现节点的插入,删除-Use c++ Description, create a linked list, and realize in the node insert, delete

一个简单的图片文件查看器，能够浏览bmp文件格式，通过此程序，学习一下基本的vc.-A simple image file viewer, bmp file format can browse through this process, learning about basic vc.

三星S3C2440A ARM CPU bootloader源码,基于WINCE5.0平台,初始化硬件,引导操作系统,管理内存.-Samsung S3C2440A ARM CPU bootloader source, based on the WINCE5.0 platform, to initialize the hardware, boot operating systems, memory management.

wtl帮助源代码,一个决好的程序请下载谢谢使用-wtl helping source code,this is a splendid programme.Please download it.Thank you for using it.

比 Windows 自带的高级一点的计算器，能将整个表达式输入，然后求值。这个程序要求读者具备编译原理的一些知识-than Windows, bringing their senior point calculators, the entire expression input, and then evaluated. This procedure requires the reader has compiled some of the principles of knowledge

C： UsersWidmaier SANONDesktopcomboboxEX4Win32Debug

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!