Question: Ruby Programming Ruby Programming This problem is solving most recent search with Ruby programming. Your task is to store and maintain a list of movies

Ruby Programming  Ruby Programming Ruby Programming This problem is solving "most recent search
with Ruby programming. Your task is to store and maintain a list
of movies looked-up by a user similar to how Google stores our

Ruby Programming This problem is solving "most recent search with Ruby programming. Your task is to store and maintain a list of movies looked-up by a user similar to how Google stores our searches (see the image below) and shows most recent search on top Google make french A simple example: Current list [Captain America, Tron Man] New lookup: The Post Updated list: [The Post, "Captain America, Tron Man]-the most recent item gets appended to the front/top You can start by downloading partially implemented Ruby code (mainrb& seach.controller.rb) from the Canvas. And when user exit, save updated list to "data.txt All the details about implementing functions are written in given ruby files 1. 2. (5 pts) Print the list of default movies (15 pts) Accept strings of text from the user until they type exit". When the user types exit, end the loop and then update "data tt. (You need not necessarily update "data.txt" after every single search; it can done be collective at once after user wants to "exit 3. (15 pts) Complete "updateList0 function. The logic of the algorithm is (1) the last searched keyword must appear at the top/first item in the list, (2) If this item already appears in the list, it must be removed from its existing place and moved to the first place. There must be no duplication in list. Treat the movie names to be case insensitive (Toy Story' is same as toy story) 4. (15 pts) Complete saveListToFile0 function in the given Ruby code. Now that you have updated list, let's write the list back to "data.txt file

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!