search
Log In

GATEFORUM [closed]

0 votes
67 views

closed as a duplicate of: GATE2005-84a
in Algorithms
closed by
67 views

Related questions

0 votes
2 answers
2
195 views
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________
asked Jan 14, 2019 in Algorithms Gupta731 195 views
0 votes
1 answer
4
...