获得存储过程的数据集

OLEDB进行数据通讯,应用ATL进行程序编写,具有借鉴意义-OLEDB for data communications, application procedures to the preparation of ATL, with reference

我自己写的一个解决约瑟夫环的小程序，对学习数据结构的朋友可能有一些帮助,tc2编译通过-I wrote it myself a solution Josephus small procedures, the data structure of the study may have some friends help compile indexes

可实现科研信息管理系统的功能,有项目管理,教师管理,科研项目管理等多项内容-Research and information management can realize the function of the system, have project management, teacher management, research management, and so a number of content

根据广义表创建一棵二叉树，然后中序线索化，再遍历。-Create a table based on generalized binary tree, and then in the sequence of clues, and then traverse.

人事工资管理系统是非常通用的管理信息系统，是企事业单位实现办公自动化的前提和基础。 后台数据库使用SQL Server，前台开发工具使用Visual C++。 本系统采用目前比较流行的ADO数据访问技术，并将每个数据库表的字段和操作封装到类中，从而成功地将面向对象的程序设计思想应用到数据库应用程序设计中。这也是本系统的特色和优势

VB6与三菱FX PLC 编程口通讯（遍历读FX-PLC的映象区）字号 操作状态CommExit: 0通讯进行状态,通讯被打断 通讯状态CommEnd:开始发送和等待接收,>1:接收串已结束-VB6 with Mitsubishi FX PLC Programming mouth communications (FX-PLC read traversal of the image area) to operate a state-established CommExit: 0 communication status, communication was interrupted communication state CommEnd: to start to send and waiting to receive,

这是由DELPHI7.0开发的一个商品销售系统，里面有齐全的源代码-This is DELPHI7.0 developed a merchandising system, which has complete source code

数据结构中的排序算法的比较-data structure of the algorithm comparison

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

测试各种排序算法,使用VC.NET进行开发，如果有任何问题请发邮件给我-test algorithm, using VC.NET develop, if there is any question, please send an email to