Search - X-way 2.5

Search - X-way 2.5 - List

[Data structs] Projectjohu123006 DL : 0: crc任意位生成多项式任意位运算自适应算法循环冗余校验码(CRC，Cyclic Redundancy Code)是采用多项式的编码方式，这种方法把要发送的数据看成是一个多项式的系数，数据为bn-1bn-2…b1b0 (其中为0或1)，则其对应的多项式为： bn-1Xn-1+bn-2Xn-2+…+b１X+b０例如：数据“10010101”可以写为多项式 X７+X４+X２+1。循环冗余校验CRC 循环冗余校验方法的原理如下： (1) 设要发送的数据对应的多项式为P(x)。 (2) 发送方和接收方约定一个生成多项式G(x)，设该生成多项式的最高次幂为r。 (3) 在数据块的末尾添加r个0，则其相对应的多项式为M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，获得商Q(x)和余式R(x)，则 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2运算，T(x)所对应的数据是在原数据块的末尾加上余式所对应的数据得到的。 (6) 发送T(x)所对应的数据。 (7) 设接收端接收到的数据对应的多项式为T’(x)，将T’(x)除以G(x) ，若余式为0，则认为没有错误，否则认为有错。-crc-generating polynomial arbitrary Operators adaptive algorithm Cyclic Redundancy Check (CRC. Cyclic Redundancy Code) is the polynomial coder, This way the data to be sent as a polynomial coefficient data bn- 1bn-2 ... b1b0 (0 or 1), corresponding to the polynomial : bn- 1Xn-1 bn- 2Xn-2 ... b1X belts such as : data "10010101" polynomial can be written as a X7 X4 X2. Cyclic Redundancy Check Cyclic Redundancy Check method of principle as follows : (1) The data to be sent to the corresponding polynomial p (x). (2) the sender and the receiver agreed on a generator polynomial G (x), set up the generator polynomial of the highest power of r. (3) In the data block Add to the end of r-0, then the polynomial corresponding to M (x) = XrP (x). (R-bits) (4) M (x) divided by G (
Date : 2025-12-26 Size : 449kb User : johu
[Data structs] DLink DL : 0: 1.求双向循环链表的长度 2.在双向循环链表指定位置插入一个元素 3.给定双向循环链表中一个结点元素值e，要求将数据y插入到元素e的前面 4.给定双向循环链表中一个结点元素值e，要求将数据y插入到元素e的后面 5.给定双向循环链表中一个结点元素值e，要求将数据y插入到元素e的后面 6.删除双向循环链表中指定位置的元素 7.给定双向循环链表中一个结点元素值e，要求将其对应结点删除 8.给定双向循环链表中一个结点元素值e，要求删除对应结点的直接前驱 9.给定双向循环链表中一个结点元素值e，要求删除对应结点的直接后继 10.求双向循环链表中第i个元素 11.判断双向循环链表H中是否存在元素x，若存在返回1，否则返回0 12.将双向循环链表L就地逆置 13.将双向循环链表逆序输出 14.求双向循环链表H中结点p的直接前驱 15.求双向循环链表H中结点p的直接后继-1. Seek a two-way circular list the length of the 2. In a two-way circular linked list insert an element in the specified location 3. For a given two-way loop in a linked list node element of the value of e, requires that the data y is inserted into the front element e 4. For a given two-way loop in a linked list node element of the value of e, requires that the data y is inserted into the back of element e 5. For a given two-way loop in a linked list node element of the value of e, requires that the data y is inserted into the back of element e 6. Remove the two-way circular linked list of elements in the specified location 7. For a given two-way loop in a linked list node element of the value of e, request to delete the corresponding nodes 8. For a given two-way loop in a linked list node element of the value of e, to delete the corresponding node immediate precursor 9. For a given two-way loop in a linked list node element of the value of e, to delete the correspondi
Date : 2025-12-26 Size : 2kb User : 张敏