代做report | 作业assignment | c++代写 | data structure代做 | 数据结构代做  – CSC 340 ASSIGNMENT 03 FALL 2019 TA

2020-10-28

CSC 340 ASSIGNMENT 03 FALL 2019 TA

代做report | 作业assignment | c++代写 | data structure代做 | 数据结构代做  – 本题是一个利用C++进行的数据结构的练习，需要写report， 对C++实现链表等数据结构的流程进行训练解析, 这个项目是assignment代写的代写题目

ass代做 assignment代写 代写assignment

Updated: 10/21/2019 9:38 PM

assignment INSTRUCTIONS

1. Assignment 0 3 : 50 points w/ 5 E.C. points

2. Due Date & Time: 11 – 06 – 2019 at 11:5 5 PM

WHAT TO SUBMIT

1. Assignment Report

2. Code

HOW TO SUBMIT

  • Please refer to the Guidelines for All Assignments and the

Assignment report Template which we discussed in detail

in assignment 00.

ABOUT
  • Please download: http://csc340.ducta.net/Assignments/Assignment- 03 – Code.zip
  • This assignments three main topics are: Linked List which is a topic of CSC 220 or a previous course not at SFSU. Recursive Function which is also a topic of CSC 220 or a previous course not at SFSU. Smart Pointers which we covered in detail in this course. We are studying Linked List (the Linked Bag) and recursive functions again. It will be in C++. 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. 1 0 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.
    1. 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 objects 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.

PART B Linked Bag. 3 0 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: Asmt 03 _Run1.txt and Asmt 03 _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.

PE R F O R M A N C E TR A C K E R

ASMT GRADE YOUR GRADE

00 20

01 55

02 55

MID- 01 – REDO 20

03 50

TOTAL (^) 200 A : 90 – 100% B : 80 – 89% C : 70 – 79% D : 60 – 69% F : 0 – 60% The course grader provides feedback to your assignments on iLearn.

Updated: 10/21/2019 9:38 PM

Descriptions of the 8 functions:
Please ask questions, if any, during the in-class discussions and demos for this assignment.
  1. removeSecondNode340 deletes the second node in the Linked Bag. 3 pts
  2. addEnd340 inserts the new node at the end of the Linked Bag. 3 pts
  3. getCurrentSize340Iterative counts the number of nodes in the Linked Bag iteratively. 3 pts
  4. getCurrentSize340Recursive counts the number of nodes in the Linked Bag recursively. Use 1 helper function: getCurrentSize340RecursiveHelper. 3 pts
  5. IMMEDIATE RECURSION: getCurrentSize340RecursiveNoHelper counts the number of nodes in the Linked Bag recursively. This recursive function does not use any helper functions. 6 pts
  6. getFrequencyOf340Recursive recursively counts the number of times an entry appears in the Linked Bag. Use 1 helper function: getFrequencyOf340RecursiveHelper. 3 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. 6 pts
  8. 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 Bs Linked Bag:
    1. Please create a copy of our entire PART B solution and name it: PartC_SmartPointers.
    2. Then go through all the files, not just LinkedBag340.cpp , and use smart pointers properly where it is possible.
    3. 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.
    4. This Smart Pointers version must work properly and produce identical output like that of our PART B version.
    5. Please add a destructor so that the program displays when object(s) get destroyed.
    6. 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 Cs 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:
    1. 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.
    2. Modify the LinkedBags content every time it runs.
    3. 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 report. Happy coding and thank you!