online admissions system

完全内核，界面的改变，增加学生统计、 院系、班级等管理功能 　　1.添加单个成绩 　　2.批量添加成绩 　　3.通过搜索并修改与删除 　　4.直接修改 　　5.可以批量删除 　　6.可以直接GO到达你想到达的页 　　7.分页显示 　　8.代码精简 　　9.整合部分重复代码 　　v2.82 build1114版 　　1、增加了Excel名单文件上传、导入功能 　　2、为了正确指定文件上传目录，各文件夹名中不许有字符“.”，故将原命名方式“School V2.82 Build1114”改为“School V282 Build1114”。 -completely kernel, interface changes, the increase in student enrollment statistics, faculty, classes such as a management function. Add two individual achievements. Batch added three results. Search through deletion and modification In addition to four. directly alter five. Batch 6 can be deleted. GO can reach you directly to the arrival of page 7 . Pagination 8. 9 streamlined code. Integration of duplicate code v2.82 build111 4 version of an increased list of Excel file uploads into two functions. , Therefore, the original name means "School V2.82 Build1114" to "School V2 82 Build1114. "

这是一个练习链表的扑克牌程序，可以自动发牌，比较大小。如果想和计算机对战，只需要稍微改动一下程序即可。-This is a practice Chain cards procedures, it will automatically licensing, size comparison. If you want to, and computer war, only slightly modifying procedures.

自己写的，数据结构课程设计，有需要的可以来看看看的，郁闷上传这麻烦-Their written curriculum design data structure, there is a need to look at to see if the can, and depressed From this trouble

随便做做!有哪不足的地方请大家帮我改正!谢谢了啊!-Casually doing! Shortage of places which have requested the U.S. to help me correct! Thank you, ah!

pc游戏编程_人机博弈,算法和实现都比较完整，源码可运行。且可以从中学到很好的算法知识，和人机博弈-pc game programming _ man-machine game, algorithms and realization are relatively complete, source code can run. And can learn a good knowledge of algorithms, and human-computer game

一个基于VC+ACCESS的酒店业务管理系统，内附说明书-a VC-based ACCESS hotel operations management system, enclosing brochures

数据结构各种算法的实现-various data structure of the algorithm to achieve!

清华大学数据结构课上实现的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;

一个教师信息管理的Visual Basic源码-a teacher information management Visual Basic source

这是一个家庭信息管理的小软件！-This is a family of small information management software!