Search - 2-3-4 tree

Search - 2-3-4 tree - List

[CSharp] 哈夫曼译码 DL : 0: [基本要求] 一个完整的系统应具有以下功能：（1）I：初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree中。（2）E：编码（Encoding）。利用已建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。（3）D：译码（Decoding）。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。（4）P：印代码文件（Print）。将文件CodeFile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。（5）T：印哈夫曼树（Tree printing）。将已在内存中的哈夫曼树以直观的方式（树或凹入表形式）显示在终端上，同时将此字符形式的哈夫曼树写入文件TreePrint中。 [测试数据] （1）利用下面这道题中的数据调试程序。某系统在通信联络中只可能出现八种字符，其概率分别为0.25，0.29，0.07，0.08，0.14，0.23，0.03，0.11，试设计哈夫曼编码。（2）用下表给出的字符集和频度的实际统计数据建立哈夫曼树，并实现以下报文的编码和译码：“THIS PROGRAM IS MY FAVORITE”。-[basic requirements] a complete system should have the following functions : (a) I : initialization (Initialization). Reading from the terminal into the HKSCS size n, and n n characters and the right value, the establishment of Huffman tree. it will be stored in documents hfmTree China. (2) E : coding (Encoding). Use has completed the Huffman tree (if not memory, from hfmTree document reads), the document ToBeTran the encoded text, and then the results were CodeFile posting documents. (3) D : Decoding (Decoding). The use of the completed document will Huffman tree CodeFile the code decoding, results were deposited documents TextFile. (4) P : India source document (Print). CodeFile of documents to compact format in the end, every line 50 code. While this form of characters encoded files int
Date : 2008-10-13 Size : 60.07kb User : 吕夏琴
[CSharp] huffman_tree(sjjg) DL : 0: 1、根据用户指定的字符表和频度的实际统计数据建立Huffman树； 2、其中其叶子结点表示字符的权值及父母、左、右孩子等结点的信息； 3、其左右分支分别用代码0、1表示； 4、本系统的目的是为用户提供编/译码系统，根据用户输入的字符依字符集的权值进行编码保存； 5、根据接收到的编码进行译码； 6、输出其内容-1, according to user-specified character tables and frequency of the actual statistical data to establish Huffman tree; 2, in which the leaf node of the right to express character and the value of parents, left and right, such as child nodes of information; 3, around its branches were used code 0,1 said; 4, the Department of EC aims to provide users with encoding / decoding system, according to user input according to the characters of the character set weights encode preservation; 5, the received code decoding; 6, the output of its contents
Date : 2008-10-13 Size : 1.96kb User : 陈静
[CSharp] Calendar_xrc DL : 0: 使用Csharp实现的日历程序,功能简介：已完成功能 1.新建当天日记，新建随笔 2.打开日记，打开随笔 3.文件保存 4.树状视图的显示 5.设置字体 6.查看日历： a、新建活动 b、查看活动 c、修改活动 d、删除活动 e、活动提醒 7、日历以类似MSN的好友登录提示的方式来通知用户要做的活动-use the calendar to achieve procedures, functional description : a function has been completed. New day diary two new delegates. Open diary Essays open 3. file 4. Tree View Display 5. 6 fonts installed. View the calendar : a, new activities b, c View activities, modifications of the activities d, e delete activities, activities remind 7. MSN Calendar similar to the Friends of the login prompt users to be done to inform the activities
Date : 2008-10-13 Size : 1.04mb User : 辛瑞超
[CSharp] unixfilesystem DL : 0: 完整的文件系统模拟基本功能（1）多用户（2）多级目录：具有树形目录结构；（3）具有login (用户登录)和用户身份认证功能；（4）文件的创建： create （5）文件的打开：open（6）文件的读：read（7）文件的写：write（8）文件关闭：close（9）删除文件：delete （12）列出文件目录：dir（列目录时要列出文件名、物理地址和文件长度）（13）退出：logout （14）文件保护机制-integrity of the file system simulation basic functions (1) Multi-user (2) Multi-level directory : with the tree structure; (3) having a login (user login) and user authentication functions; (4) Documentation of the founders : create (5) documents the open : open (6) the documents read : read (7) of the document reads : write (8) documents Close : close (9) delete the file : delete (12) provides directory : dir (listed directory to list name, physical address and length of documents) (13) withdrew : logout (14) document protection mechanisms
Date : 2008-10-13 Size : 7.13kb User : sonica
[CSharp] 哈夫曼译码 DL : 0: [基本要求] 一个完整的系统应具有以下功能：（1）I：初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree中。（2）E：编码（Encoding）。利用已建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。（3）D：译码（Decoding）。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。（4）P：印代码文件（Print）。将文件CodeFile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。（5）T：印哈夫曼树（Tree printing）。将已在内存中的哈夫曼树以直观的方式（树或凹入表形式）显示在终端上，同时将此字符形式的哈夫曼树写入文件TreePrint中。 [测试数据] （1）利用下面这道题中的数据调试程序。某系统在通信联络中只可能出现八种字符，其概率分别为0.25，0.29，0.07，0.08，0.14，0.23，0.03，0.11，试设计哈夫曼编码。（2）用下表给出的字符集和频度的实际统计数据建立哈夫曼树，并实现以下报文的编码和译码：“THIS PROGRAM IS MY FAVORITE”。-[basic requirements] a complete system should have the following functions : (a) I : initialization (Initialization). Reading from the terminal into the HKSCS size n, and n n characters and the right value, the establishment of Huffman tree. it will be stored in documents hfmTree China. (2) E : coding (Encoding). Use has completed the Huffman tree (if not memory, from hfmTree document reads), the document ToBeTran the encoded text, and then the results were CodeFile posting documents. (3) D : Decoding (Decoding). The use of the completed document will Huffman tree CodeFile the code decoding, results were deposited documents TextFile. (4) P : India source document (Print). CodeFile of documents to compact format in the end, every line 50 code. While this form of characters encoded files int
Date : 2025-12-17 Size : 990kb User : 吕夏琴
[CSharp] huffman_tree(sjjg) DL : 0: 1、根据用户指定的字符表和频度的实际统计数据建立Huffman树； 2、其中其叶子结点表示字符的权值及父母、左、右孩子等结点的信息； 3、其左右分支分别用代码0、1表示； 4、本系统的目的是为用户提供编/译码系统，根据用户输入的字符依字符集的权值进行编码保存； 5、根据接收到的编码进行译码； 6、输出其内容-1, according to user-specified character tables and frequency of the actual statistical data to establish Huffman tree; 2, in which the leaf node of the right to express character and the value of parents, left and right, such as child nodes of information; 3, around its branches were used code 0,1 said; 4, the Department of EC aims to provide users with encoding/decoding system, according to user input according to the characters of the character set weights encode preservation; 5, the received code decoding; 6, the output of its contents
Date : 2025-12-17 Size : 2kb User : 陈静
[CSharp] Calendar_xrc DL : 0: 使用Csharp实现的日历程序,功能简介：已完成功能 1.新建当天日记，新建随笔 2.打开日记，打开随笔 3.文件保存 4.树状视图的显示 5.设置字体 6.查看日历： a、新建活动 b、查看活动 c、修改活动 d、删除活动 e、活动提醒 7、日历以类似MSN的好友登录提示的方式来通知用户要做的活动-use the calendar to achieve procedures, functional description : a function has been completed. New day diary two new delegates. Open diary Essays open 3. file 4. Tree View Display 5. 6 fonts installed. View the calendar : a, new activities b, c View activities, modifications of the activities d, e delete activities, activities remind 7. MSN Calendar similar to the Friends of the login prompt users to be done to inform the activities
Date : 2025-12-17 Size : 1.04mb User : 辛瑞超
[CSharp] unixfilesystem DL : 0: 完整的文件系统模拟基本功能（1）多用户（2）多级目录：具有树形目录结构；（3）具有login (用户登录)和用户身份认证功能；（4）文件的创建： create （5）文件的打开：open（6）文件的读：read（7）文件的写：write（8）文件关闭：close（9）删除文件：delete （12）列出文件目录：dir（列目录时要列出文件名、物理地址和文件长度）（13）退出：logout （14）文件保护机制-integrity of the file system simulation basic functions (1) Multi-user (2) Multi-level directory : with the tree structure; (3) having a login (user login) and user authentication functions; (4) Documentation of the founders : create (5) documents the open : open (6) the documents read : read (7) of the document reads : write (8) documents Close : close (9) delete the file : delete (12) provides directory : dir (listed directory to list name, physical address and length of documents) (13) withdrew : logout (14) document protection mechanisms
Date : 2025-12-17 Size : 7kb User : sonica
[CSharp] CodeSource DL : 0: asp.net项目辅助开发器源代码 1.主界面仿VS编译器效果，界面用起来更熟悉。 2.可模拟查询分析器执行TSQL语句 3.支持SQL Server 2000、SQL Server 2005 4.以树形菜单方式显示数据库中可操作数据 4.可快速浏览表数据 5.动态生成带参数的SQL语句 6.实体类的生成-asp.net project assisted the development of browser source code 1. main interface compiler VS imitation effect, to use a more familiar interface. 2. Can simulate the implementation of TSQL statements Query Analyzer 3. To support SQL Server 2000, SQL Server 20054. To tree menu display database actionable data 4. Can quickly browse the data in table 5. Dynamically generated SQL statement with parameter 6. entity class generation
Date : 2025-12-17 Size : 1.92mb User : 江南
[CSharp] huffman DL : 0: 编写完整的系统，要求具有以下功能： 1、 I:初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存入文件hfmTree中。 2、 E:编码(Encoding)。利用以建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。 3、 D：译码(Decoding)。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。 4、 P:印代码文件（Print)。将文件CodeFile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。 5、 T:印哈夫曼树(Tree printing)。将已在内存中的哈夫曼树以直观的方式（树或凹入表形式）显示在终端上，同时将此字符形式的哈夫曼树写入文件TreePrint中。 -Tree printing
Date : 2025-12-17 Size : 313kb User : 张亦楠
[CSharp] 5 DL : 0: 1.C或 C++； 2.从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树并将它存于文件hfmTree中.将已在内存中的哈夫曼树以直观的方式（比如树）显示在终端上； 3.利用已经建好的哈夫曼树（如不在内存，则从文件htmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中，并输出结果，将文件CodeFile以紧凑格式先是在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrint中。 4.利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中，并输出结果。 -1.C, or C++ 2. Read from the terminal into the character set size n, as well as the n character and the n-weights, the establishment of Huffman tree and it is stored in the file in hfmTree. Will have been in memory of the Huffman tree in an intuitive way (such as tree) shows the terminal 3. the use of the Huffman tree has been built (eg, not in memory, read from the file into the htmTree), in the body of the document ToBeTran encoded, and then The results stored in CodeFile file, and output the file to a compact format CodeFile first in the terminal, every line of code 50. At the same time the form of this character encoding of the file write to a file CodePrint. 4. The use of the Huffman tree has been built CodeFile file in the code decoding results stored in the file TextFile, and output.
Date : 2025-12-17 Size : 2kb User : cyahafa
[CSharp] Link_Find DL : 0: 编写能实现上述功能的Link(v,r)指令程序，不要使用全局变量，设初始时两森林均由单结点树构成。上机依次执行：Link(2,1), Link(3,2), Link(5,4), Link(4,3), Link(7,6),Link(9,8), Link(8,7), Find-Depth(6), Link(6,5), Find-Depth(4), Find-Depth(7)。打印或抄写每条指令执行后各点的Weight值，画出其时的两种森林。 -Prepared to achieve the above-mentioned functions Link (v, r) instruction programs, do not use global variables, set initially by the two single-node tree of forest composition. Turn-on implementation: Link (2,1), Link (3,2), Link (5,4), Link (4,3), Link (7,6), Link (9,8), Link (8 , 7), Find-Depth (6), Link (6,5), Find-Depth (4), Find-Depth (7). Printing or copying the points after the execution of each instruction of the Weight value of the time to draw the two forests.
Date : 2025-12-17 Size : 1.05mb User : 小牛
[CSharp] 4 DL : 0: 1．输入字符序列，建立二叉链表。 2．中序遍历二叉树:递归算法。 3．中序遍历二叉树:非递归算法。 4．求二叉树的高度。 5．求二叉树的叶子个数。 6．试编写交换以二叉链表作存储结构的二叉树中所有结点的左、右子树的算法。 7．建立中序线索二叉树，并实现中序遍历。 -1. Input sequence of characters, the establishment of binary list. 2. Inorder traversal binary tree: recursive algorithm. 3. Inorder traversal binary tree: non-recursive algorithm. 4. Binary tree of height requirements. 5. Request the number of binary tree leaves. 6. Prepared to test the exchange of binary linked list storage structure of the binary tree for all nodes left and right sub-tree algorithms. 7. Threaded binary tree in order to establish and achieve in order traversal.
Date : 2025-12-17 Size : 2kb User : shixiaojin
[CSharp] 1 DL : 0: 1.基本训练（1）输入字符序列，建立二叉链表。（2）先序、中序、后序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法（最好也能实现先序，后序非递归算法）。（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）对于树中每一个元素值为x的结点，删去以它为根的子树，并释放相应的空间。（8）借助队列实现二叉树的层次遍历。（9）在主函数中设计一个简单的菜单，分别调试上述算法。 -Basic Training (1) Enter the character sequence, establish binary list. (2) The first sequence, sequence, after traversing Binary: recursive algorithm. (3) in traversing Binary: non-recursive algorithm (best to achieve the first-order, post-order non-recursive algorithm). (4) Determine the height of the binary tree. (5) Find the number of leaves of a binary tree. (6) For each element in the tree node value of x, by deleting sub-tree root, and the release of the corresponding space. (8) by means of the queue level traversal of a binary tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.
Date : 2025-12-17 Size : 2kb User : 血鸢
[CSharp] C4.5 DL : 0: C4.5 算法是机器学习算法中的一种分类决策树算法,其核心算法是ID3算法. C4.5算法继承了ID3算法的优点，并在以下几方面对ID3算法进行了改进： 1) 用信息增益率来选择属性，克服了用信息增益选择属性时偏向选择取值多的属性的不足； 2) 在树构造过程中进行剪枝； 3) 能够完成对连续属性的离散化处理； 4) 能够对不完整数据进行处理。 C4.5算法有如下优点：产生的分类规则易于理解，准确率较高。其缺点是：在构造树的过程中，需要对数据集进行多次的顺序扫描和排序，因而导致算法的低效。-The design and implementation of C4.5 and source code,C4.5 algorithm is a classification of the decision tree algorithm of machine learning algorithms, the ID3 algorithm is the core algorithm.
Date : 2025-12-17 Size : 2kb User : 李菲
[CSharp] Infragistics.NetAdvantage2004.Vol.2 DL : 0: NetAdvantage是目前为止最为完整的表示层组件集，它所提供的组件集可用于构建基于Windows应用程序、XML web services、和web解决方案的界面。无论是创建Microsoft环境下精美、强壮的GUI（图形用户界面）还是在COM、.NET或是ASP.NET环境下开发，NetAdvantage Suite都能提供适用的工具集，并结合了当今认知度最高的商业应用程序 -Microsoft Office、Windows和Outlook中的技巧和用法，使得GUI的创建变得更为轻松。功能介绍：1.基于COM、.NET 和ASP.NET 的75种最佳表示层组件：包括网格、图表、工具条、菜单、制表符、树状子目录结构、进度表、日历、编辑器、GUI控件以及更多…2.利用Infragistics的表示层构架可用于继承并创建自定义组件的图形界面跨环境的通用对象模块提供更方便的在线学习 3.支持WindowsXP功能。4.RAD 设计器提升了可视化设计的速度。5.使用NetAdvantage‘s ASP.NET组件可以在瘦客户端环境中创建胖客户端的应用程序。6.提供ASP.NET组件的服务器端应用程序接口（API）7.应用广泛、直观的对象模块，包括了丰富的事件、方法和属性集合，可进行细化至象素水平的编程8.跨环境的通用对象模块提供更方便的在线学习9.Subscription和企业版都提供所有.NET组件和设计器的原代码-NetAdvantage is by far the most complete set of components that layer, it provides the set of components that can be used to build Windows-based applications, XML web services, and web-based solutions interface. Whether it is created under Microsoft environment beautiful, strong GUI (graphical user interface) or in the COM, .NET or ASP.NET development environment, NetAdvantage Suite can provide suitable set of tools, combined with the highest degree of awareness today Business applications - Microsoft Office, Windows and Outlook, skills and usage, making much easier to create a GUI. Features: 1 based on 75 kinds of best presentation layer components COM, .NET and ASP.NET: including grids, charts, toolbars, menus, tabs, tree subdirectory structure, schedules, calendars, Editor , GUI controls, and more ... 2. Using Infragistics presentation layer framework inherited and can be used to create custom graphical interface components across environments generic object module provides a more c
Date : 2025-12-17 Size : 11.46mb User : 国瑞
[CSharp] greedy DL : 0: 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。 2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。 3）将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。 4）背包问题的实验数据如下表：n=8,m=110 -1) programming to implement the knapsack problem greedy algorithm and minimum spanning tree prim algorithm. Through the concrete algorithm, it is understood how to achieve the global optimization through local optimization, and the time complexity of the algorithm is verified. 2) enter the adjacency matrix of the 5 graphs, add the number of nodes and the number of edges in the prim algorithm. 3) comparison of the number of statistics and the calculation of the complexity function, the comparison results are listed in the table. 4) the experimental data of knapsack problem are as follows: m=110, n=8
Date : 2025-12-17 Size : 12kb User : 陈倩
[CSharp] 3 DL : 0: 1.创建一个二叉树 2.可以生成先序遍历二叉树 3.可以生成中序遍历二叉树 4.可以生成后序遍历二叉树 5.计算二叉树的结点总数和叶点数 6.可以建立无向图的邻接矩阵 7.可以生成深度优先遍历图-1. Create a binary tree 2. The first sequence can be generated traversing binary tree 3. Can be generated in order traversing binary tree 4. Can be generated after traversing binary tree 5. Calculation of binary tree nodes and leaves the total points 6. Can create undirected graph adjacency matrix 7. Depth-first traversal graph can be generated
Date : 2025-12-17 Size : 2kb User : 郭翔