C语言 优先权问题

ncurses-5.4 需要的就来下把 一定会有用的哦-ncurses-5.4 needed on to the next will be used to Oh

作业等待算法：分别采用先来先服务（FCFS），最短作业优先（SJF）、响应比高者优先（HRN）的调度算法。-FCFS.SJF.HRRN

线程同步机制。 互斥器的功能和临界区域很相似。区别是：Mutex所花费的时间比Critical Section多的多，但是Mutex是核心对象(Event、Semaphore也是)，可以跨进程使用，而且等待一个被锁住的Mutex可以设定TIMEOUT，不会像Critical Section那样无法得知临界区域的情况，而一直死等。-Thread synchronization mechanism. Mutex" s function and the critical region is very similar. The difference is: Mutex spent more time than the multi-Critical Section, but the Mutex is the core object (Event, Semaphore is), you can cross-process use, and has been locked waiting for a Mutex can be set to TIMEOUT, not as Critical Section did not know the critical situation in the region, for so long and so die.

一个minigui的程序，单击可以改变对话框 改变按钮颜色

一款小仿真软件，我在开发的机器人控制软件-A small simulation software, in the development of robot control software

采用银行家算法实现死锁的避免-bankers algorithm used to avoid deadlock

这是实现操作系统交通灯调度问题，里面不是很好，希望大家提出宝贵的意见-This is the realization of operating system scheduling problem of traffic lights, which is not very good, hope that the valuable advice

模拟内存管理系统-memory management system simulation

操作系统中的经典问题：银行家算法 - In operating system classical question: Banker algorithm

国外的-C++ 200多个源码-foreign-C more than 200 FOSS