Nucleus PLUS参考手册

免费dos操作系统-Free dos operating system

哲学家进餐问题Java版-dining philosophers problem Java version

哈夫曼编码的实现，用C++编写的。操作系统课设时做的，可以正确的运行-Huffman encoding implementation, using C++ prepared. When the operating system to do for the class, you can run the right

系统启动时检测内存状况的软件C代码，程度有点深，具备了C高级编程知识的朋友们可以参考研习。-Boot time memory status detection software C code, the degree of bit depth, with a high-level programming knowledge of C friends can refer to the study.

Probe PCI devices, and compare information with standard file

操作系统课程设计。包括了源码跟任务报告书。-Operating system, curriculum design. Includes the source code with the mission report.

RTX实时操作系统的内核演示,MDK环境，还不错的。-RTX realtime OS kernel mammual.

this is aes algorithm

注意: 1. OS.jar为Java打包可执行文件 2. 由于时间,和界面空间问题,每个进程的资源拥有情况没有详细列明.如果要认真检查 程序的正确性,可以重新编译运行,然后查看Dos界 面下的输出.因为Dos界面下会输出 每个进程的资源情况(包括每个进程对每类资源的最大需求,分配情况,和所欠资源情况. 3. 资源设置中,进程设置应小于100个,资源类数应小于20个.-attention : 1. OS.jar Java package for two executable files. Due to the time and space interface, each process of the availability of resources, no details. If we were to check the correctness of procedures can recompile running, and then checking Dos interface output . because Dos output interface will process each of the resources (including each process for each category of the biggest resources demand, distribution, and outstanding resources. 3. resources set up, the process set up should be less than 100, the resource shall be less than 20.

1) 设计下沙校园平面图，在校园景点选10个左右景点。以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 2) 为来访客人提供图中任意景点相关信息的查询。 3) 为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 -1) Design Xiasha campus plan, in campus election spots around 10 spots. Vertex in order to express in various spots on campus, storage spots name, code, briefings and other information to express the path edge, storage path length and other relevant information. 2) for the visitors to provide map information on any attractions inquiries. 3) To provide visitors attractions arbitrary query to ask the way, that is, queries between any two spots of a shortest path.