Topic 1[Exception Handling]
Problem Statement: In the following input i is the index of array ax[]. The
program prints ax[i]. Then write catch block if i is out of range of ax[]. Write
three catch blocks to fullfill the purpose
i) a catch block receives the value of i
ii) a catch block receives string “Out of Range Error”
iii) a default catch() if above two catch block doesn’t match
Source Code:
#include <iostream>
using namespace std;
int main() {
int i;
int ax[5] = {10, 20, 60, 40, 30};
cout << "enter index: ";
cin >> i;
try {
if (i < 0 || i >= 5) {
if (i < 0)
throw i;
else
throw string("Out of Range Error");
}
cout << "ax[" << i << "] = " << ax[i] << endl;
}
catch (int x) {
cout << "Index received: " << x << endl;
}
catch (string s) {
cout << s << endl;
}
catch (...) {
cout << "Default catch block" << endl;
}
return 0;
}
Terminal:
Topic 2 [class Template]:
Problem Statement: In the following class data members x and y are
integers and the method Sum() adds x and y. However, we need to perform
the sum of int+int, int+double, douuble+int and double+double . To
achieve it, change the definition of x,y,setData() and Sum() accordingly.
class A{
private:
int x;
int y;
public:
void setData(int x,int y){
this->x=x;
this->y=y;
int Sum(){
int s;
s=x+y;
return s;
};
int main(){
//write required statements to call SetData() & Sum()
}
Source Code:
#include <iostream>
using namespace std;
template <class T1, class T2>
class A {
T1 x;
T2 y;
public:
void setData(T1 x, T2 y) {
this->x = x;
this->y = y; }
auto Sum() {
return x + y; }
};
int main() {
A<int, int> a1;
[Link](10, 20);
cout << [Link]() << endl;
A<int, double> a2;
[Link](10, 2.5);
cout << [Link]() << endl;
A<double, int> a3;
[Link](3.5, 10);
cout << [Link]() << endl;
A<double, double> a4;
[Link](2.5, 3.5);
cout << [Link]() << endl;
return 0;
}
Terminal:
Topic 3 [STL:Array class]
Problem statement: Declare a STL array object ax with 6 elements and do
the following:
i) Assign 10,60,30,70,20 to ax using single statement
ii) Print third element of ax using at() function
iii) Print first element of ax using front() function
iv) Print last element of ax using back() function
v) Fill the elements of ax using fill() function
vi) Test whether ax is empty or not using empty() function
vii) Print size of ax
viii) Print maximum size of ax using max_size() function
ix) Print address of first element of ax using begin() function
x) Print address of last element of ax using end() function
Source Code:
#include <iostream>
#include <array>
using namespace std;
int main() {
array<int,6> ax = {10, 60, 30, 70, 20, 0};
cout << [Link](2) << endl;
cout << [Link]() << endl;
cout << [Link]() << endl;
[Link](5);
cout << [Link]() << endl;
cout << [Link]() << endl;
cout << ax.max_size() << endl;
cout << &(*[Link]()) << endl;
cout << &(*([Link]() - 1)) << endl;
return 0;
}
Terminal:
Topic 4[STL: pair class]
Problem statement: Define a pair class object px with int and string
elements. Write statements to do the following
i) Assign 10 to int and “Rajshahi” to px using make_pair() function
ii) Print int data member by first
iii) Print string data member by second
iv) Modify first data member to 20 using get<>() function
v) Declare another pair bx and assign values to bx and swap it with ax
Source Code:
#include <iostream>
#include <utility>
using namespace std;
int main() {
pair<int, string> px;
px = make_pair(10, "Rajshahi");
cout << [Link] << endl;
cout << [Link] << endl;
get<0>(px) = 20;
pair<int, string> bx(5, "RUET");
[Link](bx);
return 0; }
Terminal:
Topic 5 [STL: tuple class]
Problem statement: Define a tuple class object tx with [Link] and
double elements. Write statements to do the following
i) Assign <100,”Kamal”,3.5> to tx using make_tuple() function
ii) Print int data member by get() function
iii) Print string data member by get() function
iv) Print double data member by get() function
v) Modify third data member to 3.7 using get<>() function
vi) Declare another tuple bx and assign values to bx and swap it with ax
Source Code:
#include <iostream>
#include <tuple>
using namespace std;
int main() {
tuple<int, string, double> tx;
tx = make_tuple(100, "Kamal", 3.5);
cout << get<0>(tx) << endl;
cout << get<1>(tx) << endl;
cout << get<2>(tx) << endl;
get<2>(tx) = 3.7;
tuple<int, string, double> bx(1, "RUET", 2.2);
[Link](bx);
return 0;
}
Terminal:
Topic 6 [STL: stack class]
Problem statement: Write a program to create and manipulate Stack
using stack class and Perform the following operations using the specified
method.
i) use push() method to push data
ii) use pop() method to pop data
iii) use top() method to display top element
iv) use empty() method to check whether stack is empty or not
Source Code:
#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<int> st;
[Link](10);
[Link](20);
[Link](30);
cout << [Link]() << endl;
[Link]();
cout << [Link]() << endl;
return 0;
}
Terminal:
Topic 7 [STL: queue class]
Problem statement: Write a program to create and manipulate Queue
using queue
class. Perform the following operations using the specified method.
i) use push() method to push data
ii) use pop() method to pop data
iii) use front() method to display front element
iv) use back() method to display rear element
v) use empty() method to check whether queue is empty or not
Source Code:
#include <iostream>
#include <queue>
using namespace std;
int main() {
queue<int> qu;
[Link](10);
[Link](20);
[Link](30);
cout << [Link]() << endl;
cout << [Link]() << endl;
[Link]();
cout << [Link]() << endl;
return 0;
}
Terminal:
Topic 8 [STL: list class]
Problem statement: Write a program to create and manipulate linked list
using list
class and its following methods to
i) insert 8 integers using push_back() method
ii) insert two elements using push_front() method
iii) display all the elements of the list in forward direction with user-defined
Display() method using begin() and end() methods and iterator
iv) display all the elements of the list in reverse direction with a user-
defined
DisplayRev() method using rbegin() and rend() method and iterator
v) display front element using front() method
vi) display back element using back() method
vii) delete front element using pop_back() method
viii) delete front element using pop_front() method
ix) search an element x using find() method
x) insert a new element x before an existing element y using insert() method
xi) insert a new element x after an existing element y using insert() method
xii) count a particular element x
xiii) count a elements with condition using predicate function
xiv) delete a particular element x with erase() method
xv) delete first 4 elements with erase() method
xvi) delete a particular element x with remove() method
xvii) delete a elements with condition using remove_if() method using
predicate function
xviii) assign elements from another list using assign() method
xix) assign elements from an array using assign() method
xx) sort the list using sort() method
xxi) Delete consecutive similar elements using unique() method
Source Code:
#include <iostream>
#include <list>
#include <algorithm>
using namespace std;
bool isEven(int x) { return x % 2 == 0; }
int main() {
list<int> li;
for (int i = 1; i <= 8; i++)
li.push_back(i);
li.push_front(100);
li.push_front(200);
for (auto it = [Link](); it != [Link](); it++)
cout << *it << " ";
cout << endl;
for (auto it = [Link](); it != [Link](); it++)
cout << *it << " ";
cout << endl;
cout << [Link]() << endl;
cout << [Link]() << endl;
li.pop_back();
li.pop_front();
auto it = find([Link](), [Link](), 5);
if (it != [Link]()) [Link](it, 50);
it = find([Link](), [Link](), 5);
if (it != [Link]()) [Link](next(it), 60);
cout << count([Link](), [Link](), 5) << endl;
cout << count_if([Link](), [Link](), isEven) << endl;
[Link](6);
li.remove_if(isEven);
[Link]();
[Link]();
return 0;
}
Terminal:
