登录
首页 » Visual C++ » fptree

fptree

于 2008-02-23 发布 文件大小:1761KB
0 193
下载积分: 1 下载次数: 455

代码说明:

  FP-growth算法的改进C++程序,具有较好的扩展性和应用性,本程序改成用行读取,然后在内存中解析。更有效的方式是采用块读取方式(本人在以前项目中验证过,速度大为提高。)(FP-growth algorithm C++ Procedures, have good scalability and application, the procedure changed to use line to read, and then resolve in memory. More effective approach is the use of block-read mode (I tested before the project, speed greatly improved.))

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Segment_Page_SMS
    操作系统的课程设计,段页式存储管理,visual studio 2008,mfc(Operating systems curriculum design, storage management section page, visual studio 2008, mfc)
    2021-01-08 15:08:52下载
    积分:1
  • yinhangjiasuanfa
    这是我做的操作系统里面的银行家算法的源程序,发上来供大家参考。(caozuoxitongyinhangjiasuanfa)
    2009-05-22 23:40:08下载
    积分:1
  • fptree
    FP-growth算法的改进C++程序,具有较好的扩展性和应用性,本程序改成用行读取,然后在内存中解析。更有效的方式是采用块读取方式(本人在以前项目中验证过,速度大为提高。)(FP-growth algorithm C++ Procedures, have good scalability and application, the procedure changed to use line to read, and then resolve in memory. More effective approach is the use of block-read mode (I tested before the project, speed greatly improved.))
    2008-02-23 11:36:19下载
    积分:1
  • code
    哈夫曼编码和解码 LRU算法模拟 银行家算法模拟 页面地址重定位模拟 进程调度模拟 FIFO算法模拟(Huffman encoding and decoding algorithm simulates LRU algorithm simulation banker page address relocation simulation process scheduling simulation algorithm FIFO simulation)
    2017-02-03 09:11:55下载
    积分:1
  • dos
    一个虚拟DOS操作界面的小系统,一共有9条命令,可以在里面增加命令实现更多功能。(A virtual DOS interface small system, a total of 9 orders, which increased in order to achieve more.)
    2007-12-16 16:15:20下载
    积分:1
  • Bankers-algorithm-simulation
    银行家算法模拟,适用于计算机操作系统课程设计的银行家算法的实现。(Bankers algorithm simulation for realization of computer courses on operating system design bankers algorithm.)
    2015-12-14 13:34:41下载
    积分:1
  • 4
    说明:  这是一个操作系统中关于调度问题中的先来先服务调度算法。(This is an operating system on the scheduling of a first-come first-served scheduling.)
    2011-06-19 22:42:58下载
    积分:1
  • OS
    说明:  这是操作系统中调度算法中时间片轮转算法完成后的实践报告(This is the operating system scheduling algorithm in the time slice cycle after the completion of practice report)
    2010-09-06 10:48:24下载
    积分:1
  • process_attemper
    1、 :编写并调试一个模拟的进程调度程序,采用“最高优先数优先”调度算法对进程进行调度。 “最高优先数优先调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。尝试静态优先数与动态优先数两种方法: a) 静态优先数是指优先数在整个进程运行期间不再改变。优先数可以在数据输入时指定,也可以根据到达顺序、运行时间确定。 b) 动态优先数是指进程的优先数在创建进程时可以给定一个初始值,并且可以按一定原则修改优先数。例如进程获得一次CPU后就将其优先数减少1。或者进程等待的时间超过某一时限时增加其优先数的值。 2、 编写并调试一个模拟的进程调度程序,模拟实现多级反馈队列调度算法。 3、 编写并调试一个模拟的进程调度程序,模拟实现最低松弛度优先算法。 4、 程序与报告要求: a) 对上述要求1、2、3,至少要完成一项,鼓励尝试多种算法。 b) 输出结果要尽量详细清晰,能够反映调度后队列变化,PCB内部变化。 c) 可以选择在Windows或Linux环境下编写、运行程序 d) 鼓励使用不同的开发工具在不同平台环境上进行开发比较。 e) 在实验报告中,一方面可以对实验结果进行分析,一方面可以对各种算法进行比较,分析它们的优劣,说明各种算法适用于哪些情况下的调度。 (1 : Prepare a simulation and debugging process scheduling procedures, "Priority number of the highest priority" to the process of scheduling algorithms for scheduling. "Highest priority priority scheduling algorithm for the basic idea is to place the CPU allocated to the priority queue highest process. Taste Examination several static and dynamic priority priority number two methods : a) static priority number is priority number in operation during the entire process will not change. priority number in the designated input data, can be reached under the order, running time determine. b) dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number.)
    2007-07-04 12:57:51下载
    积分:1
  • writerandreader
    计科操作系统课程“读者写者”问题的经典解决。(Branch of the operating system programs, " wrote the reader" as a problem to solve classic.)
    2009-05-13 15:29:02下载
    积分:1
  • 696518资源总数
  • 105714会员总数
  • 27今日下载