ljsc

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)

说明：  Circle Through Three Points

用冲激响应不变法和双线性变换法设计IIR的MATLAB程序(Design of MATLAB Program for IIR by Impulse response Invariant method and Bilinear Transformation method)

说明：  OPNET 无线仿真 PPT + 源码 好好学习吧(OPNET wireless simulation PPT source code)

磁盘文件系统的模拟,能实现文件的添加,删除,实现多级目录(Disk file system simulation, can realize the file to add, delete, multi-stage directory)

在WINDOWS 9X/NT下不通过WIN DDK而直接存取硬件的专用开发包，支持VISUAL C++和DELPHI/C++ BUILDER，需要32位编译器。TVicPort includes transparent support for Windows 95/98 and Windows NT (in Windows 9X/NT under WIN DDK is not passed directly access dedicated hardware development kits, support Visual C and Delphi/C BUILDER need 32 compiler. TVicPort includes transparent support for Windows 95/98 and Windows NT)

用全选主元法高斯消去法求解线性方程组AX B(A guauss solver for linear system AX B)

利用二维数组创建杨辉三角形，基于vc++程序设计(Creating a Yang Hui triangle by using a two-dimensional array .Programming based on vc++)

hangle unicode used AI

调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)