so i might have pinkeye that’s pretty cool i guess
Pink eye is from getting poop in your eye. Why are you getting poop in your eye?
bye boston
CANT WAIT 2 CHILL WITH U. FUCK BOSTON, WELCOME 2 PARADISE
Marked my territory…on you mattress.
There is a red little fish in my hotel room in Nanjing. She comes with a card that tells me her name is Lily and she doesn’t feel lonely anymore because I’m here now.
Well, Lily, I think you’re very beautiful but you don’t seem to talk much. You just float. Do I really make you feel less lonely…
MY SPIRIT ANIMAL IS A MAGGOT
Old camp counselor that I hadn’t talked to in 5 years and thought I was a huge racist fb chats me just to send me this video of himself.
Has anyone really been far as decided to use even go want to do look more like?
*COMMENTS
* Subsequence method hashes substring of random string of length of the entered string based on the first letter of each
* substring. Each entry stores the substring and the position of its first letter. To find, the application simply iterates
* through the entries in the container at the table entry of the first char of the string that is being searched for. When it is found
* then position of the first letter in the substring is obtained and returned. This continues using the same random sequence of characters but different
* strings to search for until the user terminates the loop.
Yeah so I basically suck at commenting and english.
On where my life went…
In this problem you will use hashing to find efficiently the appearance of a string inside another string.
Assume that you are given a very long string “D = A1A2…AN”, for example: “abanbananababan-
abaaa”. The user inputs a small query string of fixed length k, “Q = P1P2…Pk”, and your program
should find efficiently the appearance(s) of this query string Q in the long string D. The program should
return the location(s) of Q in D. For example, if “banana” is the input string on the previous example,
the program should return: 5.
You have to write a program that uses a hash table to detect possible matches fast and then go and
verify the match (why you need to verify?). Assume that the default length of the queries is six (k=6).
You have to create the hash values for all subsequences of D with length 6 and insert them into a
hash table. Consider the HashCode function provided in Lecture 18. Show that if the hash value of
“AiAi+1…Ai+k−1” is known, the hash value of “Ai+1Ai+2…Ai+k” can be computed in constant time.
Use the comments in your program file to explain this fact. Therefore, you should be able to create the
hash table of all substrings of a fixed size of the string D in O(N) expected time. Use any HashTable
implementation that you want.
Write a class Subsequence that first creates the data structure for a long database string and then
reads input strings from the console and runs the query. You must have a loop to allow the insertion
of many queries for the same long string. Notice that you have to test first if the length of the input
string is correct before you run the query. Provide all your code.
If someone can do this and get back to me, that’d be swell!
