Limited-time discount for students! | Solutions starting at $6 each.

Suffix Tree Assignment:.

Added on - 18 Sep 2019

  • 1


  • 255


  • 197


  • 0


Trusted by +2 million users,
1000+ happy students everyday
Showing pages 1 to 1 of 1 pages
Suffix Tree Assignment:To run any task:Go to the folder with the name of the task.You will have a and bash scripts.First run run.shFor tasks LCS, Substring Check and Pattern Searching you just need to give the program a textand a pattern.But for all other tasks, while entering text, please end with $ to mark the end of text.The unique points about my implementation:1.In the Pattern Searching part, my implementation mentions all the positions at which thepattern was found.2.In the count substrings part, my implementation specifies the starting indexes of thesubstring that is occurring many times in the text given.My choice for using CPP is because I am comfortable in it, and also because if I had toimplement multiple inheritance somewhere because of the constraints, I had to use interface inJAVA, but in CPP there is no such restriction of not able to implement Multiple or Hybridinheritance.My Code doesn’t require exception handling as I have covered all the corner cases by coding ina generalized way.The only limitation I encountered so far, was the maximum text size I allow. In all the cases, Ihave set it to 10000, thus if a text with size more than this maximum limit is given, my programwill fail.
You’re reading a preview
Preview Documents

To View Complete Document

Click the button to download
Subscribe to our plans

Download This Document