Hi BluePajamas,Could you help me with the following?In the first code you taught me. I need to do some implementation in the existing code for the next lab. The program already do the following below. We need to add some implementations like pointers but It already have pointers. We need to remove the linked list because We need to implement that in the next lab after this lab. So please read “Some Implementation requirement below” Do you have the first code ? It is posted in other question that you helped me. You taught me to do two codes one with pointers and linked list and one without pointers and linked list. So in the code with pointer and task list could you remove linked list and implement the following?What Your Program Should Do: (Same as Lab 2) Write an interactive text based menu interface (using a loop) that will allow the user to Enter a task or assignmentDisplay all of the tasks that are in the fileFind a task by Course QuitFor each task, you need to keep track of:Course Name that it is for (e.g., CS162)Description of the assignment (e.g., Finish Lab 2)Due date (e.g., 9/26/2009) Allow the program to keep looping until user wants to quit. When the program starts, it should load the tasks from external file (“tasks.txt”) into memory. When user enters the three items of a task, the program needs to read them in, save them in memory and eventually write them to the external data file (“tasks.txt”). The file format could look like: (The ‘;’ is used as a delimiter or field seperator.)CS162;Finish Lab 2;9/26/2009 CS201;Take Quiz 1;9/28/2009Some Implementation Requirements: (Different from Lab 2 and Lab 3!!!) Use structs or class named Task to model task. You really should think about changing the struct to class if you have not done so in Lab 2. Use class named TaskList to model the collection of tasks.Use dynamic array of Task to implement TaskList. Use dynamic character array to model the strings in Task, such as course name, task description and due date. The character array should be the exact size as needed, e.g “CS162″ should use an charcter array of size 6 including ”. Use destructor to deallocate the dynamic memory for the object. Make sure your program is “memory-leak-free” by using the memory leak detection tool. Please view the video in the module for detailed instructions about how to enable the tool in your program. When using class, please make sure you encapsulate the data which means make all the instance data member private and provide accessor methods and mutator methods to access and manipulate the data.
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more