搜索资源列表
lift
- 本程序用为数据结构课程设计中的电梯模拟程序，编写时考虑周到，在满足题目的基本要求下，功能更为完善 PS：内附详解报告，解释流程，原理及用法-Used as a data structure of the program curriculum design in the elevator simulation program to consider thoughtful preparation, to meet the basic requirements of the subject, th
library-management
- 本程序用C语言编写，为数据结构课程设计中的图书馆管理系统程序，编写时考虑周到，在满足题目的基本要求下，功能更为完善 PS：内附详解报告，解释流程，原理及用法-This procedure using C language, data structure, curriculum design for the library management system in the process, the time of writing thoughtful, to meet the basic re
Lecture-of-Dynamic-Programming-(DP)
- 上算法设计课课同学自己准备的讲座，ppt通过举例详细介绍了动态规划的原理，并附有实现源码与测试数据-Division on the algorithm design students prepare their own lectures, ppt described in detail by way of example the principles of dynamic programming, together with source code and test data to achiev
Quicksort_ppt_and_src
- 清华算法课同学课堂上做的讲座，ppt详细讲解了快速排序的原理和算法，cpp文件时详细的算法实现，并附有自己写的随机数据文件生成器-Tsinghua algorithm class students do in class lecture, ppt explained in detail the principles and algorithms quicksort, cpp file, the algorithm in detail, together with random data file
JH-algorithm
- 本文首先详细的描述了JH算法的原理，然后对JH实现软件的目标、运行环境和功能做一个整体的规划。接下来介绍软件各功能模块的具体设计步骤。最后测试软件是否能正常运行，确保软件能完成相关的功能，并不断的对软件进行完善。-This paper describes in detail the principles JH algorithm, then the goal of JH for software, operating environment and function to do a whole
shujujiegou-yu-suanfafenxi-java-ban
- 数据结构与算法分析java版是纯英文版，有英语基础的应该能看的懂，其中的属于可以在线查阅，基本原理与C版的一样。-Data structures and algorithm analysis java version is pure English, English-based should be able to see to understand, which is available online, the basic principles and C versions of the sam
Huffman
- 霍夫曼编码实验报告，内含源代码，编码原理 -Huffman coding lab report, containing the source code, coding theory
page
- 操作系统原理，实现页面置换的几个基本算法，包括OPT，FIFO，LRU置换算法。-Operating System Principles, page replacement to achieve a few basic algorithms, including OPT, FIFO, LRU replacement algorithm.
sytax_analyse
- 编译原理，递归下降语法分析。可以解析算术表达式。可以参考下。-Compiler theory, recursive descent parsing. Arithmetic expressions can be resolved. Can refer.
hannuota
- 经典汉诺塔设计论文，详细的阐述了汉诺塔的程序设计原理-Tower of Hanoi classic design papers, detailed descr iption of the Tower of Hanoi programming principles
data-structure
- 数据结构（C语言描述） 详细讲解数据结构的实现过程原理，另有源码例程-Present commonly used data structure. Introduce the idea of tradeoff(折中) reinforce the concept of costs and benefits associated with every data structure. Measure the effectiveness of a data structure or algo
4
- 编程实现银行家算法 通过实例模拟银行家算法实现死锁预防。 掌握银行家算法实现死锁预防的原理 要求：输入实例，能够使用银行家算法判断资源分配后是否存在安全序列。 -Programming by example simulation banker bankers algorithm deadlock prevention algorithm. Master bankers, deadlock prevention algorithm principle requirements: i
7
- 编程实现SSTF算法和SCAN算法 掌握SSTF算法和SCAN算法的原理，并编程实现-Programming algorithm SSTF and SCAN algorithms SSTF and SCAN algorithms to master the principles of algorithm and programming
CRC32
- 数据结构算法:CRC32算法实现原理 简而言之，CRC是一个数值。该数值被用于校验数据的正确性。CRC数值简单地说就是通过让你需要做处理的数据除以一个常数而得到的余数。 -Data structure algorithms: CRC32 algorithm theory short, CRC is a value. This value is used to verify the accuracy of the data. CRC value is simply handled by h
shujujiegou
- 介绍了数据结构的基本原理 已经在C环境下的编程 源码都能用-Introduces the basic principles of data structures have been programming in C source environment can be used
huffman4
- 霍夫曼压缩程序，内建霍夫曼树，利于初学者掌握压缩的原理-Huffman compression procedure, built-in Huffman tree, which will help beginners to master the principles of compression
lianbiaoOrder
- 链表，实现链表的建立，利用冒泡原理进行排序，然后输出-List，and Order then output
NetSimulator
- 本课题假设ti为广播基站数据包(单位数据包大小为512bits)的发布时刻，令发布时间间隔Xi = ti - ti-1 (i=0, 1, 2, …)，t0 = 0，则任意Xi满足负指数分布： p{Xi ≥ t} = p0(t) = , t ≥ 0 或者 p{Xi < t} = 1-p0(t) =1- , t ≥ 0 该负指数分布的广播包发布时间间隔的均值为1/λ。 假设处理一个数据包的时间为0.05s，令λ分别等于5Kbps和1Kbps时，在100s时间内，求出数据包的平均队长
Huffman
- 中国海洋大学 数据结构课程设计课题本人作品,利用哈弗曼编码原理实现对ascii字符文本文件的压缩与解压处理.压缩率为58 -60 .-Ocean University of China data structures course design project I work, the use of Hafu Man coding theory to achieve the ascii characters of the text file compression and decompressio
migong
- 迷宫求解问题是数据结构中的经典问题，利用栈的原理。-maze problem