Question

In this exercise we will extend the Knuth-Morris-Pratt algorithm from class. Assume the set 2 of characters consists only of the 26 characters of the alphabet and assume that the text T is a sequence of n characters of 2. Let m be the length of the pattern P. Change the Knuth-Morris-Pratt algorithm so that it returns the position of all matches of P in T. If, for example, T aaaa" and P aa" then 3 matches should be returned namely at position 0, 1, and 2. Give the modified algorithm in pseudocode and analyze its running time.

please incorrect spam answer , do not post it..

Answer 1

Solution: modified program code is shown below #Define a main function def main #Receive me s sage from user message - input ("Enter message") #Receive key from user keyeval (input ("Enter key value")) #Declare translated and tempL for result translated=' ' tempL = [] #conve rt me s sage to lower case messagemessage.lower () #Loop through message for c in message: #compute encryption if c.isalpha ) #compute position of c numord (c) #Add key to position num+ key

#If position greater than 26 if num>ord ('z') #Perform circular shift num--26 #Make new string translatedt-chr (num) #App end into array tempL.append (translated) translated '' #Display array print'nYour encrypted message is: ' '.join (tempL) +'.') main () Sample output: Enter message'xyz Enter key value'3' Your encrypted message is a b c