question 3.11 a,b,c,d,e

rahulre 1 of 1 210 affected by the delete routine for large values of N (N > 100,000)? 3.7 Modify the Vector class to add bounds checks for indexing. 3.8 Add insert and erase to the Vector class. 3.9 According to the C++ standard, for the vector, a call to push_back, pop_back, insert, or erase invalidates (potentially makes stale) all iterators viewing the vector. Why? 3.10 Modify the Vector class to provide stringent iterator checking by making itera- tors class types rather than pointer variables. The hardest part is dealing with stale iterators, as described in Exercise 3.9. 3.11 Assume that a singly linked list is implemented with a header node, but no tail node, and that it maintains only a pointer to the header node. Write a class that includes methods to a. return the size of the linked list b. print the linked list c. test if a value x is contained in the linked list d. add a value x if it is not already contained in the linked list e. remove a value x if it is contained in the linked list Rahul to me e Jan 15, 2020, 3:43 PM