Question
Which algorithm constructs a suffix tree in linear
time?Solution
Ukkonen’s algorithm builds suffix trees in O(n). KMP is for pattern search, Rabin-Karp for hashing.
Pointing to a lady Jayant says, "She is the sister of Prikshit, who is the brother of Dushyant and the brother of Abha."
Abha is the sister-in-la...
Read the given statements and conclusions carefully. Assuming that the information given in the statements is true, even if it appears to be at variance...
Looking at the picture on the wall, he said "My sister-in-law S's husband Q's son N had a sister R". How is S related to R?
Study the given pattern carefully and select the letter that can replace the question mark (?) in it.
In a certain code language, 'WORSHIP' is written as '23418198316' and 'ROAD' is written as '18414'. How will 'REDUCE' be written in that language?
In a certain code language, ‘I swim fast’ is coded as ‘cp lk bs’ and ‘may I go’ is coded as ‘ap sb lk’. How is ‘I’ coded in that cod...
Select the option that represents the letters that, when sequentially placed from left to right in the blanks below, will complete the letter series.
‘Water’ is related to ‘Filter’ in the same way as ‘Film’ is related to ‘______’.
Two statements are given, followed by two conclusions numbered I and II. Assuming the statement to be true, even if they seem to be at variance with co...
