VC++ 家庭理财软件

Zhejiang University Online Judge 第2277题至第2283题的代码和解题报告-Zhejiang University Online Judge Questions section 2277 to title code 2283 and problem-solving report

抽奖系统使用 miicrosoft 接入，作为后端数据库这是好的项目:) 歉意乱码

数据结构中常用结构的动态演示，可以帮助初学者更好的理解其结构的实现-data structure used dynamic structure of the demonstration, and can help beginners a better understanding of its structure to achieve

query数据库的例子-example database query

了解服务器的内部结构，对LOCK有一个 更高层次的认识。 建议有3年C++编程的朋友参考。-understanding of the internal structure of the server, right LOCK have a higher level of awareness. Proposal 3 years C programming reference to a friend.

关于数据结构的几篇文章-data on the structure of the articles

Delphi编程┃Delphi数据库编程-Delphi programming highlights Delphi Database Programming

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

哈夫曼压缩编码的例子，真的不是平常的课程设计那么垃圾的东东，还是有价值的-haffman compress