资源列表
tsjyxt
- 图书借阅系统 1. 每本书有书号、书名和作者姓名； 2. 读者有借书证号、读者姓名、最大借阅量； 3. 能提供若干本书由读者进行选择，打印出读者的借书情况 4. 图书和读者信息应保存在相应的文件中便于查询和借阅。 -Lending Library System 1. Every book ISBN, title and author' s name 2. Readers No. library, readers name, the largest volume of
dtmlcx
- 模拟程序包括一个时钟，每天从零开始。模拟程序得调度器组件随机设置每一层第一个人到来的时间，当时钟的时间等于第一个人到来的时间时，模拟程序生成一个新到的人将该人放到这一层。然后这个人按下按钮，请求电梯开门。这个人的目的地楼层不能与他上电梯的楼层相同。 -Simulation program includes a clock, every day from scratch. Simulation program was set up scheduling of each component la
car-parking
- 该程序主要实现停车场的模拟管理。总共使用了一个队列俩个堆栈。其中一个堆栈用来描述停车场，另一个堆栈是一个临时堆栈，用于存放从停车场出场的汽车。队列用于存放在便道等候入场停车的车辆。-this program mainly used for simulating car-parking.there are two stacks and a queue.the first stack used for the park,the second is used to park cars for temp
TreeTraverse
- 二叉树的遍历操作，树结构用二叉链表存储，遍历时采用递归先序 中序 后序，层次遍历和非递归先序 中序 后序遍历-Binary tree traversal operations, binary tree structure list with storage, the use of recursive traversal sequence in the sequence after the first sequence, level and non-recursive traversal sequ
josph
- 约瑟夫环问题，采用不带头结点的单链表，进行操作-Joseph Central problem, do not take the lead in adopting single-linked list node, to operate
Sort
- 运用直接插入法或快速排序法对程序产生的正序、逆序或随机的序列进行排序-use DirectSort of QuickSort to sort the sequnce produced by the process, which is positive sequence, reverse sequence or random order
tongyansipanbie
- 实现同言式的判别。数据结构习题集作业。输入表达式，判别它是否为同言式，能给出详细的真值表！-Made to achieve the same type of discrimination. Exercises set data structure operations. Enter the expression, determine whether it is made for the same type, can give detailed truth table!
bank1
- 经典的银行家算法。能对进程进行分析，找到安全序列。-Classic banker' s algorithm. Analysis of the process to find a safe sequence.
Graph
- 依靠链表结构实现的图像(Graph)类抽象数据结构-graph ADT implemented by an Adjacency List structure
PatternMatching
- implement a number of pattern-matching algorithms and to carry out an analysis of their operation
RoutingSystem
- The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as ed