Which function is used to optimize the space in vector?

1.	Which function is used to optimize the space in vector?
A.	operator
B.	at
C.	bool
D.	All of above
E.	None of these
Answer» D. All of above

Discussion

No Comment Found

Related MCQs

What is the output of this program? <pre class="prettyprint lang-c">#include <iostream> #include <string> using namespace std; void PermutationString( string& orig, string& Permutation ) { if (orig.empty()) { cout << Permutation << endl; return; } for (int k = 0; k < orig.size(); ++k) { string orig2 = orig; orig2.erase(k, 1); string Permutation2 = Permutation; Permutation2 += orig.at(k); PermutationString(orig2, Permutation2); } } int main() { string orig = "Sumi"; string Permutation; PermutationString(orig, Permutation); return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c"> #include <iostream> #include <vector> #include <algorithm> using namespace std; void show(const vector<int>& Data) { for (size_t k = 0; k < Data.size(); ++k) { cout << Data[i] << ' '; } cout << endl; } int main() { vector<int> Data; Data.push_back(2); Data.push_back(6); Data.push_back(6); sort(Data.begin(), Data.end()); show(Data); while(next_permutation(Data.begin(), Data.end())) show(Data); return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c"> #include <iostream> #include <vector> #include <algorithm> using namespace std; void Result(const vector<int>& VectorData) { for (size_t k = 0; k < VectorData.size(); ++k) { cout << VectorData[k] << ' '; } } int main() { vector<int> VectorData; VectorData.push_back(4); VectorData.push_back(8); sort(VectorData.begin(), VectorData.end()); Result(VectorData); while(next_permutation(VectorData.begin(), VectorData.end())) Result(VectorData); return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c">#include <iostream> #include <algorithm> using namespace std; int main () { int Numbers[] = {23, 25, 32, 43}; sort (Numbers, Numbers + 4); do { } while ( next_permutation(Numbers, Numbers + 4) ); cout << Numbers[0] << ' ' << Numbers[1] << ' ' << Numbers[2] << ' ' << Numbers[3] << ' n'; return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c"> #include <iostream> #include <algorithm> #include <vector> using namespace std; bool myfunction (int p,int q) { return (p < q); } int main () { int var[] = {90, 80, 70, 60, 50}; vector<int> Num(var, var + 5); partial_sort (Num.begin(), Num.begin() + 4, Num.end()); partial_sort (Num.begin(), Num.begin() + 4, Num.end(), myfunction); for (vector<int> :: iterator Iter = Num.begin(); Iter != Num.end(); ++Iter) cout << ' ' << *Iter; return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c">#include <iostream> #include <algorithm> #include <vector> using namespace std; bool Function(int k, int L) { return (k < L); } struct ObjectClass { bool operator() (int k, int L) { return (k < L); } } StructObject; int main () { int arr[] = {112, 125, 101}; vector<int> Number(arr, arr + 3); sort (Number.begin(), Number.begin() + 2); sort (Number.begin() + 1, Number.end(), Function); sort (Number.begin(), Number.end(), StructObject); for (vector<int> :: iterator Iter = Number.begin(); Iter != Number.end(); ++Iter) cout << ' ' << *Iter; return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c"> #include <iostream> #include <iterator> #include <list> using namespace std; int main () { list<int> DataList; for (int i = 0; i < 10; i++) DataList.push_back (i * 30); list<int> :: iterator firstIter = DataList.begin(); list<int> :: iterator lastIter = DataList.end(); cout << distance(firstIter, lastIter) << endl; return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c">#include <iostream> #include <iterator> #include <list> using namespace std; int main () { list<int> List1, List2; for (int k = 0; k <= 3; k++) { List1.push_back(k); List2.push_back(k * 12); } list<int> :: iterator Iter; Iter = List1.begin(); advance (Iter, 3); copy (List2.begin(), List2.end(), inserter(List1, Iter)); for ( Iter = List1.begin(); Iter != List1.end(); ++Iter ) cout << *Iter << " "; return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c">#include <iostream> #include <iterator> #include <list> using namespace std; int main () { list<int> DataList; for (int k = 0; k < 8; k++) DataList.push_back (k * 8); list<int> :: iterator Iter = DataList.begin(); advance (Iter, 6); cout << *Iter << endl; return 0; } </pre>
What is the output of this program? <pre class="prettyprint lang-c">#include <iostream> #include <vector> #include <iterator> using namespace std; int main () { vector<int> VectorData; for (int k = 0; k <= 8; k++) VectorData.push_back(k); VectorData.erase (VectorData.begin() + 6); VectorData.erase (VectorData.begin(), VectorData.begin() + 4); for (unsigned k = 0; k < VectorData.size(); ++k) { cout << ' ' << VectorData[k]; } return 0; } </pre>

Which function is used to optimize the space in vector?

Discussion

No Comment Found

Related MCQs

Reply to Comment