DE.python

ACCESS常用窗体查询，例举多种窗体查询的方法-ACCESS commonly used form inquiry, examples of a variety of form queries

本软件实现对数据进行高级加密,值得一看,不可错过.-the right software for advanced data encryption, an eye-catcher, not to be missed.

淘来的卖否官方源码ecshop多用户版开店平台，有能力的测试一下，应该是数据库问题.-Amoy years of selling any official source ecshop shop platform for multi-user version, the ability of the test should be a database problem.

this is my data structure homework2

MySQL 数据访问 ComponentsMySQL 数据访问组件 (MyDAC) 是一种组件库，从 Delphi、 C + + 生成器、 拉撒路 （和自由 pascal 语言） 提供对 MySQL 的直接访问 Windows、 Linux、 Mac OS X、 Android、 iOS FreeBSD 在 32 位和 64 位平台。基于 MyDAC 的应用程序可以直接连接到 MySQL 服务器，或通过 MySQL 客户端库的工作。MyDAC 旨在帮助开发更快和更清洁的 MySQL 数据库应用程序的程序员。

使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。 具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence

遍里数据库集合里的数据-times database, the data pool

1． 问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2． 基本要求将马随机放在国际象棋8*8棋盘的某个方格中，马按走棋规则进行移动。编制非递归程序，求出马的行走路线，将数字1，2，3，4，…，64依次填入一个8*8方阵。-1. Problem description design of a chess board Ma travels in the demonstration program. 2. Ma basic requirements on random chess 8* 8 chessboard in a box, according to Ma go mobile chess rules. Preparation of non- recursive procedure, and seeking stepped routes, the number 1,2,3,4 ..., 64 were filled an 8* 8 matrix.

数据结构上让我们编写的排序算法，有冒泡，堆排序等-Data structure so that we prepared on sorting algorithms, there are bubble, heap sort, etc.