数据结构中的八皇后问题

企业客户关系管理系统-Enterprise Customer Relationship Management System

跟着鼠标转的眼睛控-with eyes turned to the mouse control

sql server 数据库结构查看程序.rar-sql server database structure viewer. Rar

超市或杂货店，自助服务商店提供种类繁多的食品和家用商品，组织到各部门。

这是一个用txt文本实现数据库功能的小软件,具备新建,查询,修改等数据库基本功能,这对没有数据库的朋友是个不错的选择-This is a text with txt database functions realize a small software, with new, query, modify the basic functions such as database, which does not have the database of friends are a good choice

定义一个栈，并实现栈的基本操作： void Push( const T& x) // bool Pop(T& x) // bool getTop(T& x) const // ostream& operater

这是一个程序集级程序，以接收来自另一个 microcrontroller 的并行端口数据。它储存在暂存器。这些数据是时间标记和中继到 PC 串行端口上。该代码使用中断使并行处理成为可能。已测试和用于应用程序的代码。此代码将讨论两个主要 issues:(a) 时间 tagging(b) 平行于串行转换。

区位码转换软件，可以查询汉字的区位码，主要用于学生考试系统-Area code conversion software, you can check area code of Chinese characters mainly used for student examination system

数据结构实验，内部排序的源码及实验报告！-Experimental data structure, the internal ranking of the report source and experimental!

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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