在SQL archivosdedatos

企业管理系统,包括工资人事等.基于VB 设计-Enterprise Management System

采用来唯一地确定每一个非零元素，其中row、col、value分别表示非零元素在矩阵中的的行 下标、列下表和值。各数组元素的三元组按在原矩阵中的位置以行优先的顺序依次存放。在稀疏矩阵的十字链表 表示中，矩阵的的每一行设置为一个带附加头结点的循环行链表，每一列也设置为一个带附加头结点的循环列链 表。基于三元组及十字链表的稀疏矩阵乘法

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

使用ADO Reviewed版本1.1.0创建Access 2000数据库！

实用数据结构教程,让你学习数据结构不用愁,呵呵!希望这对你有用,能帮上一点忙!-Practical Guide data structure, so you learn not worry about data structures, Oh! Hope this useful to you, we can help!

严蔚敏编写的《数据结构》第6章的答案，全部为源码-the answers of chapter 6 of a book called ‘Data Structures’ writen by Yan Wei Min

表达式求值，包括栈的读写，创建，释放，可以求借一般四则运算，带括号等-expression evaluates, including stacks of reading and writing, to create, release and should seek through four general computing, with brackets, etc.

Oracle TimesTen C 开发人员和参考指南，是从厂家培训老师手上拷贝过来的，关于内存数据库的开发指南。-Oracle TimesTen C Developer" s and Reference Guide, training of teachers from the hands of manufacturers copied on the development of guidelines memory database.

这是一个不错的数据库管理程序-This is a good database management procedures

前一阵出去玩了，补回还差的2个，里面包括上次上载的一共5个，另加个汇编程序，是课堂实验-play out a little while ago, to compensate for the worse two, including the inside on the last of a total of five, plus a 000 assembler, a classroom experiment