ASSIGNMENT 03 Solution

Please download: http://csc340.ducta.net/Assignments/Assignment-03-Code.zip



This assignment’s three main topics are:

Linked List which is a topic of CSC 220 or a previous course not at SFSU. We reviewed and learned Data Structures.



Recursive Function which is also a topic of CSC 220 or a previous course not at SFSU.



Smart Pointers which we cover in detail in this course.



We are studying the C++ versions of Linked List (the Linked Bag) and recursive function again. The focus is on C++ syntax and advanced implementations.
More help and sample code will be provided. Please start this assignment early.



All parts of this assignment are to be done in C++.






PART A – Smart Pointers. 10 points




For each of the following statements, please:

Explain the statement in 5 or more sentences. And



Create a code experiment to demonstrate our understanding.



Please remember to submit our code and to document our experiment in our assignment report.



Deleting the same memory twice: This error can happen when two pointers address the same dynamically allocated object. If delete is applied to one of the pointers, then the object’s memory is returned to the Free-store. If we subsequently delete the second pointer, then the Free-store may be corrupted.



Use smart pointers… Objects that must be allocated with new, but you like to have the same lifetime as other objects/variables on the Run-time stack. Objects assigned to smart pointers will be deleted when program exits that function or block.



Use smart pointers… Data members of classes, so when an object is deleted all the owned data is deleted as well (without any special code in the destructor).



Converting unique_ptr to shared_ptr is easy. Use unique_ptr first and covert unique_ptr to shared_ptr when needed.



Use weak_ptr for shared_ptr like pointers that can dangle.



PART B – Linked Bag. 30 points

Please change only files: LinkedBag340.cpp and Include.h, no other files.



We are to implement 8 small additional functions and 2 helper functions to the Linked Bag.



Our programs must produce identical output to the output in the 2 sample runs: Asmt03_Run1.txt and Asmt03_Run2.txt

Our Test 9’s output must also be identical to the sample output excepts the random values.



Our Test 9’s random values in our 2 sample runs’ output must be different.



Updated: 4/5/2020 6:41 PM
CSC 340.03+.04+.05 ASSIGNMENT 03 SPRING 2020 TA







Descriptions of the 8 functions:




Please ask questions, if any, during the in-class discussions and demos for this assignment.




removeSecondNode340 deletes the second node in the Linked Bag. 3 pts



addEnd340 inserts the new node at the end of the Linked Bag. 3 pts



getCurrentSize340Iterative counts the number of nodes in the Linked Bag iteratively. 3 pts



getCurrentSize340Recursive counts the number of nodes in the Linked Bag recursively. Use 1 helper function: getCurrentSize340RecursiveHelper. 3 pts



IMMEDIATE RECURSION: getCurrentSize340RecursiveNoHelper counts the number of nodes in the Linked Bag recursively. This recursive function does not use any helper functions. 6 pts



getFrequencyOf340Recursive recursively counts the number of times an entry appears in the Linked Bag. Use 1 helper function: getFrequencyOf340RecursiveHelper. 3 pts



IMMEDIATE RECURSION: getFrequencyOf340RecursiveNoHelper recursively counts the number of times an entry appears in the Linked Bag. This recursive function does not use any helper functions. 6 pts



removeRandom340 removes a random entry from the Linked Bag. 3 pts



PART C – Linked Bag, Smart Pointers Version. 10 points




Create a Smart Pointers version of our PART B’s Linked Bag:



Please create a copy of our entire PART B solution and name it: PartC_SmartPointers.



Then go through all the files, not just LinkedBag340.cpp, and use smart pointers properly where it is possible.



In our assignment report, list the file names and the line numbers in which we use smart pointers. For each smart pointer, explain in 3 or more sentences why it is a proper use.



This Smart Pointers version must work properly and produce identical output like that of our PART B version.



Please add a destructor so that the program displays when object(s) get destroyed.



Please remember to submit our code of this part. Save the code under a folder named “PartB_SmartPointers” and include this folder in the assignment submission ZIP. Please remember to document this part in the assignment report.



PART D – Linked Bag, Creativity. 5 Extra Credit points

Please create a copy of our entire PART C solution and name it: PartD_IamCreative



This part is to show off our creative mind. Please implement a new function for Part C’s LinkedBag. We need to add to



LinkedBag340.cpp and Include.h and write PartD.cpp to demonstrate how this new function works.




Requirements, this function shall:



Perform one meaningful task. Please use the first paragraph of at least 5 sentences in PART D to explain why it is a meaningful task.



Modify the LinkedBag’s content every time it runs.



Use Smart Pointers in its parameter list, in its implementation, and as return value(s).



Our graders expect higher quality in this part: creativity, a meaningful task, clean code, and clear documentation and