资源列表
Josephus-Problem
- 约瑟夫问题的链表实现，包含源代码（c语言实现）-solve of Josephus Problem
baoshu
- 报数问题。n个人围成一圈，1，2，3循环报数，报到3的人退出。到最后只余1人，输出最后留下的是第几号（最初的序号，以1起始）。压缩包内共三种方法。-Reported several problems. n personal circle, 1,2,3 newspaper circulation numbers, to report three people quit. To the final with only one person, the output of the last to lea
Bankers-algorithm
- 计算机操作系统实验。用c++编写的银行家算法程序，内附运行截图。运行时将源程序直接复制粘贴到编译器，保存为.cpp文件即可。-Computer operating system experiment. Written by c++ bankers algorithm, enclosing run shot. Runtime copy and paste the source code to the compiler directly, save it as a. Cpp file.
Splay-for-number-list
- 伸展树Splay在数列处理问题上的应用的教程与源代码，含有pas和cpp。-A director of Splay tree for the usage to solve the problem with number list
The_Magical_Splay
- Splay 伸展树经典教程，含有论文和源代码。ACM金牌必备。-A Splay tree director for ACMer who wants to get a medal,include PDF and souce code
4zhongyemiandiaodusuanfa
- 基于一个虚拟存储区和内存工作区，设计下述算法并计算访问命中率。 1、最佳淘汰算法（OPT） 2、先进先出的算法（FIFO） 3、最近最久未使用算法（LRU） 4、简单时钟(钟表)算法（CLOCK） 命中率＝１－页面失效次数／页地址流(序列)长度 -Based on a virtual memory storage area and work area, the following algorithm design and calculate the h
yemiandiaodusuanfa
- 3种页面置换调度算法 先进先出(FIFO) 最近久未使用(LRU) 最佳（OPT）置换算法-Three kinds FIFO page replacement scheduling algorithms (FIFO) recent lack of use (LRU) Best (OPT) replacement algorithm
Graph-traversal1
- 图的遍历，深度和广度遍历，有详细的代码和截图文件工参考-Graph traversal
rayleigh-channel-QPSK
- 本程序是QPSK信号在瑞利衰落信道下的仿真，已经过本人验证，适合初学者-This procedure is QPSK signal simulation in Rayleigh fading channel, I have been verified, suitable for beginners
QPSK
- 信号在高斯信道下的仿真，本人自己编的，已经经过验证是正确的-The simulation signal under the Gauss channel, I own, has been verified to be correct
BPSK2
- 本程序是自己写的，经过验证的，瑞利衰落信道下的BPSK信号仿真-This program is written in their own, after verification, simulation of BPSK signals in Rayleigh fading channels
bpsk1
- 本程序是自己写的，在瑞丽衰落信号下的BPSK仿真，已经经过试验成功-This program is written in their own, in Ruili fading BPSK simulation signal, has been successfully tested