C++ Institute CPP. C++ Certified Professional Programmer. Version: 4.0
|
|
|
- Ami Diane Davidson
- 6 years ago
- Views:
Transcription
1 C++ Institute CPP C++ Certified Professional Programmer Version: 4.0
2 Topic 1, Volume A QUESTION NO: 1 #include <set> #include <vector> int main(){ int t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 0 ; vector<int>v(t, t+10); multiset<int> s1(v.begin(),v.end()); s1.insert(v.begin(),v.end()); pair<multiset<int>::iterator,multiset<int>::iterator> range; range = s1.equal_range(6); while (range.first!= range.second) { cout<<*range.first<<" "; range.first++; A. program outputs: 6 6 B. program outputs: 5 7 C. program outputs: D. program outputs: E. program outputs: Answer: A "Pass Any Exam. Any Time." - 2
3 QUESTION NO: 2 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator()(const T & val ) { out<<val<<" "; ; struct Sequence { int start; Sequence(int start):start(start){ int operator()() { return start++ ; ; int main() { vector<int> v1(10); generate(v1.rbegin(), v1.rend(), Sequence(1)); rotate(v1.begin(),v1.begin() + 1, v1.end() ); for_each(v1.begin(), v1.end(), Out<int>(cout) );cout<<endl; "Pass Any Exam. Any Time." - 3
4 Program outputs: A B C D Answer: C QUESTION NO: 3 #include <fstream> #include <string> #include <list> #include <algorithm> #include <iomanip> class B { int val; public: B(int v=0):val(v){ int getv() const {return val; operator int() const { return val; ;; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) {out<<setw(3)<<hex<<val; ; "Pass Any Exam. Any Time." - 4
5 int main () { int t[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10; fstream f("test.out", ios::trunc ios::out); list<b> l(t, t+10); for_each(l.begin(), l.end(), Out<B>(f)); f.close(); f.open("test.out"); for( ; f.good() ; ) { B i; f>>i; cout<<i<<" "; f.close(); A. file test.out will be opened writing B. file test.out will be truncated C. file test.out will be opened for reading D. compilation error E. program will display sequence Answer: D QUESTION NO: 4 What will happen when you attempt to compile and run the code below, assuming that you enter the following sequence: one two three<enter>? "Pass Any Exam. Any Time." - 5
6 #include <string> int main () { string a; cin>>a; cout<<a<<endl; Program will output: A. one B. one two three C. runtime exception D. compilation error E. the result is unspecified Answer: A QUESTION NO: 5 What will happen when you attempt to compile and run the following code? #include <map> #include <vector> #include <sstream> #include <string> "Pass Any Exam. Any Time." - 6
7 int main() { int t[] = { 3, 4, 2, 1, 0, 3, 4, 1, 2, 0 ; vector<int> v(t, t + 10); multimap<int, string> m; for (vector<int>::iterator i = v.begin(); i!= v.end(); i++) { stringstream s;s << *i << *i; m.insert(pair<int, string>(*i, s.str())); pair<multimap<int, string>::iterator, multimap<int, string>::iterator> range; range = m.equal_range(2); for (multimap<int, string>::iterator i = range.first; i!= range.second; i++) { cout << i?>first << " "; The output will be: A. 2 2 B. 1 2 C. 1 3 D. 2 E. 0 2 Answer: A QUESTION NO: 6 "Pass Any Exam. Any Time." - 7
8 #include <vector> #include <algorithm> class B { int val; public: B(int v):val(v){ int getv() const {return val; bool operator < (const B & v) const { return val>v.val; ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { B t1[]={3,2,4,1,5; B t2[]={5,6,8,2,1; vector<b> v1(10,0); sort(t1, t1+5); sort(t2, t2+5); set_intersection(t1,t1+5,t2,t2+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<B>(cout));cout<<endl; Program outputs: A. compilation error "Pass Any Exam. Any Time." - 8
9 B C D E Answer: D QUESTION NO: 7 #include <list> #include <vector> int main () { int t[] = {1, 2,3,4,5; vector<int>v1(t, t+5); list<int>l1; l1.assign(v1.end(), v1.begin()); for(int i=0; i<l1.size(); i++) { cout<<l1.at(i)<<" "; cout<<endl; "Pass Any Exam. Any Time." - 9
10 A. program displays B. program displays C. compilation error D. segmentation fault runtime exception Answer: C QUESTION NO: 8 #include <vector> #include <algorithm> class B { int val; public: B(int v):val(v){ int getv() const {return val; bool operator < (const B & v) const { return val<v.val; ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { B t1[]={3,2,4,1,5; B t2[]={6,10,8,7,9; "Pass Any Exam. Any Time."
11 vector<b> v1(10); sort(t1, t1+5); sort(t2, t2+5); merge(t1,t1+5,t2,t2+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<B>(cout));cout<<endl; Program outputs: A B C D E. compilation error Answer: E QUESTION NO: 9 Which sentence is correct about the code below? #include <algorithm> #include <vector> class A { int a; public: A(int a) : a(a) { int geta() const { return a; "Pass Any Exam. Any Time."
12 void seta(int a) { this?>a = a; /* Insert Code Here */ ; struct add10 { void operator()(a & a) { a.seta(a.geta() + 10); ; int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; vector<a> v1(t, t + 10); for_each(v1.begin(), v1.end(), add10()); vector<a>::iterator it = find(v1.begin(), v1.end(), A(7)); cout << it?>geta() << endl; A. it will compile and print 7 B. it will not compile C. it will compile but the program result is unpredictable D. adding code: bool operator!=(const A & b) const { if (this?>a!= b.a) { return true; return false; at Place 1 will allow the program to compile Answer: B QUESTION NO: 10 #include <algorithm> "Pass Any Exam. Any Time."
13 #include <vector> void myfunction(int i) { cout << " " << i; void multiply (int a) { a*2; int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; vector<int> v1(t, t+10); for_each(v1.begin(), v1.end(), multiply); iter_swap(v1.begin(),t+9); for_each(v1.begin(), v1.end(), myfunction); Program outputs: A B. compilation error C D E Answer: A "Pass Any Exam. Any Time."
14 QUESTION NO: 11 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t[]={3,2,4,1,5,10,9,7,8,6; vector<int> v1(t,t+10); cout<<*max_element(v1.begin(), v1.end()); Program outputs: A. 3 B. 1 C. 6 D. 10 E. compilation error Answer: D QUESTION NO: 12 "Pass Any Exam. Any Time."
15 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={3,2,4,1,5; int t2[]={5,6,8,2,1; vector<int> v1(10); sort(t1, t1+5); sort(t2, t2+5); set_intersection(t1,t1+5,t2,t2+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<int>(cout));cout<<endl; Program outputs: A. compilation error B C D E Answer: E "Pass Any Exam. Any Time."
16 QUESTION NO: 13 #include <algorithm> #include <vector> #include <deque> #include <set> void myfunction(int i) { cout << " " << i; int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; vector<int> v1(t, t + 10); deque<int> d1(t, t + 10); set<int> s1(t, t + 10); for_each(v1.begin(), v1.end(), myfunction); // Line I for_each(d1.begin(), d1.end(), myfunction); // Line II for_each(s1.begin(), s1.end(), myfunction); // Line III "Pass Any Exam. Any Time."
17 A. program outputs: B. program outputs: C. program outputs: D. compilation error in line I E. compilation error in line III Answer: A QUESTION NO: 14 #include <algorithm> #include <map> int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; map<int, int> m; for(int i=0; i < 10; i++) { m[i]=t[i]; pair<const int,int> p(5,5); map<int, int>::iterator it = find(m.begin(), m.end(), p); if (it!= m.end()) { "Pass Any Exam. Any Time."
18 cout<<it?>first<<endl; else { cout<<"not found!\n"; Program outputs: A. 5 B. Not found! C. 10 D. compilation error Answer: B QUESTION NO: 15 #include <algorithm> #include <vector> #include <set> void myfunction(int i) { cout << " " << i; "Pass Any Exam. Any Time."
19 int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; set<int> s1(t, t+10); vector<int> v1(s1.rbegin(), s1.rend()); swap_ranges(s1.begin(), s1.end(), v1.begin()); for_each(v1.begin(), v1.end(), myfunction); for_each(s1.begin(), s1.end(), myfunction); Program outputs: A B. compilation error C D E Answer: B QUESTION NO: 16 #include <set> #include <list> int main(){ int t[] ={ 1, 1, 2, 2, 3, 3, 4, 4, 5, 5 ; "Pass Any Exam. Any Time."
20 list<int>v(t, t+10); set<int> s1(v.begin(),v.end()); if (s1.count(3) == 2) { s1.erase(3); for(set<int>::iterator i=s1.begin();i!= s1.end(); i++) { cout<<*i<<" "; A. program outputs: B. program outputs: C. program outputs: D. program outputs: E. compilation error Answer: A QUESTION NO: 17 #include <vector> #include <algorithm> #include <functional> template<class T>struct Out { ostream & out; "Pass Any Exam. Any Time."
21 Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int Add(int a, int b) { return a+b; int main() { int t[]={1,2,3,4,5,6,7,8,9,10; vector<int> v1(t, t+10); vector<int> v2(10); transform(v1.begin(), v1.end(), v2.begin(), bind2nd(ptr_fun (Add),1)); vector<int>::iterator it = find_if(v2.begin(), v2.end(),bind2nd(equal_to<int>(),10)); cout<<*it<<endl; Program outputs: A. false B. true C. 10 D. 0 E. compilation error Answer: C QUESTION NO: 18 "Pass Any Exam. Any Time."
22 #include <algorithm> #include <vector> #include <deque> void myfunction(int i) { cout << " " << i; int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; deque<int> d1(t, t+10); vector<int> v1(d1.rbegin(), d1.rend()); sort(d1.begin(), d1.end()); swap_ranges(v1.begin(), v1.end(), d1.begin()); for_each(v1.begin(), v1.end(), myfunction); for_each(d1.begin(), d1.end(), myfunction); Program outputs: A B. compilation error C D E Answer: D "Pass Any Exam. Any Time."
23 QUESTION NO: 19 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={3,2,4,1,5; int t2[]={5,6,8,2,1; vector<int> v1(10); sort(t1, t1+5); sort(t2, t2+5); set_union(t1,t1+5,t2,t2+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<int>(cout));cout<<endl; Program outputs: A B "Pass Any Exam. Any Time."
24 C D E. compilation error Answer: D QUESTION NO: 20 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t[]={3,2,4,1,5,10,9,7,8,6; vector<int> v1(t,t+10); sort(v1.begin(), v1.end(), greater<int>()); cout<<min_element(v1.begin(), v1.end()); Program outputs: A. 3 B. 1 "Pass Any Exam. Any Time."
25 C. 6 D. 10 E. compilation error Answer: E QUESTION NO: 21 What will happen when you attempt to compile and run the code below, assuming that you enter the following sequence: end<enter>? #include <string> #include <list> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) {out<<val<<" "; ; int main () { list<int> l; for( ;!cin.bad() ; ) { int i; "Pass Any Exam. Any Time."
26 cin>>i; l.push_back(i); for_each(l.begin(), l.end(), Out<int>(cout)); Program will output: A B end C. 1 D. compilation error E. program runs forever without output Answer: E QUESTION NO: 22 #include <set> #include <vector> template<class T> void print(t start, T end) { while (start!= end) { std::cout << *start << " "; start++; int main(){ "Pass Any Exam. Any Time."
27 vector<int>v; multiset<int> s; for(int i=10; i>0; i??) { v.push_back(i); s.push_back(i); print(v.begin(), v.end()); print(s.begin(), s.end());cout<<endl; A. program outputs: B. program outputs: C. program outputs: and unpredictable sequence of numbers range 1 to 10 D. compilation error Answer: D QUESTION NO: 23 #include <map> int main() { int t[] = { 1, 1, 2, 2, 3, 3, 4, 4, 5, 5 ; string s[] = { "one", "one", "two", "two", "three","three", "four", "four", "five", "five"; map<int, string> m; for (int i = 0; i < 10; i++) { m.push_back(pair<int, string>(t[i], s[i])); "Pass Any Exam. Any Time."
28 for (map<int, string>::iterator i = m.begin(); i!= m.end(); i++) { cout << i?>first << " "; A. program outputs: B. compilation error C. program outputs: D. program outputs: one two three four five E. program outputs: one one two two three three four four five five Answer: B QUESTION NO: 24 #include <deque> #include <algorithm> class B { int val; public: B(int v):val(v){ int getv() const {return val; bool operator < (const B & v) const { return val<v.val; ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { "Pass Any Exam. Any Time."
29 ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t[]={8, 10, 5, 1, 4, 6, 2, 7, 9, 3; deque<b> d1(t, t+10); sort(d1.begin(), d1.end()); deque<b>::iterator it = upper_bound(d1.begin(), d1.end(), B(4), greater<b>()); for_each(it, d1.end(), Out<B>(cout)); cout<<endl; Program outputs: A B C. compilation error D E Answer: C QUESTION NO: 25 Which stack initialization (line numbers) are correct? Choose all that apply. #include <deque> #include <list> #include <stack> #include <vector> "Pass Any Exam. Any Time."
30 int main() { deque<int> mydeck; list<int> mylist; vector<int> myvector; stack<int> first;// Line I stack<int> second(mydeck);// Line II stack<int> third(second);// Line III stack<int, list<int> > fourth(mylist);// Line IV stack<int, vector<int> > fifth(myvector);// Line V A. line I B. line II C. line III D. line IV E. line V Answer: A,B,C,D,E QUESTION NO: 26 #include <deque> #include <algorithm> "Pass Any Exam. Any Time."
31 class B { int val; public: B(int v):val(v){ int getv() const {return val; bool operator < (const B & v) const { return val<v.val; ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t[]={8, 10, 5, 1, 4, 6, 2, 7, 9, 3; deque<b> d1(t, t+10); sort(d1.begin(), d1.end()); deque<b>::iterator it = upper_bound(d1.begin(), d1.end(), B(4)); for_each(it, d1.end(), Out<B>(cout)); cout<<endl; Program outputs: A B C D E Answer: A "Pass Any Exam. Any Time."
32 QUESTION NO: 27 #include <vector> #include <algorithm> class B { int val; public: B(int v):val(v){ int getv() const {return val; bool operator < (const B & v) const { return val<v.val; ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { B t1[]={3,2,4,1,5; B t2[]={5,6,8,2,1; vector<b> v1(10,0); sort(t1, t1+5); sort(t2, t2+5); set_symmetric_difference(t2,t2+5,t1,t1+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<B>(cout));cout<<endl; "Pass Any Exam. Any Time."
33 Program outputs: A B C D. compilation error E Answer: E QUESTION NO: 28 #include <vector> #include <algorithm> #include <functional> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t[]={3,2,4,1,5,6,10,8,7,9; vector<int> v1(t, t+10); for_each(v1.begin(), v1.end(), bind2nd(plus<int>(), 1)); for_each(v1.rbegin(), v1.rend(), Out<int>(cout));cout<<endl; "Pass Any Exam. Any Time."
34 Program outputs: A B C D E. compilation error Answer: C QUESTION NO: 29 #include <vector> #include <algorithm> class B { int val; public: B(int v=0):val(v){ int getv() const {return val; operator int () const { return val; ; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; struct Add { "Pass Any Exam. Any Time."
35 B operator()(b & a, B & b) { return a+b; ; int main() { int t[]={1,2,3,4,5,6,7,8,9,10; vector<b> v1(t, t+10); vector<b> v2(10); transform(v1.begin(), v1.end(), v2.begin(), bind1st(1,add())); for_each(v2.rbegin(), v2.rend(), Out<B>(cout));cout<<endl; Program outputs: A B C D E. compilation error Answer: E QUESTION NO: 30 #include <algorithm> #include <vector> int main () { int t[] = {1,2,3,2,3,5,1,2,7,3,2,1,10, 4,4,5; "Pass Any Exam. Any Time."
36 vector<int> v (t,t+15); int number = count(v.begin(), v.end(), 2); cout<< number<<endl; Program outputs: A. 4 B. 3 C. 2 D. 0 E. compilation error Answer: A QUESTION NO: 31 #include <deque> #include <algorithm> #include <set> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; "Pass Any Exam. Any Time."
37 bool Compare(char a, char b) { return tolower(a) < tolower(b); int main() { char s[]={"qwerty"; char t1[]={"ert"; char t2[]={"ert"; sort(s, s+6); cout<<includes(s,s+6, t1,t1+3, Compare)<<" "<<includes(s,s+6, t2,t2+3, Compare)<<endl; Program outputs: A. 0 0 B. 0 1 C. 1 0 D. 1 1 Answer: D QUESTION NO: 32 #include <vector> int main () { std::vector<int>v1; v1.push_back(10); "Pass Any Exam. Any Time."
38 A. compilation fails due to error in line 2 B. compilation fails due to error in line 5 C. exception is thrown during run time D. code compiles and executes successfully Answer: D QUESTION NO: 33 What will happen when you attempt to compile and run the following code? #include <set> #include <vector> int main(){ int t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 0 ; vector<int>v(t, t+10); set<int> s1(v.begin(),v.end()); s1.insert(v.begin(),v.end()); bool found = s1.find(7); if (found){ cout<<"element found!\n"; else { cout<<"element not found!\n"; A. program will display "Element found!" "Pass Any Exam. Any Time."
39 B. program will display "Element not found!\n" C. code will not compile D. changing type of variable found to int will make this code compile Answer: C QUESTION NO: 34 #include <algorithm> #include <vector> #include <set> void myfunction(int i) { cout << " " << i; bool classifier(int v) { return v%2==0; int main() { int t[] = { 1, 5, 2, 5, 2, 4, 4, 3, 3, 1 ; vector<int> v1(t, t+10); set<int> s1(t, t+10); replace(v1.begin(), v1.end(),classifier, 10); for_each(v1.begin(), v1.end(), myfunction); "Pass Any Exam. Any Time."
40 Program outputs: A B C. compilation error D Answer: C QUESTION NO: 35 #include <deque> #include <list> int main () { list<int>l1; deque<int>d1; for(int i=0; i<5; i++) { l1.push_back(i);l1.push_front(i); d1.push_back(i);d1.push_front(i); for(int i=0; i<d1.size(); i++) { cout<<d1[i]<<" "<<l1[i]<<" "; "Pass Any Exam. Any Time."
41 cout<<endl; A. program displays B. runtime exception C. compilation error due to line 11 D. compilation error due to line 12 E. compilation error due to line 16 Answer: E QUESTION NO: 36 #include <deque> #include <vector> int main () { int t[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ; vector<int> v1(t, t + 10); deque<int> d1(v1.begin(), v1.end()); deque<int> d2; d2 = d1; d2.insert(d1.rbegin(), 10); "Pass Any Exam. Any Time."
42 for(int i = 0; i<d1.size(); i++) { cout<<d1[i]<<" "; A. program outputs: B. program outputs: C. program outputs: D. compilation error Answer: D QUESTION NO: 37 int main() { cout<<100<<" "; cout.setf(ios::hex); cout<<100<<" "; Program outputs: A "Pass Any Exam. Any Time."
43 B x64 C. 0x64 0x64 D. 64 0x64 E Answer: E QUESTION NO: 38 int main() { cout.setf(ios::hex, ios::basefield); cout<<100<<" "; cout.flags(ios::showbase); cout<<100<<" "; Program outputs: A B. 64 0x64 C. 0x64 0x64 D E. compilation error Answer: D "Pass Any Exam. Any Time."
44 QUESTION NO: 39 #include <algorithm> #include <vector> int main () { int t[] = {1,2,3,2,3,5,1,2,7,3,2,1,10, 4,4,5; vector<int> v (t,t+15); vector<int>::iterator it = search_n(v.begin(), v.end(), 4, 2); cout<< it?v.begin()<<endl; Program outputs: A. 10 B. 3 C. 1 D. 15 E. compilation error Answer: D QUESTION NO: 40 "Pass Any Exam. Any Time."
45 #include <deque> #include <vector> #include <string> template<typename T> void print(t start, T end) { while (start!= end) cout<<*start++; int main () { string t[] = {"one", "two","three","four", "five"; vector<string>v1(t, t+5); deque<string>d1(v1.rbegin(), v1.rend()); d1.push_back("zero"); print(d1[0].rbegin(),d1[0].rend()); A. program outputs: orez B. program outputs: evif C. compilation error D. program outputs: five Answer: B "Pass Any Exam. Any Time."
46 QUESTION NO: 41 Which pieces of code inserted independently into places marked 1 and 2 will cause the program to compile and display: ? Choose all that apply. #include <list> class A { int a; public: A(int a){ this?>a=a; //insert code here 1 ; //insert code here 2 template<class T> void print(t start, T end) { while (start!= end) { std::cout << *start << " "; start++; int main() { A t1[] ={ 1, 7, 8, 4, 5 ;list<a> l1(t1, t1 + 5); A t2[] ={ 3, 2, 6, 9, 0 ;list<a> l2(t2, t2 + 5); l1.sort();l2.sort();l1.merge(l2); print(l1.begin(), l1.end()); print(l2.begin(), l2.end()); cout<<endl; A. place 1: operator int() { return a; B. place 1: operator int() { return a; bool operator < (const A & b) { return this?>a< b.a; C. place 1: bool operator < (const A & b) { return this?>a< b.a; "Pass Any Exam. Any Time."
47 D. place 1: bool operator < (const A & b) { return this?>a< b.a; friend ostream & operator <<(ostream & c, const A & a); place 2: ostream & operator <<(ostream & c, const A & a) { c<<a.a; return c; E. place 1: bool operator < (const A & b) { return this?>a< b.a; place 2: ostream & operator <<(ostream & c, const A & a) { c<<a.a; return c; Answer: A,B,D QUESTION NO: 42 #include <algorithm> #include <vector> int main () { int t[] = {1,2,3,4,5,1,2,3,4,5; vector<int> v (t,t+10); vector<int>::iterator it; int m1[] = {1, 2, 3; it = search (v.begin(), v.end(), m1, m1+3); cout << "found at position: " << it?v.begin() << endl; Program outputs: A. found at position: 5 B. found at position: 0 C. found at position: 6 "Pass Any Exam. Any Time."
48 D. found at position: 1 E. found at position: 10 Answer: B QUESTION NO: 43 #include <deque> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; struct Sequence { int start; Sequence(int start):start(start){ int operator()() {return 10*(1+(start++ %3)); ; int main() { deque<int> d1(10); generate(d1.begin(), d1.end(), Sequence(1)); sort(d1.begin(), d1.end()); pair<deque<int>::iterator, deque<int>::iterator > result = equal_range(d1.begin(), d1.end(), 20); for_each(result.first, result.second, Out<int>(cout));cout<<endl; "Pass Any Exam. Any Time."
49 Program outputs: A B C D E Answer: B QUESTION NO: 44 Which changes, introduced independently, will allow the code to compile and display one eight nine ten? Choose all that apply #include <map> #include <string> class A { int a; public: A(int a):a(a){ int geta() const { return a; /* Insert Code Here 1 */ ; /* Insert Code Here 2 */ int main(){ int t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 10 ; string s[] = {"three", "four", "two", "one", "six","five", "seven", "nine","eight","ten"; "Pass Any Exam. Any Time."
50 map<a, string> m;/* Replace Code Here 3 */ for(int i=0; i<10; i++) { m.insert(pair<a,string>(a(t[i]),s[i])); m.erase(m.lower_bound(2),m.upper_bound(7)); map<a, string>::iterator i=m.begin(); /* Replace Code Here 4 */ for( ;i!= m.end(); i++) { cout<<i?>second<<" "; cout<<endl; A. operator int() const { return a; inserted at Place 1 B. bool operator < (const A & b) const { return a<b.a; inserted at Place 1 C. bool operator < (const A & b) const { return b.a<a; inserted at Place 1 D. struct R { bool operator ()(const A & a, const A & b) { return a.geta()<b.geta(); ; inserted at Place 2 replacing line marked 3 with map<a, string, R> m; replacing line marked 4 with map<a, string,r>::iterator i=m.begin(); Answer: A,B,D QUESTION NO: 45 #include <vector> #include <algorithm> #include <functional> "Pass Any Exam. Any Time."
51 template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={3,2,4,1,5; int t2[]={6,10,8,7,9; vector<int> v1(5); transform(t1,t1+5,t2,v1.rbegin(), plus<int>()); for_each(v1.rbegin(), v1.rend(), Out<int>(cout));cout<<endl; Program outputs: A B C D E. compilation error Answer: A QUESTION NO: 46 #include <vector> "Pass Any Exam. Any Time."
52 #include <algorithm> class B { int val; public: B(int v):val(v){ int getv() const {return val; bool operator < (const B & v) const { return val<v.val; ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { B t1[]={3,2,4,1,5; int t2[]={5,6,8,2,1; vector<b> v1(10,0); sort(t1, t1+5); sort(t2, t2+5); set_union(t1,t1+5,t2,t2+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<B>(cout));cout<<endl; Program outputs: A B C D E. compilation error "Pass Any Exam. Any Time."
53 Answer: E QUESTION NO: 47 #include <map> #include <vector> #include <sstream> #include <string> int main(){ int t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 0 ; vector<int> v(t, t+10); map<int,string> m; for(vector<int>::iterator i=v.begin(); i!=v.end(); i++) { stringstream s; s<<*i<<*i; m.insert(pair<int,string>(*i,s.str())); for(map<int, string>::iterator i=m.begin();i!= m.end(); i++) { cout<<*i<<" "; A. program outputs: B. program outputs: C. program outputs: D. program outputs: "Pass Any Exam. Any Time."
54 E. compilation error Answer: E QUESTION NO: 48 What will happen when you attempt to compile and run the code below, assuming that file test.in contains the following sequence: 1 2 3? #include <fstream> #include <string> #include <list> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) {out<<val<<" "; ; int main () { ifstream f("test.in"); list<int> l; for( ;!f.fail() ; ) { int i; f>>i; l.push_back(i); f.close(); "Pass Any Exam. Any Time."
55 for_each(l.begin(), l.end(), Out<int>(cout)); Programwill output: A B C. no output D. compilation error E. program runs forever without output Answer: B QUESTION NO: 49 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={3,2,4,1,5; int t2[]={6,10,8,7,9; vector<int> v1(10); "Pass Any Exam. Any Time."
56 sort(t1, t1+5); sort(t2, t2+5); copy(t1,t1+5,v1.begin()); copy(t2,t2+5,v1.begin()+5); merge(v1.begin(), v1.begin()+5,v1.end()); for_each(v1.begin(), v1.end(), Out<int>(cout));cout<<endl; Program outputs: A B C D E. compilation error Answer: E QUESTION NO: 50 #include <vector> #include <set> #include <algorithm> void print(int v) { cout<<v<<" "; struct Sequence { "Pass Any Exam. Any Time."
57 int start; Sequence(int start):start(start){ int operator()() { return start++; ; bool predicate(int v) { return v%2==0; int main() { vector<int> v1(10); generate_n(v1.begin(), 10, Sequence(1)); set<int> s1(v1.begin(), v1.end()); remove_if(s1.begin(), s1.end(), predicate); for_each(s1.begin(), s1.end(), print);cout<<endl; Program outputs: A B C D. compilation error Answer: D QUESTION NO: 51 #include <string> #include <list> "Pass Any Exam. Any Time."
58 template<class T> void print(t start, T end) { while (start!= end) { std::cout << *start << " "; start++; int main() { string t1[] ={ "1", "2", "3", "4", "5", "6", "7", "8", "9", "10"; list<string> l1(t1, t1 + 10); list<string> l2(l1); l2.reverse(); l1.splice(l1.end(),l2); l1.unique(); print(l1.begin(), l1.end()); cout<<endl; A. compilation error B. program outputs: C. program outputs: D. program outputs: Answer: B QUESTION NO: 52 #include <algorithm> #include <vector> "Pass Any Exam. Any Time."
59 int main () { int t[] = {1,2,3,4,5,1,2,3,5,4; vector<int> v (t,t+10); vector<int>::iterator it; int m1[] = {1, 3, 2; it = find_end (v.begin(), v.end(), m1, m1+3); if (it!= v.end()) cout << "Found at position: " << it?v.begin() << endl; A. program outputs: Found at position: 5 B. program outputs: Found at position: 0 C. no output D. program outputs: Found at position: 10 Answer: C QUESTION NO: 53 What will happen when you attempt to compile and run the code below, assuming that file test.in contains the following sequence: 1 2 3? #include <fstream> #include <string> #include <list> #include <algorithm> "Pass Any Exam. Any Time."
60 template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) {out<<val<<" "; ; int main () { ifstream f("test.in"); list<int> l; for( ; f.good() ; ) { int i; f>>i; l.push_back(i); f.close(); for_each(l.begin(), l.end(), Out<int>(cout)); Program will output: A B C. no output D. compilation error E. program runs forever without output Answer: A "Pass Any Exam. Any Time."
61 QUESTION NO: 54 #include <vector> int main () { int t[]={1,2,3,4,5; std::vector<int>v1(t,t+5); std::vector<int>v2(v1); v1.resize(10); v2.reserve(10); std::vector<int>::iterator i = v1.begin();int ii = 0; while (i!= v1.end()) { std::cout<<i[ii]<<" ";ii??;i++; i = v2.begin();ii=0; while (i!= v2.end()) { std::cout<<i[ii]<<" ";ii??;i++; A. program outputs B. compilation error C. program outputs D. program outputs Answer: A QUESTION NO: 55 What will happen when you attempt to compile and run the following code? "Pass Any Exam. Any Time."
62 template <class T> class A { T_v; public: A(T v); ; template<class T> A. :A(T v):_v(v) { int main() { A<int> a(2); cout<<1<<endl; B. program will display: 1 C. program will not compile D. program will compile E. program will cause runtime exception Answer: B QUESTION NO: 56 #include <vector> "Pass Any Exam. Any Time."
63 #include <algorithm> #include <functional> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={1,2,3,4,5,6,7,8,9,10; int t2[]={1,2,3,4,5,6,7,8,9,10; vector<int> v1(t1, t1+10); vector<int> v2(t2, t2+10); vector<int> v3(10); transform(v1.begin(), v1.end(), v2.rbegin(), v3.begin(), minus<int>()); for_each(v3.rbegin(), v3.rend(), Out<int>(cout));cout<<endl; Program outputs: A ?1?3?5?7?9 B.?1?3?5?7? C ?1?3?5?7?9 D ?1?3?5?7?9 E.?9?7?5?3? Answer: A "Pass Any Exam. Any Time."
64 QUESTION NO: 57 #include <vector> #include <algorithm> #include <functional> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; struct Add : public binary_function<int, int, int> { int operator() (const int & a, const int & b) const { return a+b; ; int main() { int t[]={1,2,3,4,5,6,7,8,9,10; vector<int> v1(t, t+10); vector<int> v2(10); transform(v1.begin(), v1.end(), v2.begin(), bind1st(add(), 1)); for_each(v2.rbegin(), v2.rend(), Out<int>(cout));cout<<endl; Program outputs: "Pass Any Exam. Any Time."
65 A B C D E. compilation error Answer: D QUESTION NO: 58 Which changes introduced independently will allow the code to compile and display one eight nine ten? Choose all that apply. #include <map> #include <string> class A { int a; public: A(int a):a(a){ int geta() const { return a; /* Insert Code Here 1 */ ; /* Insert Code Here 2 */ int main(){ int t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 10 ; string s[] = {"three", "four", "two", "one", "six","five", "seven", "nine","eight","ten"; multimap<a,string> m;/* Replace Code Here 3 */ for(int i=0; i<10; i++) { "Pass Any Exam. Any Time."
66 m.insert(pair<a,string>(a(t[i]),s[i])); m.erase(m.lower_bound(2),m.upper_bound(7)); multimap<a, string>::iterator i=m.begin();/* Replace Code Here 4 */ for( ; i!= m.end(); i++) { cout<<i?>second<<" "; cout<<endl; A. operator int() const { return a; inserted at Place 1 B. bool operator < (const A & b) const { return a<b.a; inserted at Place 1 C. bool operator < (const A & b) const { return b.a<a; inserted at Place 1 D. struct R { bool operator ()(const A & a, const A & b) { return a.geta()<b.geta(); ; inserted at Place 2 replacing line marked 3 with multimap<a, string, R> m; replacong line marked 4 with multimap<a, string, R>::iterator i=m.begin(); Answer: A,B,D QUESTION NO: 59 #include <algorithm> #include <map> int main() { "Pass Any Exam. Any Time."
67 int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; map<int, int> m; for(int i=0; i < 10; i++) { m[i]=t[i]; map<int, int>::iterator it = find(m.begin(), m.end(), 5); cout<<it?>first; Program outputs: A. 5 B. 4 C. 10 D. compilation error Answer: D QUESTION NO: 60 Choose all that apply. #include <fstream> #include <string> #include <list> #include <algorithm> #include <iomanip> template<class T>struct Out { "Pass Any Exam. Any Time."
68 ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) {out<<setw(3)<<hex<<val; ; int main () { int t[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10; fstream f("test.out", ios::trunc ios::out); list<int> l(t, t+10); for_each(l.begin(), l.end(), Out<int>(f)); f.close(); f.open("test.out"); for( ; f.good() ; ) { int i; f>>i; cout<<i<<" "; f.close(); A. file test.out will be opened writing B. file test.out will be truncated C. file test.out will be opened for reading D. no file will be created nor opened E. program will display sequence Answer: A,B,C,E QUESTION NO: 61 "Pass Any Exam. Any Time."
69 #include <string> template <class T> class A { T_v; public: A() { A(T v): _v(v){ T getv() { return _v; void add(t & a) { _v+=a; void add(string & a) { _v.insert(0, a); ; int main() { A<string>a("Hello"); string s(" world!"); a.add(s); cout << a.getv() <<endl; "Pass Any Exam. Any Time."
70 A. program will display: Hello world! B. compilation error C. program will display: world!hello D. program will run without any output Answer: B QUESTION NO: 62 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator()(const T & val ) { out<<val<<" "; ; struct Sequence { int start; Sequence(int start):start(start){ int operator()() { return start++; ; int main() { vector<int> v1(10); "Pass Any Exam. Any Time."
71 vector<int> v2(10); generate(v1.begin(), v1.end(), Sequence(1)); reverse_copy(v1.begin(),v1.end(), v2.rbegin()); sort(v2.begin(), v2.end(), less_equal<int>()); for_each(v2.begin(), v2.end(), Out<int>(cout) );cout<<endl; Program outputs: A B C. no output D. compilation error Answer: A QUESTION NO: 63 #include <algorithm> #include <set> class A { int a; public: A(int a) : a(a) { int geta() const { return a; void seta(int a) { this?>a = a; bool operator < (const A & b) const { return a<b.a; "Pass Any Exam. Any Time."
72 ; struct Compare { bool operator ()(A & a) { if (a.geta() < 5) return true; return false; ; int main () { int t[] = {1,2,3,2,3,5,1,2,7,3,2,1,10, 4,4,5; set<a> d (t,t+15); int number = count_if(d.begin(), d.end(), Compare()); cout<< number<<endl; Program outputs: A. 12 B. 4 C. 2 D. 0 E. compilation error Answer: E QUESTION NO: 64 Given three files: class.h, class.cpp and main.cpp containing small C++ project, which sentences are TRUE if you attempt to compile and run the program? Assume that the whole compiling environment is properly set. // File: main.cpp "Pass Any Exam. Any Time."
73 #include "class.h" int main() { A<int> a; cout << a.getv() << endl; //File: class.h #ifndef _CLASS_ #define _CLASS_ template <class T> class A { T_v; public: A() { A(T v); T getv(); ; #endif //File: class.cpp #include "class.h" "Pass Any Exam. Any Time."
74 template<typename T> A<T>::A(T v):_v(v) { template<class T> T A<T>::getV() { return _v; A. program will display: 0 B. program will not compile C. program will display unpredictable number D. program willl be not linked Answer: D QUESTION NO: 65 template<class A> void f(a a) { cout<<1<<endl; void f(int a) { cout<<2<<endl; "Pass Any Exam. Any Time."
75 int main() { int a = 1; f<float>(a); A. program displays: 1 B. program displays: 2 C. compilation error D. runtime exception Answer: A QUESTION NO: 66 #include <list> template<class T> void print(t start, T end) { while (start!= end) { std::cout << *start << " "; start++; int main() "Pass Any Exam. Any Time."
76 { int t1[] ={ 1, 7, 8, 4, 5 ; list<int> l1(t1, t1 + 5); int t2[] ={ 3, 2, 6, 9, 0 ; list<int> l2(t2, t2 + 5); l1.sort(); list<int>::iterator it = l2.begin(); it++; it++; l1.splice(l1.end(),l2, it, l2.end()); print(l1.begin(), l1.end()); cout<<"size:"<<l1.size()<<" "; print(l2.begin(), l2.end()); cout<<"size:"<<l2.size()<<endl; A. program outputs: Size:8 3 2 Size:2 B. program outputs: Size: Size:5 C. compilation error D. program outputs: Size:8 3 2 Size:2 E. program outputs: Size: Size:5 Answer: A QUESTION NO: 67 #include <vector> #include <algorithm> "Pass Any Exam. Any Time."
77 template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator()(const T & val ) { out<<val<<" "; ; struct Sequence { int start; Sequence(int start):start(start){ int operator()() { return 10*(1+(start++ %3)); ; int main() { vector<int> v1(10); vector<int> v2(10); generate(v1.begin(), v1.end(), Sequence(1)); sort(v1.rbegin(), v1.rend()); unique_copy(v1.begin(),v1.end(), v2.begin()); for_each(v2.begin(), v2.end(), Out<int>(cout) );cout<<endl; Program outputs: A B C D. compilation error Answer: B "Pass Any Exam. Any Time."
78 QUESTION NO: 68 #include <algorithm> #include <set> class A { int a; public: A(int a) : a(a) { int geta() const { return a; void seta(int a) { this?>a = a; operator int() const {return a; ; int main () { int t[] = {1,2,3,2,3,5,1,2,7,3,2,1,10, 4,4,5; set<a> s (t,t+15); cout<<equal(s.begin(), s.end(), t)<<endl; Program outputs: A. true B. false C. 1 "Pass Any Exam. Any Time."
79 D. 0 E. compilation error Answer: D QUESTION NO: 69 Which method added to class B at the marked spot will allow the code below to compile? Choose all possible solutions. #include <vector> #include <algorithm> class B { int val; public: B(int v):val(v){ int getv() const {return val; /* Insert Code Here */ ; ostream & operator <<(ostream & out, const B & v) { out<<v.getv(); return out; template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t[]={8, 10, 5, 1, 4, 6, 2, 7, 9, 3; vector<b> v1(t, t+10); sort(v1.begin(), v1.end(), greater<b>()); "Pass Any Exam. Any Time."
80 for_each(v1.begin(), v1.end(), Out<B>(cout));cout<<endl; A. bool operator < (const B & v) const { return val<v.val; B. bool operator > (const B & v) const { return val<v.val; C. bool operator > (const B & v) const { return val>v.val; D. bool operator == (const B & v) const { return val==v.val; E. operator int () const { return val; Answer: B,C,D QUESTION NO: 70 #include <map> #include <vector> #include <sstream> #include <string> int main(){ int t[] ={ 3, 4, 2, 1, 0, 1, 2, 3, 4, 0 ; vector<int> v(t, t+10); multimap<int,string> m; for(vector<int>::iterator i=v.begin(); i!=v.end(); i++) { stringstream s; s<<*i<<*i; m.insert(pair<int,string>(*i,s.str())); for(multimap<int, string>::iterator i=m.begin();i!= m.end(); i++) { "Pass Any Exam. Any Time."
81 cout<<*i<<" "; A. program outputs: B. program outputs: C. program outputs: D. program outputs: E. compilation error Answer: E QUESTION NO: 71 #include <algorithm> #include <deque> class A { int a; public: A(int a) : a(a) { int geta() const { return a; void seta(int a) { this?>a = a; ; int main () { int t[] = {1,2,3,2,3,5,1,2,7,3,2,1,10, 4,4,5; deque<int> d (t,t+15); "Pass Any Exam. Any Time."
82 int number = count(d.begin(), d.end(), 2); cout<< number<<endl; Program outputs: A. 4 B. 3 C. 2 D. 0 E. compilation error Answer: A QUESTION NO: 72 #include <vector> int main () { std::vector<int>v1; for(int i = 10; i>0; i??) { v1.push_back(i); std::vector<int>::iterator it = v1.begin(); int sum = 0; while(it!= v1.end()) "Pass Any Exam. Any Time."
83 { sum+=it++; std::cout<<*v1.erase(v1.begin(),v1.end()?3)<<" "<<sum <<std::endl; A. program outputs 3 55 B. compilation error C. program outputs 3 45 D. program outputs 7 55 Answer: B QUESTION NO: 73 include <iostream> #include <algorithm> #include <vector> #include <deque> #include <set> int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; vector<int> v1(t, t + 10); deque<int> d1(t, t + 10); "Pass Any Exam. Any Time."
84 set<int> s1(t, t + 10); cout<<find(v1.begin(), v1.end(), 6)<<" "<<find(d1.begin(), d1.end(), 6)<<" "<<find(s1.begin(), s1.end(), 6); A. program outputs: B. program outputs: C. program outputs: D. compilation error E. none of these Answer: D QUESTION NO: 74 template <typename T> class A { T_v; public: A() { A(T v): _v(v){ T getv() { return _v; void add(t a) { _v+=a; template <class U> "Pass Any Exam. Any Time."
85 U get(u a) { return (U)(_v); ; int main() { A<int> a(1); a.add(10); cout.setf( ios::showpoint); cout << a.getv() << " " << a.get(1.0)<<endl; A. program will display: B. program will not compile C. program will display: D. program will display: Answer: D QUESTION NO: 75 void g(int a) "Pass Any Exam. Any Time."
86 { cout<<a?1<<endl; template<class A> void g(a a) { cout<<a+1<<endl; int main() { int a = 1; g(a); A. program displays: 0 B. program displays: 2 C. compilation error D. runtime exception Answer: A QUESTION NO: 76 #include <vector> "Pass Any Exam. Any Time."
87 #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={3,2,4,1,5; int t2[]={5,6,8,2,1; vector<int> v1(10); sort(t1, t1+5); sort(t2, t2+5); set_difference(t1,t1+5,t2,t2+5,v1.begin()); for_each(v1.begin(), v1.end(), Out<int>(cout));cout<<endl; Program outputs: A B C D. compilation error E Answer: B "Pass Any Exam. Any Time."
88 QUESTION NO: 77 #include <list> #include <deque> template<class T> void print(t start, T end) { while (start!= end) { std::cout << *start << " "; start++; class A { int a; public: A(int a):a(a){ operator int () const { return a;int geta() const { return a; ; struct R { int val; R(int v):val(v){ bool operator ()(const A & a) { return a>val; ; int main() { int t1[] ={ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10; list<a> l1(t1, t1 + 10); R r(4);l1.remove_if(r); print(l1.begin(), l1.end()); cout<<endl; "Pass Any Exam. Any Time."
89 A. program outputs: B. program outputs: C. program outputs: D. program outputs: Answer: A QUESTION NO: 78 #include <vector> #include <algorithm> template<class T>struct Out { ostream & out; Out(ostream & o): out(o){ void operator() (const T & val ) { out<<val<<" "; ; int main() { int t1[]={3,2,4,1,5; int t2[]={6,10,8,7,9; vector<int> v1(10); sort(t1, t1+5); sort(t2, t2+5); merge(t1,t1+5,t2,t2+5,v1.begin()); "Pass Any Exam. Any Time."
90 for_each(v1.begin(), v1.end(), Out<int>(cout));cout<<endl; Program outputs: A B C D E. compilation error Answer: D QUESTION NO: 79 What will happen when you attempt to compile and run the code below, assuming that you enter the following sequence: <enter>? #include <string> int main () { int a,b,c; cin>>a>>b>>c; cout<<a<<b<<c<<endl; Program will output: "Pass Any Exam. Any Time."
91 A. 123 B C D E. none of these Answer: E QUESTION NO: 80 #include <algorithm> #include <vector> #include <deque> #include <set> struct display { void operator() (int i) {cout << " " << i; ; int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 ; vector<int> v1(t, t + 10); deque<int> d1(t, t + 10); set<int> s1(t, t + 10); for_each(v1.begin(), v1.end(), display); //Line I "Pass Any Exam. Any Time."
92 for_each(d1.begin(), d1.end(), *(new display())); // Line II for_each(s1.begin(), s1.end(), display()); // Line III A. program outputs: B. program outputs: C. compilation error in line I D. compilation error in line II E. compilation error in line III Answer: C QUESTION NO: 81 #include <algorithm> #include <vector> #include <set> int main() { int t[] = {1,2,3,2,3,5,1,2,7,3,2,1,10, 4,4,5; vector<int> v1(t, t + 15); set<int> s1(t, t + 15); "Pass Any Exam. Any Time."
93 pair<set<int>::iterator, vector<int>::iterator > resultset = mismatch(s1.begin(), s1.end(), v1.begin()); cout<<*resultset.first<<" "<<*resultset.second<<endl; Program outputs: A. 2 4 B. 4 2 C. 0 5 D. compilation error Answer: B QUESTION NO: 82 Which changes introduced independently will allow the code to compile and display (choose all that apply)? #include <set> #include <vector> class A { int a; public: A(int a):a(a){ int geta() const { return a; "Pass Any Exam. Any Time."
94 /* Insert Code Here 1 */ ; /* Insert Code Here 2*/ int main(){ A t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 0 ; set<a>s(t, t+10);/* Replace Code Here 3 */ multiset<a> s1(s.begin(),s.end());/* Replace Code Here 4 */ s1.insert(s.begin(),s.end()); s1.erase(s1.lower_bound(2),s1.upper_bound(7)); multiset<a>::iterator i=s1.begin();/* Replace Code Here 5 */ for( ;i!= s1.end(); i++) { cout<<i?>geta()<<" "; cout<<endl; A. operator int() const { return a; inserted at Place 1 B. bool operator < (const A & b) const { return a<b.a; inserted at Place 1 C. bool operator < (const A & b) const { return b.a<a; inserted at Place 1 D. struct R { bool operator ()(const A & a, const A & b) { return a.geta()<b.geta(); ; inserted at Place 2 replacing line marked 3 with set<a, R>s(t, t+10); replacing line marked 4 with multiset<a,r> s1(s.begin(),s.end()); replacing line marked 5 with multiset<a,r>::iterator i=s1.begin(); Answer: A,B,D "Pass Any Exam. Any Time."
IT Certification Exams Provider! Weofferfreeupdateserviceforoneyear! h ps://www.certqueen.com
IT Certification Exams Provider! Weofferfreeupdateserviceforoneyear! h ps://www.certqueen.com Exam : CPP Title : C++ Certified Professional Programmer Version : DEMO 1 / 14 1.What happens when you attempt
/ binary_search example #include <iostream> // std::cout #include <algorithm> // std::binary_search, std::sort #include <vector> // std::vector
Algorithm Searching Example find, search, binary search / binary_search example #include // std::cout #include // std::binary_search, std::sort #include // std::vector bool
Lambda functions. Zoltán Porkoláb: C++11/14 1
Lambda functions Terminology How it is compiled Capture by value and reference Mutable lambdas Use of this Init capture and generalized lambdas in C++14 Constexpr lambda and capture *this and C++17 Zoltán
STL Quick Reference for CS 241
STL Quick Reference for CS 241 Spring 2018 The purpose of this document is to provide basic information on those elements of the C++14 standard library we think are most likely to be needed in CS 241.
Today. andyoucanalsoconsultchapters6amd7inthetextbook. cis15-fall2007-parsons-lectvii.1 2
TEMPLATES Today This lecture looks at techniques for generic programming: Generic pointers Templates The standard template library Thebestreferenceis: http://www.cppreference.com/index.html andyoucanalsoconsultchapters6amd7inthetextbook.
Standard Template Library
Standard Template Library Wednesday, October 10, 2007 10:09 AM 9.3 "Quick Peek" STL history 1990s Alex Stepanov & Meng Lee of HP Labs 1994 ANSI/IS0 standard Components Container class templates Iterators
CS197c: Programming in C++
CS197c: Programming in C++ Lecture 2 Marc Cartright http://ciir.cs.umass.edu/~irmarc/cs197c/index.html Administration HW1 will be up this afternoon Written assignment Due in class next week See website
Module 9. Templates & STL
Module 9 Templates & STL Objectives In this module Learn about templates Construct function templates and class templates STL 2 Introduction Templates: enable you to write generic code for related functions
CS 103: Introduction to Programming Fall Written Final Exam 12/11/16, 4:30PM 6:30PM
CS 103: Introduction to Programming Fall 2017 - Written Final Exam 12/11/16, 4:30PM 6:30PM Name: USC Email Address: Lecture (Circle One): Redekopp 2:00 TTh Goodney: 2 MW 9:30 TTh 11:00 TTh Complete the
1. The term STL stands for?
1. The term STL stands for? a) Simple Template Library b) Static Template Library c) Single Type Based Library d) Standard Template Library Answer : d 2. Which of the following statements regarding the
CSI33 Data Structures
Outline Department of Mathematics and Computer Science Bronx Community College November 22, 2017 Outline Outline 1 Chapter 12: C++ Templates Outline Chapter 12: C++ Templates 1 Chapter 12: C++ Templates
General Advise: Don t reinvent the wheel
General Advise: Don t reinvent the wheel Use libraries: Discover the available open source libraries for your application Examples: STL, boost, thrust libraries Info on C++ and STL: http://www.cplusplus.com/reference,
C++_ MARKS 40 MIN
C++_16.9.2018 40 MARKS 40 MIN https://tinyurl.com/ya62ayzs 1) Declaration of a pointer more than once may cause A. Error B. Abort C. Trap D. Null 2Whice is not a correct variable type in C++? A. float
Containers in C++ and Java
Containers in C++ and Java 1 1. Which of the following statements is true? a) Equality on the basis of reference implies equality on the basis of content. b) Equality on the basis of content implies equality
C++ 프로그래밍실습. Visual Studio Smart Computing Laboratory
C++ 프로그래밍실습 Visual Studio 2015 Contents STL Exercise Practice1 STL Practice 1-1 : Sets The insert method of set class ensures that the set does not contain duplicate keys Without specified position s.insert(123);
Exceptions, Templates, and the STL
Exceptions, Templates, and the STL CSE100 Principles of Programming with C++, Fall 2018 (based off Chapter 16 slides by Pearson) Ryan Dougherty Arizona State University http://www.public.asu.edu/~redoughe/
THE STANDARD TEMPLATE LIBRARY (STL) Week 6 BITE 1513 Computer Game Programming
THE STANDARD TEMPLATE LIBRARY (STL) Week 6 BITE 1513 Computer Game Programming What the heck is STL???? Another hard to understand and lazy to implement stuff? Standard Template Library The standard template
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I. Standard Template Library
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I Standard Template Library 1 Standard Template Library Need to understand basic data types, so we build them ourselves Once understood, we
What will happen if we try to compile, link and run this program? Do you have any comments to the code?
1 # include < iostream > 2 3 int main () 4 { 5 std :: cout
G52CPP C++ Programming Lecture 18. Dr Jason Atkin
G52CPP C++ Programming Lecture 18 Dr Jason Atkin 1 Last lecture Operator Overloading Strings and streams 2 Operator overloading - what to know Know that you can change the meaning of operators Know that
G52CPP C++ Programming Lecture 18
G52CPP C++ Programming Lecture 18 Dr Jason Atkin http://www.cs.nott.ac.uk/~jaa/cpp/ g52cpp.html 1 Welcome Back 2 Last lecture Operator Overloading Strings and streams 3 Operator overloading - what to know
Computer Application and Practice 2: Templates and the Standard Template Library
Computer Application and Practice 2: Templates and the Standard Template Library 2014 Instructor: Young-guk Ha Dept. of Computer Science & Engineering Contents Basics on templates Template classes Template
Programming in C++: Assignment Week 8
Programming in C++: Assignment Week 8 Total Marks : 20 Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology Kharagpur 721302 partha.p.das@gmail.com April 12,
Templates. Zoltán Porkoláb: C++11/14 1
Templates From macros to templates Parameter deduction, instantiation,specialization Class templates, partial specialization Explicit instantiation Dependent types Scope resolution, lookup Mixins CRTP
I/O and STL Algorithms
CS193D Handout 21 Winter 2005/2006 February 29, 2006 I/O and STL Algorithms See also: Chapter 14, Chapter 22 I/O and STL Algorithms CS193D, 2/29/06 1 Raw Input and Output ostream::put(char ch); ostream::write(const
Standard Template Library. Containers, Iterators, Algorithms. Sequence Containers. Containers
Standard Template Library The standard template library (STL) contains Containers Algorithms Iterators A container is a way that stored data is organized in memory, for example an array of elements. Algorithms
Due Date: See Blackboard
Source File: ~/2315/45/lab45.(C CPP cpp c++ cc cxx cp) Input: under control of main function Output: under control of main function Value: 4 Integer data is usually represented in a single word on a computer.
Template based set of collection classes STL collection types (container types)
STL Collection Types Template based set of collection classes STL collection types (container types) Sequences vector - collection of elements of type T list - doubly linked list, only sequential access
The Standard Template Library. An introduction
1 The Standard Template Library An introduction 2 Standard Template Library (STL) Objective: Reuse common code Common constructs: Generic containers and algorithms STL Part of the C++ Standard Library
C++ Programming Lecture 6 Software Engineering Group
C++ Programming Lecture 6 Software Engineering Group Philipp D. Schubert Dynamic memory allocation Quick reminder: Do not confuse between the (de)allocation operators! void* operator new ( std::size_t
EE 355 Unit 10. C++ STL - Vectors and Deques. Mark Redekopp
1 EE 355 Unit 10 C++ STL - Vectors and Deques Mark Redekopp 2 Templates We ve built a list to store integers But what if we want a list of double s or char s or other objects We would have to define the
Associative Containers and Iterators. Ali Malik
Associative Containers and Iterators Ali Malik malikali@stanford.edu Game Plan Recap Associative Containers Iterators Map Iterators The auto keyword (maybe) Range-Based for Loops (maybe) Recap Structs
I source_beg, source_end; // defines a range of values in a source container // defines the beginning of a range in a destination container
Generic Algorithms We have encountered and put to use the concept of generic classes, particularly generic containers. Generic containers could be characterized as implementations of ADTs that are re usable
CS 247: Software Engineering Principles. C++ Templates. Reading: Eckel, Vol. 2 Ch. 5 Templates in Depth. U Waterloo CS247 (Spring 2017) p.
CS 247: Software Engineering Principles C++ Templates Reading: Eckel, Vol. 2 Ch. 5 Templates in Depth U Waterloo CS247 (Spring 2017) p.1/16 Overloaded Functions Problem: Code in overloaded functions whose
Suppose that you want to use two libraries with a bunch of useful classes and functions, but some names collide:
COMP151 Namespaces Motivation [comp151] 1 Suppose that you want to use two libraries with a bunch of useful classes and functions, but some names collide: // File: gnutils.h class Stack {... ; class Some
ECE Fall 2018, Test 3
1 ECE 30862 Fall 2018, Test 3 DO NOT START WORKING ON THIS UNTIL TOLD TO DO SO. LEAVE IT ON THE DESK. THE LAST PAGE IS THE ANSWER SHEET. TEAR IT OFF AND PUT ALL ANSWERS THERE. TURN IN BOTH PARTS OF THE
C and C++ 7. Exceptions Templates. Alan Mycroft
C and C++ 7. Exceptions Templates Alan Mycroft University of Cambridge (heavily based on previous years notes thanks to Alastair Beresford and Andrew Moore) Michaelmas Term 2013 2014 1 / 20 Exceptions
Review Questions II KEY
CS 102 / ECE 206 Spring 2011 Review Questions II KEY The following review questions are similar to the kinds of questions you will be expected to answer on Exam II (April 7), which will focus on LCR, chs.
Homework 5. Yuji Shimojo CMSC 330. Instructor: Prof. Reginald Y. Haseltine
Homework 5 Yuji Shimojo CMSC 330 Instructor: Prof. Reginald Y. Haseltine July 13, 2013 Question 1 Consider the following Java definition of a mutable string class. class MutableString private char[] chars
COMP6771 Advanced C++ Programming
1. COMP6771 Advanced C++ Programming Week 7 Part One: Member Templates and 2016 www.cse.unsw.edu.au/ cs6771 2. Member Templates Consider this STL code: 1 #include 2 #include 3 #include
Lists. linking nodes. constructors. chasing pointers. MCS 360 Lecture 11 Introduction to Data Structures Jan Verschelde, 17 September 2010.
1 2 3 MCS 360 Lecture 11 Introduction to Data Structures Jan Verschelde, 17 September 2010 1 2 3 efficient updates with lists At http://www.sgi.com/tech/stl/ is the Standard Template Library Programmer
Chapter 15 - C++ As A "Better C"
Chapter 15 - C++ As A "Better C" Outline 15.1 Introduction 15.2 C++ 15.3 A Simple Program: Adding Two Integers 15.4 C++ Standard Library 15.5 Header Files 15.6 Inline Functions 15.7 References and Reference
SSE2034: System Software Experiment 3
SSE2034: System Software Experiment 3 Spring 2016 Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu STL Collection Types Template based set of collection
C++ Basics. Brian A. Malloy. References Data Expressions Control Structures Functions. Slide 1 of 24. Go Back. Full Screen. Quit.
C++ Basics January 19, 2012 Brian A. Malloy Slide 1 of 24 1. Many find Deitel quintessentially readable; most find Stroustrup inscrutable and overbearing: Slide 2 of 24 1.1. Meyers Texts Two excellent
Before we dive in. Preprocessing Compilation Linkage
Templates Before we dive in Preprocessing Compilation Linkage 2 Motivation A useful routine to have is void swap( int& a, int &b ) int tmp = a; a = b; b = tmp; 3 Example What happens if we want to swap
Exceptions. CandC++ 7. Exceptions Templates. Throwing exceptions. Conveying information
Exceptions CandC++ 7. Exceptions Templates Stephen Clark University of Cambridge (heavily based on last year s notes (Andrew Moore) with thanks to Alastair R. Beresford and Bjarne Stroustrup) Michaelmas
(heavily based on last year s notes (Andrew Moore) with thanks to Alastair R. Beresford. 7. Exceptions Templates 2/1. Throwing exceptions 14 }
Exceptions Some code (e.g. a library module) may detect an error but not know what to do about it; other code (e.g. a user module) may know how to handle it C++ provides exceptions to allow an error to
Function Templates. Consider the following function:
Function Templates Consider the following function: void swap (int& a, int& b) { int tmp = a; a = b; b = tmp; Swapping integers. This function let's you swap the contents of two integer variables. But
Fundamentals of Type-Dependent Code Reuse in C++ Mark Isaacson
Fundamentals of Type-Dependent Code Reuse in C++ Mark Isaacson Roadmap Reusing an implementation Selecting between implementations Opt-in functions A Beginning assert(max(3, 5) == 5); assert(max("abc"s,
Type Aliases. Examples: using newtype = existingtype; // C++11 typedef existingtype newtype; // equivalent, still works
Type Aliases A name may be defined as a synonym for an existing type name. Traditionally, typedef is used for this purpose. In the new standard, an alias declaration can also be used C++11.Thetwoformsareequivalent.
STANDARD TEMPLATE LIBRARY. Developed By Mrs. K.M.Sanghavi
STANDARD TEMPLATE LIBRARY Developed By Mrs. K.M.Sanghavi STANDARD TEMPLATE LIBRARY Introduction to STL Components of STL : Containers, Algorithms, Iterator Containers : Sequence, Associative and Container
Using Standard C++ Bjarne Stroustrup. AT&T Labs Research
Using Standard C++ Bjarne Stroustrup AT&T Labs Research http://www.research.att.com/~bs ! Standard C++! My view of what it is! Ideals for its use! Classes! Values! Function objects! Containers! vector!
CAP Fundamentos de Programação Estruturada Aula 9 STL. Lubia Vinhas
CAP- 390-1 Fundamentos de Programação Estruturada Aula 9 STL Lubia Vinhas Templates in C++ - Syntax < Content> Where Content can be: class T / typename T A data type, which maps to T An integral specificalon
Time(int h, int m, int s) { hrs = h; mins = m; secs = s; } void set(int h, int m, int s) { hrs = h; mins = m; secs = s; }
Inheritance The following class implements time in hh:mm::ss format: class { public: () { = 0; = 0; = 0; (int h, int m, int s) { = h; = m; = s; void set(int h, int m, int s) { = h; = m; = s; void tick()
CSCE 206: Structured Programming in C++
CSCE 206: Structured Programming in C++ 2017 Spring Exam 2 Monday, March 20, 2017 Total - 100 Points B Instructions: Total of 13 pages, including this cover and the last page. Before starting the exam,
C++ 프로그래밍실습. Visual Studio Smart Computing Laboratory
C++ 프로그래밍실습 Visual Studio 2015 Templates & STL Contents Exercise Practice1 Templates & STL Practice 1-1 Template Classes #include using namespace std; template class Point { private:
CS 7B - Spring Final Exam
CS 7B - Spring 2018 - Final Exam Write your responses to following questions on this paper, or attach extra, as needed. sentences where appropriate and write out code using proper style and syntax. 1.
The Standard C++ Library
The Standard C++ Library Main Ideas Purpose Flexibility Efficiency Simple & Uniform Interface Q: What types can we put in a template param? A: Type which models the requested concept. Concepts - Example
PHY4321 Summary Notes
PHY4321 Summary Notes The next few pages contain some helpful notes that summarize some of the more useful material from the lecture notes. Be aware, though, that this is not a complete set and doesn t
Topics. bool and string types input/output library functions comments memory allocation templates classes
C++ Primer C++ is a major extension of c. It is similar to Java. The lectures in this course use pseudo-code (not C++). The textbook contains C++. The labs involve C++ programming. This lecture covers
Functions. Functions in C++ Calling a function? What you should know? Function return types. Parameter Type-Checking. Defining a function
Functions in C++ Functions For : COP 3330. Object oriented Programming (Using C++) http://www.compgeom.com/~piyush/teach/3330 Declarations vs Definitions Inline Functions Class Member functions Overloaded
G Programming Languages Spring 2010 Lecture 11. Robert Soulé, New York University
G22.2110-001 Programming Languages Spring 2010 Lecture 11 Robert Soulé, New York University 1 Review Last week Constructors, Destructors, and Assignment Operators Classes and Functions: Design and Declaration
Working with Batches of Data
Hartmut Kaiser hkaiser@cct.lsu.edu http://www.cct.lsu.edu/ hkaiser/fall_2012/csc1254.html 2 Abstract So far we looked at simple read a string print a string problems. Now we will look at more complex problems
STL components. STL: C++ Standard Library Standard Template Library (STL) Main Ideas. Components. Encapsulates complex data structures and algorithms
STL: C++ Standard Library Standard Template Library (STL) Encapsulates complex data structures and algorithms is a library of generic container classes which are both efficient and functional C++ STL developed
Agenda. The main body and cout. Fundamental data types. Declarations and definitions. Control structures
The main body and cout Agenda 1 Fundamental data types Declarations and definitions Control structures References, pass-by-value vs pass-by-references The main body and cout 2 C++ IS AN OO EXTENSION OF
Exceptions, Case Study-Exception handling in C++.
PART III: Structuring of Computations- Structuring the computation, Expressions and statements, Conditional execution and iteration, Routines, Style issues: side effects and aliasing, Exceptions, Case
Due Date: See Blackboard
Source File: ~/2315/28/lab28.cpp Input: under control of main function Output: under control of main function Value: 2 Write a function template that will process the elements of a vector and determine
CS 211 Winter 2004 Sample Final Exam (Solutions)
CS 211 Winter 2004 Sample Final Exam (Solutions) Instructor: Brian Dennis, Assistant Professor TAs: Tom Lechner, Rachel Goldsborough, Bin Lin March 16, 2004 Your Name: There are 6 problems on this exam.
Iterators. node UML diagram implementing a double linked list the need for a deep copy. nested classes for iterator function objects
Iterators 1 Double Linked and Circular Lists node UML diagram implementing a double linked list the need for a deep copy 2 Iterators on List nested classes for iterator function objects MCS 360 Lecture
EL2310 Scientific Programming
Lecture 16: STL, C++1y (ramviyas@kth.se) Overview Overview Lecture 16: STL and C++1y Reminders Wrap up C++11 Reminders The help sessions and deadline C++ help session: Fri 24.10.2015, 15:00-17:00, Room
List, Stack, and Queues
List, Stack, and Queues R. J. Renka Department of Computer Science & Engineering University of North Texas 02/24/2010 3.1 Abstract Data Type An Abstract Data Type (ADT) is a set of objects with a set of
Program template-smart-pointers-again.cc
1 // Illustrate the smart pointer approach using Templates 2 // George F. Riley, Georgia Tech, Spring 2012 3 // This is nearly identical to the earlier handout on smart pointers 4 // but uses a different
Templates. Giuseppe Lipari Scuola Superiore Sant Anna Pisa. June 8, 2009
Templates Giuseppe Lipari http://retis.sssup.it Scuola Superiore Sant Anna Pisa June 8, 2009 Reuse One of the most important keywords in OO programming is code reuse If you have a piece of code that works
The Standard Template Library Classes
The Standard Template Library Classes Lecture 33 Sections 9.7, 9.8 Robb T. Koether Hampden-Sydney College Wed, Apr 23, 2014 Robb T. Koether (Hampden-Sydney College) The Standard Template Library Classes
Standard Library. Lecture 27. Containers. STL Containers. Standard Library
Standard Library Lecture 27 Containers (templates) Streams (I/O facilities) Standard Library Portable, type-safe, efficient Try to use as much as possible Heavy use of templates Streams: #include
Basic program The following is a basic program in C++; Basic C++ Source Code Compiler Object Code Linker (with libraries) Executable
Basic C++ Overview C++ is a version of the older C programming language. This is a language that is used for a wide variety of applications and which has a mature base of compilers and libraries. C++ is
Programming II with C++ (CSNB244) Lab 10. Topics: Files and Stream
Topics: Files and Stream In this lab session, you will learn very basic and most common I/O operations required for C++ programming. The second part of this tutorial will teach you how to read and write
C++: Overview and Features
C++: Overview and Features Richard Newman r.newman@rdg.ac.uk Room CS127 2003-12-11 Programming & Design, 2003 1 Introduction You have: used streams seen how classes are used seen some C++ code Today: good
//main.cpp. using namespace std;
Eric Villanueva CSE 330 Homework 1 (40/40) I d give myself a full 40 out of 40 points. I put a lot of effort into getting my code to work, I also used my own code for most of it. Question 1) #include
G52CPP C++ Programming Lecture 17
G52CPP C++ Programming Lecture 17 Dr Jason Atkin http://www.cs.nott.ac.uk/~jaa/cpp/ g52cpp.html 1 Last Lecture Exceptions How to throw (return) different error values as exceptions And catch the exceptions
Other C++11/14 features
Other C++11/14 features Auto, decltype Range for Constexpr Enum class Initializer list Default and delete functions Etc. Zoltán Porkoláb: C++11/14 1 Auto, decltype template void printall(const
Teaching with the STL
Teaching with the STL Joseph Bergin Pace University Michael Berman Rowan College of New Jersey 1 Part 1 Introduction to STL Concepts 2 STL: What and Why Generic data structures (containers) and algorithms
Container Notes. Di erent Kinds of Containers. Types Defined by Containers. C++11 Container Notes C++11
Di erent Kinds of Containers Container Notes A container is an object that stores other objects and has methods for accessing the elements. There are two fundamentally di erent kinds of containers: Sequences
Lectures 11,12. Online documentation & links
Lectures 11,12 1. Quicksort algorithm 2. Mergesort algorithm 3. Big O notation 4. Estimating computational efficiency of binary search, quicksort and mergesort algorithms 5. Basic Data Structures: Arrays
Object Oriented Programming using C++
Object Oriented Programming using C++ Overview Problem Solving Features of an OOL Basic Syntax Programming Paradigms Solving a Programming Problem Analysis Design Coding Management Programming paradigms
STL: C++ Standard Library
STL: C++ Standard Library Encapsulates complex data structures and algorithms CSC 330 OO Software Design 1 We ve emphasized the importance of software reuse. Recognizing that many data structures and algorithms
CS 4301 Algorithmic Languages and Compilers Page 1
Source File: ~/4301/08/lab08.(C CPP cpp c++ cc cxx cp) Input: Under control of main function Output: Under control of main function Value: 1 For Σ = {a,b}, construct a pushdown transducer that accepts
PIC 10A. Lecture 23: Intro to STL containers
PIC 10A Lecture 23: Intro to STL containers STL STL stands for Standard Template Library There are many data structures that share similar features These data structures can be manipulated by a common
Midterm Exam 5 April 20, 2015
Midterm Exam 5 April 20, 2015 Name: Section 1: Multiple Choice Questions (24 pts total, 3 pts each) Q1: Which of the following is not a kind of inheritance in C++? a. public. b. private. c. static. d.
MODULE 33 --THE STL-- ALGORITHM PART I
MODULE 33 --THE STL-- ALGORITHM PART I My Training Period: hours Note: Compiled using Microsoft Visual C++.Net, win32 empty console mode application. g++ compilation examples given at the end of this Module.
Due Date: See Blackboard
Source File: ~/2305/lab33.C Input: under control of main function Output: under control of main function Value: 3 The Shell sort, named after its inventor Donald Shell, provides a simple and efficient
CS2720 Practical Software Development
Page 1 Rex Forsyth CS2720 Practical Software Development CS2720 Practical Software Development STL Tutorial Spring 2011 Instructor: Rex Forsyth Office: C-558 E-mail: forsyth@cs.uleth.ca Tel: 329-2496 Tutorial
C++ Standard Template Library. Contents. Pierre Fierz. 1 Introduction. 2 Organization of STL Header Files. Organization of STL Header Files
Contents Chapter 3 1 Lecture Advanced C++ 05.03.2012 2 3 4 Associative 5 Associative 6 Bernese University of Applied Sciences School of Engineering and Information Technology Division of Computer Science
Binary Search. the towers of Hanoi recursive C++ code. sorted vectors of numbers fast power function. when not to use recursion memoization
Binary Search 1 Recursive Problem Solving the towers of Hanoi recursive C++ code 2 Binary Search sorted vectors of numbers fast power function 3 the Fibonacci numbers when not to use recursion memoization
C++ Programming Assignment 3
C++ Programming Assignment 3 Author: Ruimin Zhao Module: EEE 102 Lecturer: Date: Fei.Xue April/19/2015 Contents Contents ii 1 Question 1 1 1.1 Specification.................................... 1 1.2 Analysis......................................
More on Templates. Shahram Rahatlou. Corso di Programmazione++
More on Templates Standard Template Library Shahram Rahatlou http://www.roma1.infn.it/people/rahatlou/programmazione++/ it/ / h tl / i / Corso di Programmazione++ Roma, 19 May 2008 More on Template Inheritance
C++ TEMPLATES. Templates are the foundation of generic programming, which involves writing code in a way that is independent of any particular type.
C++ TEMPLATES http://www.tutorialspoint.com/cplusplus/cpp_templates.htm Copyright tutorialspoint.com Templates are the foundation of generic programming, which involves writing code in a way that is independent
Functions. Ali Malik
Functions Ali Malik malikali@stanford.edu Game Plan Recap Operator Overloading Functions Lambdas Announcements Recap Classes - Issues C++ doesn t know how to use operators on types defined by us: We can
Programming in C++ using STL. Rex Jaeschke
Programming in C++ using STL Rex Jaeschke Programming in C++ using STL 1997, 1999, 2002, 2007, 2009 Rex Jaeschke. All rights reserved. Edition: 2.0 All rights reserved. No part of this publication may
Scientific Computing
Scientific Computing Martin Lotz School of Mathematics The University of Manchester Lecture 1, September 22, 2014 Outline Course Overview Programming Basics The C++ Programming Language Outline Course