Symbian OS Socket任务管理器服务器源代码 可以学习一下

How to call some functions that you might though it is simle sometimes, but it could take your worthful time. Try these short routes as fun whenever you take a break. -How to call some functions that you might though it is simle sometimes, but it could take your worthful time. Try these short routes as fun whenever you take a break.

该库为德州仪器msp430系列单片机spi库。你可以用这个库处理spi通信。

基于vc++的有关摄影测量中近似垂直摄影情况下空中后方交会求解的源代码-based on the photographic measurement of the approximate vertical aerial photography Resection Solving the source code

使用C语言实现类似黑-客帝国的字符雨效果，十分华丽。使用C语言实现字符雨效果。

俄罗斯方块源程序 玩过俄罗斯方块的，都知道-Russian box source played the Russian box, we would have known

进一个培训机构后提供的c语言的PPT培训教材。。。对想学习C语言的朋友很有用-Into a training institutions to provide the c language PPT training materials. . . To want to learn C language is useful friends

LabVIEW（Laboratory Virtual Instrumentation Engineering Workbench，实验室虚拟仪器工程平台）是由美国国家仪器公司所开发的图形化程序编译平台，发明者为杰夫·考度斯基（Jeff Kodosky），程序最初于1986年在苹果电脑上发表。目前可支持Windows，UNIX，Linux，Mac OS等操作系统。由于LabVIEW特殊的图形程序简单易懂的开发接口，缩短了开发原型的速度以及方便日后的软件维护，因此逐渐受到系统开发及研究人员的喜爱。初学labVIEW，自己制作的上位机，互相学习！！！

MATLAB，即“矩阵实验室”，它是以矩阵为基本运算单元。因此，从最基本的运算单元出发，介绍MATLAB的命令及其用法2。-MATLAB, "Matrix lab," It was based on the matrix of the basic computing unit. Therefore, from the most basic computing element is introduced, and MATLAB ordered two of its use.

一java的小应用程序，在游戏中，用户随意抽出四张扑克牌，用加减乘除的方法将它们连接起来，使得结果等于24。-a small application, in a game in which users randomly picked four cards using the arithmetic method of connecting them, making the results mean 24.

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins