Search - 2-3 tree

Search - 2-3 tree - List

[OS program] SnifferPro DL : 0: 1.能够侦听所有进出本主机的数据包完整显示数据包头信息和内容 MAC层支持：以太帧网络层支持：IP，ARP，RARP，ICMP 传输层支持：TCP，UDP 2. 以十六进制显示报文每个字节内容（包括头和数据），指定某个字段时，使相应字节高亮显示。如点击IP Source Address（在解析树中），则相应的四个字节高亮。 3. 可以设置过滤，指定IP地址，指定报文类型（TCP，UDP，ICMP，ARP，RARP），指定方向（A地址－>B地址,B地址－>A地址,A地址<－>B地址），侦探相应的数据包。 4. 统计过滤后收到的报文个数和总字节数，并显示整个网络建议状况（以进度条显示流量，状态栏显示数据） 5. 对分成多个TCP传输的文件重组，去除头信息，得到数据内容，并可以显示或输出到文件。例如，FTP传输RM时，可以将探测到的TCP包重组并保存至文件，就可以观看了。-1. Monitors all access to the mainframe data packet integrity of the data shows that the information and content Baotou MAC layer support : Ethernet frame network layer support : IP, ARP, RARP, ICMP transport layer support : TCP, UDP 2. 16 to 229 shows each byte packet content (including the first and data), a designated field, so that the corresponding byte highlighter. If it IP Source Address (analytic tree), the corresponding 4 byte highlighter. 3. Can provide filtration, the designated IP address, designated packet type (TCP, UDP, ICMP, ARP, RARP), the designated direction (address A -
Date : 2008-10-13 Size : 466.2kb User : 徐新
[OS program] processdel DL : 0: 针对操作系统中进程撤销相关理论进行实验。要求实验者设计一个程序，该程序可模拟撤销多个进程及其子孙进程。 1) 采用动态或静态方法生成一颗进程树（进程数目≥20）； 2) 设计进程撤销算法； 3) 实现进程撤销函数，采用级联方式撤销； 4) 可动态撤销进程； 5) 可动态观察进程树的情况； 6) 测试程序并得到正确结果。 -The process for revocation of the operating system in the theory of the experiment. Asked the experimenter to design a program that can simulate the process of revocation of multiple processes and their descendants. 1) generated by dynamic or static methods of a process tree (process number ≥ 20) 2) revocation of algorithm design process 3) function to achieve the process of revocation, revocation with cascade 4) The revocation process can be dynamic 5) can be dynamically observe the process of tree 6) test program and get the correct results.
Date : 2026-01-03 Size : 7kb User : kkk
[OS program] hafumanshu DL : 0: （1） I:初始化,从终端读入n个字符和n个权值,建立哈夫曼树,并将它存放在文件HuffmanTree中. （2）E:编码.利用已建立好的哈夫曼树,对要传输的数据正文(存在文件ToBeTran.txt中)进行编码,将结果代码存(传输)到文件CodeFile中. （3）D:译码.利用已建好的哈夫曼树,对传输到达的CodeFile中的数据代码进行译码,将译码结果存入文件TestFile中. （4） P: 印文件.将文件CodeFile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。（5） T:,印哈夫曼树,将内存中的哈夫曼树以直观的方式(可以树或凹入表的形式)显示在终端上，同时将此字符形式的编码文件写入文件TreePrin中。 -(1) I: initialization, read from the terminal n-n-weight character and to build the Huffman tree, and store it in the file HuffmanTree. (2) E: coding. Using Huffman tree has been well-established, the body of data to be transferred (in the existing file ToBeTran.txt) encoding, the result code deposit (transfer) to a file in the CodeFile. (3) D: decoding. Use of the Huffman tree has been completed, the transmission of data to reach the CodeFile code decoding, the decoding results stored in the file TestFile. (4) P: printing documents. CodeFile file to the terminal on the compact format, each line of code 50. While this character is written in the form of the encoded file in the file CodePrin. (5) T:, India Huffman tree, the Huffman tree in memory in an intuitive way (for the tree or recess in the form of tables) displayed in the terminal, but this character in the form of encoded file written to the file TreePrin in.
Date : 2026-01-03 Size : 4kb User : liuzhijun
[OS program] Linuxwenjianxitong DL : 0: 1.编写并调试一个树型目录结构的文件系统，模拟文件管理工作流程。要求： (1)设计多用户文件系统，采用多级文件目录。 (2)至少要有十个以上的实用命令，应设置文件保护措施。 (3)设计一个较实用的用户界面，方便用户使用，界面要为用户提供足够的选择信息，不需用户打入打入冗长的命令。-1. Write and debug a tree directory structure, file system, simulation document management workflow. Requirements: (1) design a multi-user file system, using multi-level directory. (2) at least ten more practical order, should be set file protection measures. (3) design a more useful user interface, user-friendly interface to provide users with sufficient choice of information without the user to enter into lengthy commands.
Date : 2026-01-03 Size : 794kb User : kamanlee
[OS program] adt-tree DL : 0: 二叉排序树：又称二叉查找树。它或者是一棵空树；或者是具有下列性质的二叉树：（1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值；（2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值；（3）左、右子树也分别为二叉排序树；-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If the left subtree is not empty, then the value of all the nodes of the left subtree are less than the value of its root (2) If the right subtree is not empty, then the right sub-tree node values are greater than the value of its root (3) left and right subtree respectively, binary sort tree
Date : 2026-01-03 Size : 1kb User : 叶幸
[OS program] Anti-TP_0.4.3 DL : 0: 反rootkit代码,里面的反键盘rootkit,可以学习一下,还有vad树暴搜比较好,其他的随便看看吧-anti rootkid code, anti kdboard and search vad tree is good
Date : 2026-01-03 Size : 3.29mb User : 张先生