- 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. 2. 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. 3. 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). 4. Converting unique_ptr to shared_ptr is easy. Use unique_ptr first and covert unique_ptr to shared_ptr when needed. 5. Use weak_ptr for shared_ptr like pointers that can dangle.
- removeSecondNode340 deletes the second node in the Linked Bag. 4 pts 2. addEnd340 inserts the new node at the end of the Linked Bag. 4 pts 3. getCurrentSize340Iterative counts the number of nodes in the Linked Bag iteratively. 4 pts 4. getCurrentSize340Recursive counts the number of nodes in the Linked Bag recursively. Use 1 helper function: getCurrentSize340RecursiveHelper. 4 pts 5. IMMEDIATE RECURSION: getCurrentSize340RecursiveNoHelper counts the number of nodes in the Linked Bag recursively. This recursive function does not use any helper functions. 8 pts 6. getFrequencyOf340Recursive recursively counts the number of times an entry appears in the Linked Bag. Use 1 helper function: getFrequencyOf340RecursiveHelper. 4 pts 7. 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. 8 pts 8. removeRandom340 removes a random entry from the Linked Bag. 4 pts
Welcome to Legit Writing
