Description:
You are given a twitter corpus file on D2L (project4.csv). The format of this file is as follows:
Column 1 – the popularity of the tweet (an int: 0 = negative, 2 = neutral, 4 = positive)
Column 2: the id of the tweet (an int)
Column 3: the keyword (string)
Column 4: the user that tweeted (string. E.g: robotickilldozr)
Column 5: The text of the tweet (string. E.g: Lyx is cool)
You are asked to develop a program to store these tweets into a hash table and provide a user a way to search based on the keyword and retrieve all the tweets that contain that keyword. Each tweet has the following information printed: popularity, id, user name, and text. If you retrieve more than one tweet, the list will be sorted by popularity of the tweet. If two tweets have the same popularity, they will sorted by the user that tweeted.
For example:
Please enter your keyword: lambda calculus
Here are the tweets for that keywords:
| 4 | 2164 | lambda calculus | davidivins | Learning about lambda calculus 🙂 |
| 0 | 197 | lambda calculus | BAK3R | Took the Graduate Field Exam for Computer Science today. Nothing makes you feel like more of an idiot than lambda calculus. |
| 0 | 196 | lambda calculus | read0 | needs someone to explain lambda calculus to him! 🙁 |
You will need to use hash table technique for this project, no exception is made
