学生成绩管理系统（无文件版）

c调用sqlite的完整的程序，对学习sqlite很有帮助-c call sqlite complete the procedure, very helpful in learning sqlite

用线性表实现四则运算，很好的一个版本，老师给了满分-achieve linear Table 4 operation, a very good version, the teacher gave full marks

哈夫曼树的建立,haffman 编码,在turbo c 下运行-Huffman Tree, haffman encoding, turbo c in the run

通过使用dbms_sql包程序创建表实例创建动态使用程序表 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

/*--------------------------------------------------------------------------------------------------

管理员：在此系统中只有一个管理员，即系统管理员。具有一般用户所没有的权限，即具有管理一般用户、试题管理功能。 管理员可以向题库中添加各种类型且符合要求的试题，也可以对它们进行修改和删除。同时，管理员也能对科目、用户、考试记录等数据进行管理。 试题管理-Manager: In this system there is only one administrator, that is, the system administrator. General users do not have permission, that is, with the management of general users, test management capabilities. Administrators can add to the questions of all types and meet the requirements of the test, can also modify and delete them. At the same time, administrators can also subjects the user, the examination of data records management. Test Management

用DELPHI编写的学生管理信息系统，可以实现基本的信息功能。是编来用来交作业的。-used to prepare students Delphi management information system that can achieve basic information functions. To be allocated to the perpendicular operation.

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

这是一个 java 文件来连接到 MONGODB 数据库适合初学者。MongoDB 支持 Map Reduce 和分片为了获得最佳性能。MongoDB 用于大数据

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co