Location:
Search - fork
Search list
Description: C实现二叉排序树的各种算法,了解数据结构中的树。-C fork order to achieve two tree algorithms, understanding of data structure of the trees.
Platform: |
Size: 18973 |
Author: 李海 |
Hits:
Description: 模拟操作系统底层通过管道的文件传送,定义读写缓冲区,编译后,可看到结果-underlying operating system simulation through the pipeline transmission of documents, the definition read and write buffer compiled, we can see the results
Platform: |
Size: 931 |
Author: Wandy_1234 |
Hits:
Description: 这是我的课程设计报告，本来是用VB设计一个界面出来，里面包含多种小游戏的，可惜删了，只剩下一份报告，里面包含了各个小游戏的程序算法代码：回溯法求解皇后问题、冒泡法的算法描述、快速排序法、二叉排序树（这里用C语言描述）、顺序查找算法、二分法查找、二叉排序树查找（这里用C语言描述）-This is my course design, originally designed with VB is an interface, and which contains a variety of small game, but cut, leaving only a report, which contains various small algorithm of the game code : Queen's back method, the algorithm Bubble Description Act, rapid Pai Xu, two fork-tree (here using C language description), the sequence search algorithm dichotomy search, binary tree search ranking (here using C language description)
Platform: |
Size: 13801 |
Author: 天路 |
Hits:
Description: linux 下多进程编程demo,fork的应用-process multiple programming demo, fork Application
Platform: |
Size: 1157 |
Author: 陈全勇 |
Hits:
Description: 浙江大学计算机学院制作的操作系统教学Flash动画，对于理解操作系统中TLB fork mutex 页面分配 银行家算法 等疑难问题有很大帮助。-Zhejiang University computer operating system produced by the Institute of Teaching Flash animation, understanding the operating system TLB fork Mutex pages bankers allocation algorithm difficult issues is very helpful .
Platform: |
Size: 525699 |
Author: 赵杰伊 |
Hits:
Description: 本程序建立N(由系统定义)个节点的2叉排序树，输入要在该树中查找的数值\\n,并返回查找的次数，如果查找失败显示相应的失败信息但是仍然返回次数-procedures for the establishment of the N (defined by the system), two-node fork sort tree input to the tree in search of numerical \\ n, and return to find the number, If you fail a corresponding information but still failed to return to the number
Platform: |
Size: 3382 |
Author: tangliang |
Hits:
Description: 假如所有的哲学家都同时拿起左侧叉子，看到右侧叉子不可用，又都放下左侧叉子，等一会儿，又同时拿起左侧叉子，如此这般，永远重复。对于这种情况，即所有的程序都在无限期地运行，但是都无法取得任何进展，即出现饥饿，所有哲学家都吃不上饭。所以规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是0,1号哲学家竞争0号叉子,2,3号哲学家竞争2号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入等待，当吃完饭的哲学家放下叉子后其他哲学家便可以拿到叉子，因此不会出现饿死的哲学家。-If all philosophers have also picked up the left fork, the right fork to see is not available, they are both down the left fork, wait a little longer, at the same time, pick up the left fork, and so on, never repeat. In this case, all the procedures that are in operation indefinitely, but are unable to make any progress, there is hunger, all philosophers have not afford enough food. Therefore, the provisions of odd philosopher he first took up the left fork, then plain his right fork, and even philosophers, on the contrary. accordingly, will be 0. philosopher competition on the 1st fork 0, 2, on the 3rd philosopher competition on the 2nd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork a
Platform: |
Size: 1597 |
Author: 林茜 |
Hits:
Description: 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子，初使值均为1，表示5把叉子均可以取，设置五个线程代表5个哲学家，其值分别为0～4，规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列，根FIFO原则，则先申请的哲学家会较先可以吃饭，因此不会出现饿死的哲学家。-use threaded program to achieve realization philosophers problem. Installed capacity on behalf of five signal five fork, in early values are one, five fork can take, and set up five representatives of five threads philosopher, the value of 0 to 4, provisions of the odd philosopher he first took up the left fork. then plain his right fork, and even philosophers, on the contrary. accordingly, will be one, on the 2nd philosopher competition on the 1st fork, 3, philosopher competition on the 4th on the 3rd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork and eat. But philosophers are not eligible to enter the queue waiting for obstruction, root FIFO principle, I will apply the first philosop
Platform: |
Size: 1085 |
Author: 林茜 |
Hits:
Description: Openswan is a fork of freeswan.
Platform: |
Size: 3597702 |
Author: goldenxu |
Hits:
Description: Chatroom client using fork
Chatroom client using select
Chatroom server using select-Chatroom client using fork Chatroom clien t using select Chatroom server using select
Platform: |
Size: 4245 |
Author: wwdl |
Hits:
Description: 作者: junglesong
这是我过去进行一个OpenGL项目时使用到的\"三维空间向量/点\"类及相关函数,使用它们可以定义一个空间向量/点,实现向量的平移,缩放和旋转等,使用相关函数还可以实现两向量的叉乘,得到一个向量的绝对长度,将一个向量单位化,得到一个三点决定的平面的垂直向量(经过单位化),得到空间中两点的距离,得到两向量的点积,得到两向量的夹角等操作,为方便用户的使用,每个函数都有详细的注释,特别重要的向量计算如点积,叉乘还有相关说明,希望对大家有所用处.
由于源程序涉及到保密问题不能和盘托出,请见谅.
junglesong@etang.com-Author : junglesong This is my last OpenGL for a project to use the "three-dimensional vector space / point "and related functions, they can use a definition of space vector / points, for the vector translation, zooming and rotation, using correlation function can also achieve two fork by Vector, a vector to be the absolute length of a vector unit, 3:00 been a decision of the vertical plane of Vector (those units), a space to be the distance between two points, Vector to be the two plot points, to be the angle between two vectors such operations, as a user-use, Each function has detailed notes, a particularly important point if the calculation vector plot, fork also took note, we hope to have useful. Due to the confidential source involved in the issue can not completely please b
Platform: |
Size: 3177 |
Author: 黄景天 |
Hits:
Description: 在Linux/Unix平台下，用C语言编写一个进程通信的程序，理解fork()等一些系列系统函数的正确使用和工作原理，学会设计基本的进程通信程序。-in Linux / Unix platform using C language of a process of communication procedures, understanding fork () and some other family functions and the use of the correct principle, learn the basic process design communication program.
Platform: |
Size: 3662 |
Author: xiao ming |
Hits:
Description: double类型的3维矢量运算类库，具有加、减、点积、叉积、除法、取模、单位化功能。
-double types of 3-D vector operation library is, plus or minus, plot points, fork plot, division, from mold, Function units.
Platform: |
Size: 1080 |
Author: 王军安 |
Hits:
Description: Boa是一个非常小巧的Web服务器，可执行代码只有约60KB。它是一个单任务Web服务器，只能依次完成用户的请求，而不会fork出新的进程来处理并发连接请求。但Boa支持CGI，能够为CGI程序fork出一个进程来执行。Boa的设计目标是速度和安全，在其站点公布的性能测试中，Boa的性能要好于Apache服务器。-Boa is a very compact Web server executable code only about 60KB. It is a single task Web server, users can turn to complete the request, and will not fork out the new process to handle concurrent connection request. But Boa support CGI, as a CGI program to fork out a process to implement. Boa the design goals of speed and security, announced at its site performance test, Boa better performance in the Apache server.
Platform: |
Size: 137937 |
Author: 程小培 |
Hits:
Description: 1、 了解系统调用pipe()的功能和实际原理
2、 编写一段程序，使用管道实现父子进程之间的通信
a) 使用系统调用fork()创建一个子进程
b) 子进程调用函数write()向父进程发送自己的进程ID和字符串” s sending a message to parent.\\n”。
c) 父进程调用函数read()通过管道读出子进程发来的消息，将消息输出屏幕，然后终止
-1, the understanding of the system call pipe () function and the principle of two actual preparation of a procedure, Pipeline father used to achieve the process of communication between a) the use of system calls fork () to create a child process b) Import Cheng called function write () to send their parent process ID of the process, and the string "'s sending a m essage to parent. \\ n. " C) the process of the function call father read () through the pipeline read to the child process the news, the news output screen, then terminated
Platform: |
Size: 4476 |
Author: witkey_eagle |
Hits:
Description: 1、 了解系统调用fork()、execl()、exit()、getpid()和waitpid()的功能和实现过程
2、 编写一段程序实现以下功能：
a) 使用系统调用fork()创建两个子进程
b) 父进程重复显示字符串”parent:”，并使用函数getpid()显示自己的进程ID。
c) 两个子进程分别重复显示字符串”child:”，并使用函数getpid()显示自己的进程ID
3、 编写一段程序实现以下功能：
a) 使用系统调用fork()创建一个子进程
b) 子进程显示自己的进程ID和字符串\": The child is calling an exec.\\n\"，然后通过execl()调用系统命令ps显示当前运行的进程情况，从而更换自己的执行代码，最后调用exit()结束。
c) 父进程显示自己的进程ID和字符串” \": The parent is waiting for child to exit.\\n \"，然后调用waitpid()等待子进程结束，并在子进程结束后显示”The parent exit.\\n
-1, the understanding of the system call fork (), execl (), exit (), getpid (), and waitpid () function and process 2, write a procedure to achieve the following functions : a) The use of system calls fork () to create two child process b) the parent process repeated string "parent : ", and the use of function getpid () show their ID process. C) two separate child process repeated string "child :" and the use of function getpid () show their ID 3 process, to prepare a process to achieve the following functions : a) The use of system calls fork () to create a child process b) children show their ID process, and the string " : The child is calling an exec. \\ n " Then execl () call system commands ps shows currently running process, thereby replacing the execution
Platform: |
Size: 8212 |
Author: witkey_eagle |
Hits:
Description: hufferman的算法，构造huffman树二叉排序树，c语言-hufferman the algorithm, two tectonic Huffman tree fork Sort Tree, c Language
Platform: |
Size: 239239 |
Author: 马全 |
Hits:
Description: 在 UNIX 系统中，用户创建一个新进程的过程（调用系统调用 fork）。以及在此过程中可能遇到的问题。-the UNIX system, you can create a new process to the process (called fork system call). In this process, and may encounter problems.
Platform: |
Size: 4029 |
Author: 贾宁 |
Hits:
Description: OCCI STL 在 UNIX 下的应用
fock 应用实例-OCCI STL under UNIX application fock Application
Platform: |
Size: 2065 |
Author: 凌寒 |
Hits:
Description: 叉排序树与平衡二叉排序树基本操作的实现
用二叉链表作存储结构
(1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T；
(2)对二叉排序树T作中序遍历,输出结果；
(3)计算二叉排序树T的平均查找长度,输出结果；
(4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结
点,并作中序遍历(执行操作2)；否则输出信息“无结点x”；
(5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \\ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!" / "NO!" ;
Platform: |
Size: 2028 |
Author: 胡图 |
Hits:
«
1
2
3
4
56
7
8
9
10
...
32
»