string search algorithm. We will study the suffix trie data structure: a very useful data structure for fast searching over strings. Students can expect a programming assignment at the end of this ...

The student is also exposed to the notion of a faster algorithm and asymptotic complexity through the O, big-Omega and big-Theta notations. In this module, the student will learn about the basics of ...