CS2134-Homework 4A- Add the method erase to the Vector class Solved

40.00 $ 20.00 $

Category:
Click Category Button to View Your Next Assignment | Homework

You'll get a download link with a: . zip solution files instantly, after Payment

Description

Rate this product

Assignment 4 ll

Programming Part:
1. Add the method erase( Vector::iterator vItr) to the Vector class. The signature of your method should be:
iterator erase( iterator vItr)
2. Write a recursive function that returns the sum of the digits of a positive integer. The prototype for this function is: int sumDigits(int x);
Remember to include a base case.
If x = 519 then the function returns 15. (i.e. 15 = 5 + 1 + 9.) If x = 312 then the function returns 6. (i.e. 312 = 3 + 1 + 2.)
This function should not have any loops.
You may extend your algorithm to allow for the input to be a negative integer.
If x = −4 then the function returns 4.
If x = −123 then the function returns 6 = 1 + 2 + 3.
3. Write a program that sums the items in a vector using a divide and conquer algorithm. Create a driver function to call the recursive function; the driver function returns the value returned by the recursive function.
The driver function takes one parameter of type vector and returns an int. The prototype for driver function is:
int sumVector( const vector & a) // driver program
The recursive function’s parameters should be iterators that signify a range [left, right).
Remember to include a base case.
If a contains {−9,12,8} then the function returns 11. (i.e. 11 = −9 + 12 + 8.) If a contains {3} then the function returns 3.
If a contains {−21,31,14,1,−20} then the function returns 5. (i.e. 5 = −21+31+14+1−20.)
The function should:
Divide the vector in half.
Recurse on the left hand side.
Recurse on the right hand side. Return the sum of both sides. 
Written Part
1. Using big-Oh notation, give the worst case run time for the method erase, which you implemented programming problem 1.
2. Using big-Oh notation, give the worst case run time for the divide and conquer function yourwrote in programming question dvdandcnqr.
3. For the Vector class, the method erase, (which you implemented programming problem 1), potentially invalidates an iterator (i.e.We will say an iterator is still “valid” if it refers to the same item as before the method was called.). State which iterators are still valid and which iterators are no longer valid. Give your answer as a range of iterators.
4. For the Vector class we implemented in class, and for the following code snippet:
Vector c(1);
Vector::iterator itr = c.begin(); for (int i = 0; i < 100; i++)
c.push_back(i); c[0] = 10; cout << *itr << endl;
What is printed? I.e. Does itr contain the address where the value c[0] is stored? Explain your answer.
5. For the Vector class we discussed in class, if we removed the word explicit in front of the constructor, i.e.
template class Vector
{ public:
Vector( int initSize = 0 ) :
theSize( initSize ), theCapacity( initSize + SPARE_CAPACITY ) { objects = new Object[ theCapacity ]; }
// … rest of class the same as before
}
What would be printed by the following code snippet?
Vector v(3); v = 110; cout << v.capacity();
6. The C++ STL has many functions and functors. Here is your chance to try some of them. In a program when you use an STL algorithm add #include, and when you use an STL functor add #include.
For many of these problems you will need to look up information online. Here are some sources:
http://en.cppreference.com/w/cpp http://www.cplusplus.com/reference/algorithm/ http://www.cplusplus.com/reference/std/functional/ http://www.sgi.com/tech/stl/
Fill in the correct code where you see a ****
vector A {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; vector B {1, 2, 1, 2, 1, 2}; vector C{1, 2, 3, 1, 2, 3}; vector D(6); vector E(10);
(a) Copy the first 6 items of vector A into vector D
copy(****, ****, ****);
// D now equals {1, 2, 3, 4, 5, 6}
(b) Count the number of ones in vector B
cout << count(****, ****, 1);
//prints out the number of times a one appears in B
(c) In C++, there is a way to construct a unary functor from a binary functor. To dothis you use an adapter, a function called bind1st or bind2nd. We use bind1st in this example to convert the STL binary predicate functor not_equal_to into a unary predicate by setting its first value to 1.
Count the number of items that are not equal to one in B
cout << count_if(B.begin( ), ****, bind1st(not_equal_to( ), 1));
/*prints out the number of times a one doesn’t appear in B.*/
(d) Find the first item in vector A which equals 5
vector::iterator vecItr; vecItr = find(****, ****, 5);
// returns an iterator to 5 in vector A if (vecItr != A.end( ))
cout << ****;
// prints out the value pointed to by vecItr
(e) Find the first item in C that is greater than 2
vecItr = find_if(****, ****, bind2nd(greater(), 2));
// returns an iterator to 3 in C if (vecItr != C.end( ))
cout << ****;
// prints out the value pointed to by vecItr
(f) Reverse the order of vector C
reverse(****, ****);
// C is now reversed, it contains {3, 2, 1, 3, 2, 1}
(g) Sort the first 4 items in vector B
sort(B.begin( ), ****);
// B now contains {1, 1, 2, 2, 1, 2}
Sort the the vector A in reverse order using the functor greater
sort(A.begin( ), ****, ****);
//A now contains {10, 9, 8, 7, 6, 5, 4, 3, 2, 1}
(h) Choose any STL function and any STL functor that was not used previously in thisassignment and use them on vector A.

  • Homework-4A-gtiujk.zip