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.
The Accords, which normalized relations between (1)/ Israel and several Arab nations, (2)/ was hailed by many as a diplomatic (3)/ breakthrough that re...
Rohit did not came to the office because he got held up due to the heavy rains.
Never before (a)/ the students of India have so much been frustrated (b)/ as today when the problems of unemployment are dominant. (c)/ No error (d)
Read each sentence to find out whether there is any grammatical error in it. Mark the part with the error as your answer.Â
The plaintiffs sou...
There was speculation that Nandkishore is /up for the assembly speaker’s post, but the /party plump for upper-caste Bhumihar /legislator Vijay Kumar S...
Every community has the (A)/ responsibility of educating its (B)/ next generation, for education is (C)/ the master-key which will (D)/ opened all clo...
This was an illusion to the most (A)/infamous murder committed by (B)/the two anti-heroines of the book (C)/as they are on the run through France (D).�...
Read each sentence carefully to find out whether there is any grammatical or idiomatic error in it. The error, if any, will be in one part of the sente...
There taking it (A) / in the way they (B) / did irritated me. (C) / No error (D)
- From the options given below, select the option which states the correct combination of incorrect sentences.
I. The new policy aims to reduce paper...
