全能探针

模拟分页式存储管理中硬件的地址转换和用先进先出调度算法(FIFO)处理缺页中断-simulation tabbed storage management hardware address translation, and the use of FIFO scheduling algorithm (FIFO) interrupt handling missing pages

本文详细论述了网上考试系统的设计与实现，该系统基本实现了需求分析中的功能要求，其中考生信息主要由数据库直接输入，考生成功登录后进入考生界面，考生界面主要由考试、成绩查询，试时考生输入准考证号码、考生姓名、验证码，核对正确后进入考场，关键实现了考生在选择科目后由系统随机抽题、自动组卷后进入考试页面，考-This article discusses in detail the design of online examination system and implementation of the system to achieve a basic needs analysis of the functional requirements, in which candidates from the database information directly into the main candidates to enter the candidates after the successful login interface, the main candidates from the interface results in the examination information, test when the candidates enter the ticket number, candidate name, authentication code to enter the examination room after checking the correct key to the achievement of the candidates in the selection of subjects were randomly drawn by the system after the title, Automatic Test Paper into test page test

Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm

猴子摘香蕉问题使用C++语言描述，写的不好请大家多提意见！-Monkey mialaw problems using C++ language description, is badly written please speak up!

数据结构的运算方法-data structure computing methods

给定正整数n，计算出n个元素的集合{1,2,?,n}可以划分为多少个不同的非空子集。 由文件input.txt提供输入数据。文件的第1 行是元素个数n。-Given positive integer n, to calculate a collection of n elements (1,2,?, N) can be divided into the number of different nonempty sets. By providing input data file input.txt. Document line 1 is the number of elements n.

转换成汉字大写金额-converted into the amount of Chinese capital

城市之间的最短路径，用于求任意两个城市之间的最短路径-cities in the shortest path for the two cities arbitrary seeking the shortest path between

基于SQL Server数据库和JAVA语言的学生信息管理系统；完整源代码，JAVA语言实现，NetBeans开发环境，可以导入Eclipse

它是在 c + + 中的 b + 树实现，是用来查找、 插入和一次晚点的节点，并且我们可以创建到使用的虚拟磁盘