assignment_08.cpp
Problem Statement
assignment_08.cpp
Perform Stack operations using Array implementation.
Source Code
cpp
#include <iostream>
using namespace std;
class Stack
{
private:
int *arr;
int top;
int capacity;
public:
Stack(int size)
{
capacity = size;
arr = new int[capacity];
top = -1;
}
bool isFull() { return (top == capacity - 1); }
bool isEmpty() { return (top == -1); }
void push()
{
if (isFull())
{
cout << "Stack Overflow!\n";
return;
}
int val;
cout << "Enter the value: ";
cin >> val;
arr[++top] = val;
}
void pop()
{
if (isEmpty())
{
cout << "Stack Underflow!\n";
return;
}
int val = arr[top--];
cout << "Popped value: " << val << endl;
}
void peek()
{
if (isEmpty())
{
cout << "Stack is empty!\n";
return;
}
cout << "Top element: " << arr[top] << endl;
}
void display()
{
if (isEmpty())
{
cout << "Stack is empty!\n";
return;
}
for (int i = top; i >= 0; i--)
cout << arr[i] << " ";
cout << endl;
}
~Stack() { delete[] arr; }
};
int main()
{
int size, choice;
cout << "Enter stack capacity: ";
cin >> size;
if (size <= 0)
{
cout << "Invalid size!\n";
return 0;
}
Stack s(size);
while (true)
{
cout << "1.push 2.pop 3.peek 4.isFull 5.isEmpty 0.Display -1.Exit\n";
cout << "Enter your choice: ";
cin >> choice;
switch (choice)
{
case 1:
s.push();
break;
case 2:
s.pop();
break;
case 3:
s.peek();
break;
case 4:
cout << (s.isFull() ? "Full\n" : "Not full\n");
break;
case 5:
cout << (s.isEmpty() ? "Empty\n" : "Not empty\n");
break;
case 0:
s.display();
break;
case -1:
cout << "Exiting...\n";
return 0;
default:
cout << "Wrong choice.\n";
}
}
}1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116