If the following is the data section of a linked list template class called MyList (where T is the type of the stored data), write the definition of the move constructor for this class, as it would appear in the corresponding mylist.hpp file for the class definitions (i.e. not inside the class declaration block): private: MyNode * front; // pointer to the first node in the list MyNode * back; // pointer to the last node in the list int count; // the number of elements stored in the list

In the complexity analysis of an algorithm’s run time T(n), which of the following represents an upper bound on the algorithm’s growth rate?

What is the most appropriate complexity analysis (i.e. the closest fit) in terms of Big-O for the following operation? Shell sort, using Shell’s original interval pattern (N/2, N/4, …., 1)

This vector represents a min-heap: 15, 25, 18, 29, 32, 27, 40, 55, 30 What is the state of the vector after the operation deleteMin() is run on this heap?

Suppose the following is the data section of a binary heap template class called Heap (where T is the type of the stored data). Assume that we have set up the member data such that index 1 of the stored vector is the root of the heap. private: std::vector array; // array that stores heap (index 1 is root) int count; // number of data elements in the heap In the context of the definition file heap.hpp, write a Heap class member function InOrderPrint() that will print all of the data of the heap using the in-order traversal ordering, space-separated between items. You may break up the job by writing any helper functions that you like, but the outside user of a heap object h must be able to simply make this call to invoke the operation: h.InOrderPrint();

Which of the following functions does NOT allow an Date r-value to be passed as a parameter (assume Date is a class)?

In the complexity analysis of an algorithm’s run time T(n), which of the following represents a lower bound on the algorithm’s growth rate?

Suppose a Money class has this constructor:   Money(int d = 0, int c = 0); Which of the following is NOT a legal declaration of an object?

Suppose that we are using a quick sort algorithm to sort the following vector 53, 3, 37, 78, 27, 19, 47, 81, 40, 77, 93, 29, 52, 15, 65 Suppose that the pivot element chosen is 52.  Which of the following would be a valid state of the vector after the first partitioning step (but before the recursive calls on the partitions)?

Merge sort cannot be sorted in place — it needs an extra container to store results.