Question

2. Describe backtracking recursive algorithms for the following variants of the text segmentation problem. Assume that you have a subroutine IsWORD that takes an array of characters as input and returns TRUE if and only if that string is a "word". You do not need to analyze the time complexity of your algorithms for this problem. (a) Given two arrays A[1..n] and B[1..n] of characters, decide whether A and B can be parti- tioned into words at the same indices. For example, the strings BOTHEARTHANDSATURNSPIN and PINSTARTRAPSANDRAGSLAP can be par- titioned into words at the same indices as follows: BOT · HEART HAND - SAT . URNS - PIN PIN - START · RAPS - ANDRAGS · LAP

Describe backtracking recursive algorithms for the following variants of the text segmentation problem. Assume that you have a subroutine IsWord that takes an array of characters as input and returns True if and only if that string is a “word”. You do not need to analyze the time complexity of your algorithms for this problem.

Given two arrays A[1..n] and B[1..n] of characters, decide whether A and B can be partitioned into words at the same indices.

For example, the strings BOTHEARTHANDSATURNSPIN and PINSTARTRAPSANDRAGSLAP can be partitioned into words at the same indices as follows:

BOT · HEART · HAND · SAT · URNS · PIN

PIN · START · RAPS · AND · RAGS · LAP

Answer 1

Given that arrays A[In] and Bll.n ] of characters. we can say that A[] as array WORDS-BAG as Collections of the different words (bag of words) 1) A[]< Input the character from user Iwe are Initializing new array of splitwords (Emply Array)=[ ] Repeat (loop) for i=o to i<length of A Append A Lindex (start to i)] into split words Append A[index litt to last) into split words let us assume that If word is school then splitwords Array would contain like [ SCHOOL, SCHOOL, SCHOOL, SCHO, OL, SCHOO SCHOOL] i=it End for Loop Consider another array output = [] Repeat the for loop ito to length of split words If Splitwords [i] == NULL then return o (No dala Input or found) st Split words [i] = =jn worden bag then. Apibend Split words li] into output