No self-introduction
Loading
Profile
Follow
codes (9)
Operating system job scheduling experiment (c lang
no vote
This program is mainly a single batch job scheduling system simulation program, job scheduling algorithms are mainly first-come, first-served (FCFS), shortest job first (SJF), responding to high priority (HRN) scheduling algorithm. The main procedures for all three algorithms, and program details are given in the code comments, to deepen their understanding of job scheduling algorithm
鱼儿yu_fish 0 0
1
Process scheduling experiment (c language)
no vote
Read and debug of a "highest-priority priority" scheduling schedule the six processes simulation program. Through this program, read, we can deepen understanding of process concepts and process scheduling algorithm. Process scheduling algorithm focuses on the master priority algorithm Youxian () and Rotary RoundRobin algorithm (). Priority algorithm consists of static priority algorithm with dynamic priority algorithm. This program priority call algorithm is used. Analysis of specific procedures and requirements can refer to the Lu Lina computer operating system Edition
鱼儿yu_fish 0 0
1
Josef (Joseph)-c language
no vote
Joseph ring problem description is as follows: number 2,n individuals in a clockwise direction around a circle, each person has only one password (a positive integer). Numbered one pick a positive integer as the top 1, starting off, reporting for m people out, his password as the new numbered 1, and so on, until all out so far. Design a program to find the column order.
鱼儿yu_fish 0 0
1
C language implementation of PRIM algorithm
no vote
Primm (Prim) algorithm is a constructive algorithm. Set G= (V,E) is a has n a vertex of with right connected no to figure, T= (U,TE) is g of minimum generated tree, which u is t of vertex set, TE is t of side set, is by g constructed from starting vertex v starting of minimum generated tree t of steps following: (1) initial of U={v}, to v to other vertex of all side for candidate side; (2) repeated following steps (n-1) times, makes other (n-1) a vertex was joined to u in the: A. from candidate side in the pick right value minimum of side joined TE, set the side in V-U in the of vertex is k, will k joined u in the; b. investigation current V-U in the of all vertex j, modify candidate side, if side (k,j) of right value is less than original and vertex j associated of candidate side, is with side (k,j) replaced which as candidate side. This code implements the Prim algorithm. Code to run correctly.
鱼儿yu_fish 1 0
1
Maze to solve the problem in the data structure (u
no vote
Stack is limited only to insert and delete operations in linear form header. Usually requires the use of the stack to convert into a non-recursive algorithm recursive algorithm. This code implements the sequential stack storage structure, to solve the maze problem concretely realized, and the code can be compiled and run correctly.
鱼儿yu_fish 0 0
1
Big game VC source
no vote
"Feeding Frenzy" game is currently very popular in the white-collar workers a casual game, in the seemingly calm ocean, but hidden human world the same crisis, marine life in the jungle of competition, not only was foraging to fill his belly, more important is to learn to protect yourself! In casual while allowing you to understand some of the marine life, but also allow you to master the viability, really serve two purposes. This code is used VC6.0MFC achieve, enabling players in the entertainment while learning the game better design ideas.
鱼儿yu_fish 2 0
1
C language implementation of binary tree
no vote
Each node binary tree is an ordered tree with up to two sub-tree. Binary Tree is often used to implement a binary search tree and binary heap. The code for the binary tree of the C language, the implementation platform for VC6.0.
鱼儿yu_fish 1 0
1
Huffman tree data structures in c language
no vote
Given n weights as a leaf node n, the structure of a binary tree, if the weighted path length to a minimum, saying such a binary tree for optimal binary tree, also known as Huffman (Huffman tree). Huffman tree is the shortest path length weighted trees, larger weights from the root node closer. This code implements the Huffman tree for your reference study.
鱼儿yu_fish 1 0
1
ECC encryption algorithm in C language
4.0
Given the elliptic curve E23 (16,10): y 2 ≡ X3 + 16x + 10mod23 and a point G = (5,10) on it, all times of G are calculated. It is equivalent to realizing the problem with C programming language
鱼儿yu_fish 4 0
1
No more~
Follows0
Fans0