linux内核启动描述，很详细的启动过程描述，是linux培训材料的一部分。

Linux下实现的socket通信， 建有客户端和服务器端 简单适合初学习使用-Linux under the socket communications, built client and server for the beginning of learning to use simple

在Linux环境下，用C语言实现哲学家进程问题。-the Linux environment, using C language philosopher process.

清华大学－电子信息工程系－实验用ARM-linux－源代码－CLOCK篇-Tsinghua University- Electronic Information Engineering- experiment with ARM-linux-source code-CLOCK articles

qt 一个联系pthread 使用的例子 简单易懂-qt a link pthread examples of the use of easy-to-read

任意的触摸屏可用的驱动，在LINUX下实现-arbitrary Touchscreen available drivers in the under LINUX

avifile-1.6.tar.bz2.raravifile-1.6.tar.bz2.rar

完成ls的如下功能 不带参数的ls：列出当前目录下的非隐藏（文件和目录名不以.开头）的文件和目录 ls -a：列出当前目录下的所有文件和目录 ls -l：以长列表形式列出当前目录下的非隐藏的文件和目录。每个文件或目录只要求列出如下信息：类型与权限、文件名、链接数、用户ID、组ID、字节大小、块数 ls 路径名：如果路径名代表一个存在的文件则显示该文件，否则提示出错；如果路径名字代表一个存在的目录则列出该目录中的文件 列出文件名和目录名时，要求可执行文件最后加上一个*号，目录名最后加上一个/号。 所提供的路径名可以包含“.”，“..”，“~”等特殊目录-completion of the following non-functional parameters of ls : listed in the current directory-hidden (files and directories were not. Beginning) of files and directories ls-a : listed in the current directory of all files and directories ls-l : in the long list of current directory listed under the non-hidden possession of files and directories. Each file or directory only asked to list the following information : the type and competence, file name, number of links, the user ID and group ID, byte size, a few blocks ls path : If a path representatives of the document showed documents suggest otherwise error; If representatives of a path name the presence of the directory lists the directory lists the

RoboCup 2005 2D仿真 Brainstormers队 源代码-Brainstormers Source2005

cirrus公司生产的以太网控制芯片cs8900的uclinux驱动.-CIRRUS company"s Ethernet controller chip cs8900 the Basis drive.

本代码是基于LINUX系统下的，实现企业内部员工间通信的客服端代码部分。可以完成文件传输及集体会议等。已通过测试，代码完全无误。-The code is based on LINUX systems, the achievement of internal staff communication part of the customer service side code. File transfer to be completed and collective meetings. Has been tested to be completely correct code.