Scribd Logo
Upload

Welcome to Scribd!

  • Da Daa 2

    Uploaded by

    Rudransh
    12 views2 pages
    This document contains code to search for a pattern in a text string. It defines a search function that takes a pattern, text, and prime number as parameters. The function calculates a hash value for the pattern and initializes a hash value for the text. It then iterates through the text, comparing hashes at each index to check for a match between the pattern and substring of the text. If a full match is found, the index is printed.

    Original Description:

    Design And Analysis of Algorithm

    Original Title

    DA DAA 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code to search for a pattern in a text string. It defines a search function that takes a pattern, text, and prime number as parameters. The function calculates a hash value for the pattern and initializes a hash value for the text. It then iterates through the text, comparing hashes at each index to check for a match between the pattern and substring of the text. If a full match is found, the index is printed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views2 pages

    Da Daa 2

    Uploaded by

    Rudransh
    This document contains code to search for a pattern in a text string. It defines a search function that takes a pattern, text, and prime number as parameters. The function calculates a hash value for the pattern and initializes a hash value for the text. It then iterates through the text, comparing hashes at each index to check for a match between the pattern and substring of the text. If a full match is found, the index is printed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    21BCB0010

    RUDRANSH DEWAN
    DIGITAL ASSIGNMENT 2

    #21BCB0010

    #RUDRANSH DEWAN

    d = 256

    txt = "AABAACAADAABAABA"

    pat = "AABA"

    q = 101

    def search(pat, txt, q):

    M = len(pat)

    N = len(txt)

    i=j=p=t=0

    h=1

    #21BCB0010 RUDRANSH DEWAN

    for i in range(M-1):

    h = (h*d) % q

    for i in range(M):

    p = (d*p + ord(pat[i])) % q

    t = (d*t + ord(txt[i])) % q

    for i in range(N-M+1):

    if (p == t):

    for j in range(M):

    if (txt[i+j] != pat[j]):

    break

    j+=1

    if (j == M):

    print ("Pattern found at index " + str(i))

    if i < N-M:

    t = (d*(t-ord(txt[i])*h) + ord(txt[i+M])) % q

    if t < 0:

    t = t+q

    search(pat, txt, q) #21BCB0010 RUDRANSH DEWAN

    You might also like