CONTENTS

Problems Page. No
1. Write a program to search an element from a list. Give 1

user the option to perform Linear or Binary search.

2. WAP to sort a list of elements. Give user the option to perform 6

sorting using Insertion sort, Bubble sort or Selection sort.

3. Implement Linked List. Include functions for insertion, deletion 11

and search of a number, reverse the list.

4. Implement Doubly Linked List. Include functions for insertion, 22

deletion and search of a number, reverse the list.

5. Implement Circular Linked List. Include functions for insertion, 33

deletion and search of a number, reverse the list.

6. Perform Stack operations using Linked List implementation 43

7. Perform Stack operations using Array implementation. 50

8. Perform Queues operations using Circular Array implementation 56

9. Create and perform different operations on Double-ended Queues 63

using Linked List implementation.

11. WAP to calculate factorial of a given no. (i) using recursion, 82

(ii) using iteration

12. WAP to display Fibonacci series (i) using recursion, (ii) using iteration 85

13. WAP to calculate GCD of two numbers (i) with recursion 88

(ii) without recursion

14. WAP to create a BST and include following operations in tree: 91

i. Insertion (Recursive and Iterative Implementation)

ii. Deletion by copying

iii. Deletion by Merging

iv. Search a no. in BST

v. Display its preorder, postorder and inorder traversals Recursively

vi. Display its preorder, postorder and inorder traversals Iteratively

vii. Display its level-by-level traversals

viii. Count the non-leaf nodes and leaf nodes

ix. Display height of tree

x. Create a mirror image of tree

xi. Check whether two BSTs are equal or not

vice-versa.

16. WAP to reverse the order of the elements in the stack 121

using additional stack.

17. WAP to reverse the order of the elements in the stack 124

using additional Queue.

18. WAP to implement Diagonal Matrix using one-dimensional array. 129

19. WAP to implement Lower Triangular Matrix using 132

one-dimensional array.

20. WAP to implement Upper Triangular Matrix using 135

one-dimensional array.

21. WAP to implement Symmetric Matrix using one-dimensional array. 138

Problem Statement: Write a program to search an element from a list. Give user the option to perform
Linear or Binary search.

Program Listing:

#include <iostream>

using namespace std;

void linear_search(int[], int);

void binary_search(int[], int);

void sort(int *, int);

int main() {

int arr[100];

int length, i, choice;

cout << "Enter number of elements for the arrary(MAX=100): ";

cin >> length;

cout << "Enter the elements:\n";

for (i = 0; i < length; i++) {

cin >> arr[i];

cout << "\n1.Linear Search\n2.Binary Search";

cout << "\nEnter your choice: ";

cin >> choice;

1
 switch (choice) {

case 1:

linear_search(arr, length);

break;

case 2:

binary_search(arr, length);

break;

default:

cout << "Invalid choice...Exiting Program";

return 0;

void linear_search(int arr[], int length) {

int i, key;

cout << "Enter element to search: ";

cin >> key;

for (i = 0; i < length; i++) {

if (arr[i] == key) {

cout << "Element Found in array at index " << i;

return;

cout << "Element not found in array";

2
void binary_search(int arr[], int length) {

sort(arr, length);

int beg = 0, mid, end = length - 1, key;

cout << "Enter element to search in array: ";

cin >> key;

while (beg <= end) {

mid = (beg + end) / 2;

if (arr[mid] == key) {

cout << "Item found in array";

return;

} else if (key > arr[mid]) {

beg = mid + 1;

} else {

end = mid - 1;

cout << "Item not found in array";

void sort(int *array, int length) {

for (int i = 0; i < length - 1; i++) {

for (int j = 0; j < length - i - 1; j++) {

if (array[j] > array[j + 1]) {

int temp = array[j];

3
 array[j] = array[j + 1];

array[j + 1] = temp;

Output 1:

Enter number of elements for the arrary(MAX=100): 5

Enter the elements:

12

134

19

314

123

1.Linear Search

2.Binary Search

Enter your choice: 2

Enter element to search in array: 314

Item found in array

Output 2:

Enter number of elements for the arrary(MAX=100): 5

Enter the elements:

4
123

12

34

45345

123

1.Linear Search

2.Binary Search

Enter your choice: 1

Enter element to search: 1

Element not found in array

5
Assignment No: 2

Problem Statement: WAP to sort a list of elements. Give user the option to perform sorting using
Insertion sort, Bubble sort or Selection sort.

Program Listing:

#include <iostream>

using namespace std;

void bubbleSort(int[], int);

void selectionSort(int[], int);

void insertionSort(int[], int);

int main() {

int n, choice;

cout << "Enter the number of elements: ";

cin >> n;

int arr[n];

cout << "Enter the elements: ";

for (int i = 0; i < n; i++) {

cin >> arr[i];

cout << "Choose sorting algorithm:\n";

cout << "1. Bubble Sort\n";

cout << "2. Selection Sort\n";

cout << "3. Insertion Sort\n";

6
cin >> choice;

switch (choice) {

case 1:

bubbleSort(arr, n);

cout << "Sorted array using Bubble Sort: ";

for (int i = 0; i < n; i++) {

cout << arr[i] << " ";

break;

case 2:

selectionSort(arr, n);

cout << "Sorted array using Selection Sort: ";

for (int i = 0; i < n; i++) {

cout << arr[i] << " ";

break;

case 3:

insertionSort(arr, n);

cout << "Sorted array using Insertion Sort: ";

for (int i = 0; i < n; i++) {

cout << arr[i] << " ";

7
 break;

default:

cout << "Invalid choice!";

return 0;

void bubbleSort(int arr[], int n) {

for (int i = 0; i < n - 1; i++) {

for (int j = 0; j < n - i - 1; j++) {

if (arr[j] > arr[j + 1]) {

int temp = arr[j];

arr[j] = arr[j + 1];

arr[j + 1] = temp;

void selectionSort(int arr[], int n) {

for (int i = 0; i < n - 1; i++) {

int minIndex = i;

for (int j = i + 1; j < n; j++) {

8
 if (arr[j] < arr[minIndex]) {

minIndex = j;

int temp = arr[minIndex];

arr[minIndex] = arr[i];

arr[i] = temp;

void insertionSort(int arr[], int n) {

for (int i = 1; i < n; i++) {

int key = arr[i];

int j = i - 1;

while (j >= 0 && arr[j] > key) {

arr[j + 1] = arr[j];

j--;

arr[j + 1] = key;

Output:

Enter the number of elements: 5

Enter the elements: 23

6364

9
1

231

352

Choose sorting algorithm:

1. Bubble Sort

2. Selection Sort

3. Insertion Sort

Sorted array using Bubble Sort: 1 23 231 352 6364

10
Assignment No: 3

Problem Statement: Implement Linked List. Include functions for insertion, deletion and search of a
number, reverse the list.

Program Listing:

#include <iostream>

using namespace std;

struct Node {

int data;

Node *next;

};

class list {

Node *head;

public:

list() { head = NULL; }

void insert();

void remove();

void search();

void reverse();

void display();

};

void list::insert() {

Node *temp, *current;

11
 temp = new Node;

cout << "Enter data: ";

cin >> temp->data;

if (head == NULL) {

head = temp;

temp->next = NULL;

} else {

current = head;

while (current->next != NULL) {

current = current->next;

current->next = temp;

temp->next = NULL;

void list::remove() {

if (head == NULL) {

cout << "List is empty" << endl;

return;

Node *current = head;

Node *prev = NULL;

int i;

cout << "Enter data to delete: ";

12
 cin >> i;

while (current != NULL && current->data != i) {

prev = current;

current = current->next;

if (current == NULL) {

cout << "Element not found\n";

return;

if (prev == NULL) {

head = current->next;

} else {

prev->next = current->next; }

cout << current->data << " deleted\n";

delete current;

void list::display() {

if (head == NULL) {

cout << "List is empty\n";

return;

13
 }

Node *temp;

temp = head;

while (temp != NULL) {

cout << temp->data << " ";

temp = temp->next;

void list::search() {

if (head == NULL) {

cout << "List is empty\n";

return;

Node *temp;

temp = head;

int item;

cout << "Enter item to search: ";

cin >> item;

while (temp != NULL) {

if (temp->data == item) {

cout << "Item found\n";

return;

temp = temp->next;

14
 }

cout << "Item not found\n";

void list::reverse() {

if (head == NULL) {

cout << "List is empty\n";

return;

Node *current, *prev, *next;

current = head;

next = current->next;

prev = NULL;

while (current != NULL) {

current->next = prev;

prev = current;

current = next;

next = current->next;

head = prev;

int main() {

list l;

int choice;

15
while (1) {

cout << "\n1.Insert\n2.Delete\n3.Display\n4.Search\n5.Reverse\n6.Exit\n";

cout << "Enter your choice: ";

cin >> choice;

switch (choice) {

case 1:

l.insert();

break;

case 2:

l.remove();

break;

case 3:

l.display();

break;

case 4:

l.search();

break;

case 5:

l.reverse();

break;

case 6:

exit(0);

default:

cout << "Wrong Input\nExitting program\n";

exit(0);

16
 }

return 0;

Output:

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 2

List is empty

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

List is empty

1.Insert

17
2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data: 12

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data: 134

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data: 1513

18
1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

12 134 1513

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 5

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

1513 134 12

19
1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 2

Enter data to delete: 1

Element not found

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 2

Enter data to delete: 1513

1513 deleted

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

20
6.Exit

Enter your choice: 3

134 12

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 6

21
Assignment No: 4

Problem Statement: Implement Doubly Linked List. Include functions for insertion, deletion and search
of a number, reverse the list.

Program Listing:

#include <iostream>

using namespace std;

struct NODE {

int data;

NODE *prev;

NODE *next;

};

class dlist {

NODE *head;

public:

dlist() { head = NULL; }

void insert();

void remove();

void display();

void search();

void reverse();

};

void dlist::insert() {

22
 NODE *temp, *current;

temp = new NODE;

cout << "Enter data: ";

cin >> temp->data;

if (head == NULL) {

head = temp;

temp->prev = NULL;

temp->next = NULL;

} else {

current = head;

while (current->next != NULL) {

current = current->next;

current->next = temp;

temp->prev = current;

temp->next = NULL;

void dlist::remove() {

if (head == NULL) {

cout << "List is empty\n";

return;

NODE *temp, *current;

23
current = head;

int item;

cout << "Enter data to delete: ";

cin >> item;

if((current = head) && (current->next == NULL))

head = NULL;

cout<<current->data<< " deleted\n";

delete current;

return;

while (current != NULL && current->data != item) {

current = current->next;

if (current == NULL) {

cout << "Element not found\n";

return;

if(current == head)

head = current->next;

head->prev = NULL;

else

24
 temp = current->prev;

temp->next = current->next;

if(current->next != NULL)

current->next->prev = temp;

cout << current->data << " Deleted "<<endl;

delete current;

void dlist::display() {

if (head == NULL) {

cout << "List is empty\n";

return;

NODE *temp;

temp = head;

while (temp != NULL) {

cout << temp->data << " ";

temp = temp->next;

cout << endl;

25
void dlist::search() {

if (head == NULL) {

cout << "List is empty\n";

return;

NODE *temp;

temp = head;

int item;

cout << "Enter item to search: ";

cin >> item;

while (temp != NULL) {

if (temp->data == item) {

cout << "Item found\n";

return;

temp = temp->next;

cout << "Item not found\n";

void dlist::reverse() {

if (head == NULL) {

cout << "List is empty\n";

return;

26
 NODE *current, *prevnode, *nextnode;

current = head;

nextnode = current->next;

prevnode = NULL;

while (current != NULL) {

current->next = prevnode;

prevnode = current;

prevnode->prev = nextnode;

current = nextnode;

nextnode = current->next;

head = prevnode;

int main() {

dlist l;

int choice;

while (1) {

cout << "\n1.Insert\n2.Delete\n3.Display\n4.Search\n5.Reverse\n6.Exit\n";

cout << "Enter your choice: ";

cin >> choice;

switch (choice) {

case 1:

l.insert();

break;

27
 case 2:

l.remove();

break;

case 3:

l.display();

break;

case 4:

l.search();

break;

case 5:

l.reverse();

break;

case 6:

exit(0);

default:

cout << "Wrong Input\nExitting program\n";

exit(0);

return 0;

Output:

1.Insert

2.Delete

28
3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

List is empty

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data: 11

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data: 12

29
1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data: 13

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

11 12 13

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 4

Enter item to search: 12

30
Item found

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 2

Enter data to delete: 12

12Deleted

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 4

Enter item to search: 12

Item not found

1.Insert

2.Delete

3.Display

4.Search

31
5.Reverse

6.Exit

Enter your choice: 3

11 13

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 6

32
Assignment No: 5

Problem Statement: Implement Circular Linked List. Include functions for insertion, deletion and search
of a number, reverse the list.

Program Listing:

#include <iostream>

using namespace std;

struct NODE {

int data;

NODE *next;

};

class clist {

NODE *head;

public:

clist() { head = NULL; }

void insert();

void remove();

void search();

void reverse();

void display();

};

void clist::insert() {

33
 NODE *temp, *current;

temp = new NODE;

cout << "Enter data to insert: ";

cin >> temp->data;

if (head == NULL) {

head = temp;

temp->next = temp;

} else {

current = head;

while (current->next != head) {

current = current->next;

current->next = temp;

temp->next = head;

void clist::remove() {

if (head == NULL) {

cout << "List empty\n";

return;

NODE *temp, *current;

temp = head;

if (temp == temp->next) {

34
 cout << temp->next << " has been deleted\n";

head = NULL;

delete temp;

} else {

while (temp->next != head) {

temp = temp->next;

current = head;

while (current->next != temp) {

current = current->next;

current->next = temp->next;

cout << temp->data << " has been deleted\n";

delete temp;

void clist::display() {

NODE *temp;

if (head == NULL) {

cout << "List is empty";

return;

temp = head;

do {

35
 cout << temp->data << " ";

temp = temp->next;

} while (temp != head);

cout << endl;

void clist::search() {

if (head == NULL) {

cout << "List empty\n";

return;

NODE *temp;

temp = head;

int item;

cout << "Enter item to search: ";

cin >> item;

do {

if (temp->data == item) {

cout << "Item found\n";

return;

temp = temp->next;

} while (temp != head);

cout << "Item not found\n";

36
void clist::reverse() {

if (head == NULL || head == head->next) {

cout << "List empty or has only one element\n";

return;

NODE *current, *prev, *next;

current = head;

prev = next = NULL;

while (1) {

next = current->next;

current->next = prev;

prev = current;

current = next;

if (current == head) {

current->next = prev;

head = prev;

cout << "List reversed\n";

break;

int main() {

37
clist l;

int choice;

while (1) {

cout << "\n1.Insert\n2.Delete\n3.Display\n4.Search\n5.Reverse\n6.Exit\n";

cout << "Enter your choice: ";

cin >> choice;

switch (choice) {

case 1:

l.insert();

break;

case 2:

l.remove();

break;

case 3:

l.display();

break;

case 4:

l.search();

break;

case 5:

l.reverse();

break;

case 6:

exit(0);

default:

38
 cout << "Wrong Input\nExitting program\n";

exit(0);

return 0;

Output:

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

List is empty

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data to insert: 11

39
1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data to insert: 12

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 1

Enter data to insert: 13

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

40
11 12 13

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 5

List reversed

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 3

13 12 11

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

41
6.Exit

Enter your choice: 4

Enter item to search: 11

Item found

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 2

11 has been deleted

1.Insert

2.Delete

3.Display

4.Search

5.Reverse

6.Exit

Enter your choice: 11

Wrong Input

Exitting program

42
Assignment No: 6

Problem Statement: Perform Stack operations using Linked List implementation.

Program Listing:

#include<iostream>

using namespace std;

struct NODE

int data;

NODE *next;

};

class stack_ll

NODE *top;

public:

stack_ll()

top = NULL;

void push(int x);

void pop();

void display();

43
void stack_ll::push(int x)

NODE *temp;

temp = new NODE;

temp->data = x;

temp->next = top;

top = temp;

};

void stack_ll::pop()

if(top == NULL)

cout<<"Stack is empty\n";

return;

NODE *temp;

temp = top;

top = top->next;

cout<<temp->data<<" has been deleted\n";

delete temp;

void stack_ll::display()

44
{

if(top == NULL)

cout<<"Stack is empty\n";

return;

NODE *temp;

temp = top;

while(temp != NULL)

cout<<temp->data<<" ";

temp = temp->next;

int main()

stack_ll s;

int choice, x;

while(1)

cout<<"\n1.Push\n2.Pop\n3.Display\n4.Exit\n";

cout<<"Enter your choice: ";

cin>>choice;

switch(choice)

45
 {

case 1:

cout<<"Enter data to push: ";

cin>>x;

s.push(x);

break;

case 2:

s.pop();

break;

case 3:

s.display();

break;

case 4:

exit(0);

default:

cout<<"Wrong Input\nExitting program\n";

return 0;

Output:

1.Push

2.Pop

3.Display

46
4.Exit

Enter your choice: 3

Stack is empty

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 1

Enter data to push: 12

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 3

12

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 1

Enter data to push: 13

1.Push

47
2.Pop

3.Display

4.Exit

Enter your choice: 3

13 12

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 2

13 has been deleted

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 3

12

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 2

12 has been deleted

48
1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 3

Stack is empty

49
Assignment No: 7

Problem Statement: Perform Stack operations using Array implementation.

Program Listing:

#include<iostream>

using namespace std;

#define size 100

class stack_arr

int top = -1;

int stck[size];

public:

void push(int x);

void pop();

void display();

};

void stack_arr::push(int x)

if(top == size-1)

cout<<"Stack is full\n";

return;

top++;

50
 stck[top] = x;

void stack_arr::pop()

if(top == -1)

cout<<"Stack is empty\n";

return;

cout<<stck[top]<<" has been deleted\n";

top--;

void stack_arr::display()

if(top == -1)

cout<<"Stack is empty\n";

return;

for(int i = top; i >= 0; i--)

cout<<stck[i]<<" ";

51
}

int main()

stack_arr s;

int choice, x;

while(1)

cout<<"\n1.Push\n2.Pop\n3.Display\n4.Exit\n";

cout<<"Enter your choice: ";

cin>>choice;

switch(choice)

case 1:

cout<<"Enter data to push: ";

cin>>x;

s.push(x);

break;

case 2:

s.pop();

break;

case 3:

s.display();

break;

case 4:

52
 exit(0);

default:

cout<<"Wrong Input\nExitting program\n";

return 0;

Output:

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 3

Stack is empty

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 1

Enter data to push: 34134

1.Push

2.Pop

53
3.Display

4.Exit

Enter your choice: 1

Enter data to push: 1343

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 3

1343 34134

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 2

1343 has been deleted

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 2

34134 has been deleted

54
1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 3

Stack is empty

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 2

Stack is empty

1.Push

2.Pop

3.Display

4.Exit

Enter your choice: 4

55
Assignment No: 8

Problem Statement: Perform Queues operations using Circular Array implementation

Program Listing:

#include <iostream>

using namespace std;

#define SIZE 100

class Queue {

private:

int items[SIZE], front, rear;

public:

Queue() { front = rear = -1; }

bool isFull() {

if ((rear + 1) % SIZE == front) {

return true;

return false;

bool isEmpty() {

if (front == -1) {

return true;

return false;

56
}

void enqueue(int value) {

if (isFull()) {

cout << "Queue Overflow\n";

} else {

if (front == -1) {

front = 0;

rear = (rear + 1) % SIZE;

items[rear] = value;

cout << value << " enqueued to queue\n";

int dequeue() {

int item;

if (isEmpty()) {

cout << "Queue Underflow\n";

item = -1;

} else {

item = items[front];

if (front == rear) {

front = rear = -1;

} else {

front = (front + 1) % SIZE;

57
 cout << item << " dequeued from queue\n";

return item;

void display() {

if (isEmpty()) {

cout << "Queue is empty\n";

} else {

cout << "Queue elements are:\n";

for (int i = front; i != rear; i = (i + 1) % SIZE) {

cout << items[i] << " ";

cout << items[rear] << endl;

};

int main() {

Queue q;

int choice, data;

while (1) {

cout << "\n1.Enqueue\n2.Dequeue\n3.Display\n4.Exit\n";

cout << "Enter your choice: ";

cin >> choice;

switch (choice) {

58
 case 1:

cout << "Enter data to insert: ";

cin >> data;

q.enqueue(data);

break;

case 2:

q.dequeue();

break;

case 3:

q.display();

break;

case 4:

exit(0);

default:

cout << "Wrong Input\nExitting program\n";

exit(0);

return 0;

return 0;

Output:

1.Enqueue

2.Dequeue

59
3.Display

4.Exit

Enter your choice: 3

Queue is empty

1.Enqueue

2.Dequeue

3.Display

4.Exit

Enter your choice: 1

Enter data to insert: 11

11 enqueued to queue

1.Enqueue

2.Dequeue

3.Display

4.Exit

Enter your choice: 1

Enter data to insert: 12

12 enqueued to queue

1.Enqueue

2.Dequeue

3.Display

4.Exit

60
Enter your choice: 1

Enter data to insert: 13

13 enqueued to queue

1.Enqueue

2.Dequeue

3.Display

4.Exit

Enter your choice: 3

Queue elements are:

11 12 13

1.Enqueue

2.Dequeue

3.Display

4.Exit

Enter your choice: 2

11 dequeued from queue

1.Enqueue

2.Dequeue

3.Display

4.Exit

Enter your choice: 3

Queue elements are:

61
12 13

1.Enqueue

2.Dequeue

3.Display

4.Exit

Enter your choice: 4

62
Assignment No: 9

Problem Statement: Create and perform different operations on Double-ended Queues using Linked List
implementation.

Program Listing:

#include <iostream>

using namespace std;

struct node {

int data;

node *next;

};

class deque {

node *front, *rear;

public:

deque() { front = rear = NULL; }

void insertFront();

void insertRear();

void deleteFront();

void deleteRear();

void display();

};

void deque::insertFront() {

int x;

63
 cout << "Enter data to insert at front: ";

cin >> x;

node *temp = new node;

temp->data = x;

temp->next = front;

front = temp;

if (front == NULL) {

rear = temp;

void deque::insertRear() {

int x;

cout << "Enter data to insert at rear: ";

cin >> x;

node *temp = new node;

temp->data = x;

temp->next = NULL;

if (rear == NULL) {

front = temp;

rear = temp;

} else {

rear->next = temp;

rear = temp;

64
}

void deque::deleteRear() {

if (rear == NULL) {

cout << "DEQUE Empty\n";

return;

cout << rear->data << " has been deleted\n";

if (front == rear) {

front = rear = NULL;

return;

node *temp = front;

while (temp->next != rear) {

temp = temp->next;

temp->next = NULL;

rear = temp;

void deque::deleteFront() {

if (front == NULL) {

cout << "DEQUE Empty\n";

return;

65
 cout << front->data << " has been deleted\n";

if (front == rear) {

front = rear = NULL;

return;

front = front->next;

void deque::display() {

if (front == NULL) {

cout << "DEQUE Empty\n";

return;

node *temp = front;

while (temp != NULL) {

cout << temp->data << " ";

temp = temp->next;

cout << endl;

int main() {

deque obj;

while (1) {

66
cout << "\n1. Insert at front\n2. Insert at rear\n3. Delete from front\n4. "

"Delete from rear\n5. Display\n6. Exit\n";

cout << "Enter your choice: ";

int ch = 0;

cin >> ch;

switch (ch) {

case 1:

obj.insertFront();

break;

case 2:

obj.insertRear();

break;

case 3:

obj.deleteFront();

break;

case 4:

obj.deleteRear();

break;

case 5:

obj.display();

break;

case 6:

exit(0);

break;

default:

67
 cout << "Invalid choice";

exit(0);

Output:

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 2

Enter data to insert at rear: 12

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 5

12

68
1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 2

Enter data to insert at rear: 14

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 5

12 14

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 2

69
Enter data to insert at rear: 155

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 5

12 14 155

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 1

Enter data to insert at front: 11

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

70
6. Exit

Enter your choice: 5

11 12 14 155

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 1

Enter data to insert at front: 10

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 5

10 11 12 14 155

1. Insert at front

2. Insert at rear

3. Delete from front

71
4. Delete from rear

5. Display

6. Exit

Enter your choice: 3

10 has been deleted

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 5

11 12 14 155

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 4

155 has been deleted

1. Insert at front

72
2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 5

11 12 14

1. Insert at front

2. Insert at rear

3. Delete from front

4. Delete from rear

5. Display

6. Exit

Enter your choice: 6

73
Assignment No: 10

Problem Statement: WAP to scan a polynomial using linked list and add two polynomials.

Program Listing:

#include <iostream>

using namespace std;

struct node {

int coeff;

int power;

node *next;

};

class Polynomial {

node *head;

public:

Polynomial() { head = NULL; }

void read();

void display();

void add(Polynomial, Polynomial);

void add_node_end(int coef, int powe);

};

void Polynomial::add(Polynomial poli1, Polynomial poli2) {

node *ptr1, *ptr2;

74
int coef;

int pow;

ptr1 = poli1.head;

ptr2 = poli2.head;

while (ptr1 != NULL && ptr2 != NULL) {

if (ptr1->power > ptr2->power) {

coef = ptr1->coeff;

pow = ptr1->power;

ptr1 = ptr1->next;

} else if (ptr1->power < ptr2->power) {

coef = ptr2->coeff;

pow = ptr2->power;

ptr2 = ptr2->next;

} else {

coef = ptr1->coeff + ptr2->coeff;

pow = ptr1->power;

ptr1 = ptr1->next;

ptr2 = ptr2->next;

if (coef != 0) {

add_node_end(coef, pow);

if (ptr1 == NULL) {

while (ptr2 != NULL) {

add_node_end(ptr2->coeff, ptr2->power);

75
 ptr2 = ptr2->next;

if (ptr2 == NULL) {

while (ptr1 != NULL) {

add_node_end(ptr1->coeff, ptr1->power);

ptr1 = ptr1->next;

void Polynomial::add_node_end(int coef, int powe) {

node *current, *temp;

temp = new node;

temp->coeff = coef;

temp->power = powe;

temp->next = NULL;

if (head == NULL) {

head = temp;

} else {

current = head;

while(current->next != NULL)

current = current->next;

76
 }

current->next = temp;

void Polynomial::read()

int ch, coef, pow;

cout<<"Enter the terms in descending order of power"<<endl;

while(1)

cout<<"Enter the coefficient: ";

cin>>coef;

cout<<"Enter the power: ";

cin>>pow;

add_node_end(coef, pow);

cout<<"Do you want to continue(1/0): ";

cin>>ch;

if(ch != 1)

break;

77
void Polynomial::display()

if(head != NULL)

cout<< head->coeff << "x^" << head->power;

node *temp = head;

for(temp = temp->next; temp != NULL; temp = temp->next)

if(temp->coeff != 0)

if(temp->coeff > 0)

cout<<" + ";

if(temp->coeff < 0)

cout<< " - ";

temp->coeff = -temp->coeff;

if(temp->power == 0)

cout<< temp->coeff;

78
 else if(temp->power == 1)

cout<< temp->coeff << "x";

else

cout<< temp->coeff << "x^" << temp->power;

int main()

Polynomial p1, p2, p3;

cout<<"Enter the first polynomial: "<<endl;

p1.read();

cout<<"Enter the second polynomial: "<<endl;

p2.read();

p3.add(p1, p2);

cout<<"The first polynomial is: ";

p1.display();

cout<<endl;

cout<<"The second polynomial is: ";

79
 p2.display();

cout<<endl;

cout<<"The sum of the polynomials is: ";

p3.display();

return 0;

Output:

Enter the first polynomial:

Enter the terms in descending order of power

Enter the coefficient: 5

Enter the power: 2

Do you want to continue(1/0): 1

Enter the coefficient: 3

Enter the power: 1

Do you want to continue(1/0): 1

Enter the coefficient: 2

Enter the power: 0

Do you want to continue(1/0): 0

Enter the second polynomial:

Enter the terms in descending order of power

Enter the coefficient: 4

Enter the power: 2

Do you want to continue(1/0): 1

Enter the coefficient: 6

80
Enter the power: 1

Do you want to continue(1/0): 1

Enter the coefficient: 8

Enter the power: 0

Do you want to continue(1/0): 0

The first polynomial is: 5x^2 + 3x + 2

The second polynomial is: 4x^2 + 6x + 8

The sum of the polynomials is: 9x^2 + 9x + 10

81
Assignment No: 11

Problem Statement: WAP to calculate factorial of a given no. (i) using recursion, (ii) using iteration

Program Listing:

#include <iostream>

using namespace std;

class fact {

public:

int itterative(int);

int recursive(int);

};

int fact::itterative(int num) {

int f = 1;

if (num < 0) {

cout << "Negative number not allowed\n";

return -1;

} else if (num == 0) {

return 1;

} else {

for (int i = 1; i <= num; i++) {

f = f * i;

return f;

82
}

int fact::recursive(int num) {

if (num < 0) {

cout << "Negative numbers not allowed\n";

return -1;

} else if (num == 0) {

return 1;

} else {

return (num * fact::recursive(num - 1));

int main() {

fact f;

int choice, factorial, num;

cout << "Enter a number: ";

cin >> num;

cout << "1. ITERATIVE\n2. RECURSIVE\n";

cin >> choice;

switch (choice) {

case 1:

factorial = f.itterative(num);

if (factorial > 0)

cout << num << "! = " << factorial;

83
 break;

case 2:

factorial = f.recursive(num);

if (factorial > 0)

cout << num << "! = " << factorial;

break;

default:

cout << "Wrong Input!!";

Output:

Enter a number: 6

1. ITERATIVE

2. RECURSIVE

6! = 720

84
Assignment No: 12

Problem Statement: WAP to display Fibonacci series (i) using recursion, (ii) using iteration.

Program Listing:

#include <iostream>

using namespace std;

class FIBO {

public:

void fibo_itteration(int);

int fibo_recursion(int);

};

void FIBO::fibo_itteration(int n) {

int n1 = 0, n2 = 1, n3;

cout << "Fibonacci Series: ";

for (int i = 1; i <= n; ++i) {

if (i == 1) {

cout << n1 << ", ";

continue;

if (i == 2) {

cout << n2 << ", ";

continue;

85
 }

n3 = n1 + n2;

n1 = n2;

n2 = n3;

cout << n3 << ", ";

int FIBO::fibo_recursion(int n) {

if ((n == 1) || (n == 0)) {

return (n);

} else {

return (fibo_recursion(n - 1) + fibo_recursion(n - 2));

int main() {

int num, choice;

cout << "Enter number of terms: ";

cin >> num;

FIBO obj;

cout << "1. Itteration\n2. Recursion\n";

cout << "\nEnter your choice: ";

cin >> choice;

86
 switch (choice) {

case 1:

obj.fibo_itteration(num);

break;

case 2:

for (int i = 1; i <= num; i++) {

cout << obj.fibo_recursion(i) << ", ";

Output:

Enter number of terms: 5

1. Itteration

2. Recursion

Enter your choice: 2

1, 1, 2, 3, 5,

87
Assignment No: 13

Problem Statement: WAP to calculate GCD of two numbers (i) with recursion (ii) without recursion.

Program Listing:

// GCD

#include <iostream>

using namespace std;

class GCD {

public:

int gcd_itteration(int, int);

int gcd_recursive(int, int);

};

int GCD::gcd_itteration(int num1, int num2) {

int x;

x = num1 % num2;

while (x != 0) {

num1 = num2;

num2 = x;

x = num1 % num2;

return num2;

88
int GCD::gcd_recursive(int num1, int num2) {

if (num2 != 0) {

return gcd_recursive(num2, (num1 % num2));

} else {

return num1;

int main() {

int n1, n2, gcd = 0;

GCD obj;

cout << "Enter first number: ";

cin >> n1;

cout << "Enter second number: ";

cin >> n2;

cout << "1. Using Itteration\n2. Using Recursion" << endl;

cout << "Enter your choice: ";

int choice;

cin >> choice;

switch (choice) {

case 1:

gcd = obj.gcd_itteration(n1, n2);

break;

case 2:

gcd = obj.gcd_recursive(n1, n2);

89
 break;

default:

cout << "Wrong Choice";

cout << "GCD is: " << gcd << endl;

Output:

Enter first number: 24

Enter second number: 16

1. Using Itteration

2. Using Recursion

Enter your choice: 2

GCD is: 8

90
Assignment No: 14

Problem Statement:

WAP to create a Binary Search Tree and include following operations in tree:

i. Insertion (Recursive and Iterative Implementation)

ii. Deletion by copying

iii. Deletion by Merging

iv. Search a no. in BST

v. Display its preorder, postorder and inorder traversals Recursively

vi. Display its preorder, postorder and inorder traversals Iteratively

vii. Display its level-by-level traversals

viii. Count the non-leaf nodes and leaf nodes

ix. Display height of tree

x. Create a mirror image of tree

xi. Check whether two BSTs are equal or not

Program Listing:

#include <iostream>

#include <stack>

using namespace std;

struct Node {

int data;

Node* left;

Node* right;

Node(int value) : data(value), left(nullptr), right(nullptr) {}

91
};

class BST {

public:

Node* root;

BST() : root(nullptr) {}

// Insertion

void insertRecursive(int value);

void insertIterative(int value);

// Deletion

void deleteByCopying(int value);

void deleteByMerging(int value);

// Search

bool search(int value);

// Traversals (Recursive)

void preorderRecursive(Node* node);

void inorderRecursive(Node* node);

void postorderRecursive(Node* node);

// Traversals (Iterative)

92
 void preorderIterative();

void inorderIterative();

void postorderIterative();

// Level-by-Level Traversal

void levelOrderTraversal();

// Counting Nodes

int countNonLeafNodes();

int countLeafNodes();

// Height

int height(Node* node);

// Mirror Image

void createMirrorImage();

// Equality Check

bool isEqual(BST& other);

private:

// Helper functions for deletion

Node* findMin(Node* node);

Node* findMax(Node* node);

Node* deleteNode(Node* node, int value);

93
 // Helper functions for level order traversal

void printLevel(Node* node, int level);

// Helper functions for insertion, deletion, and mirror image

Node* insertRecursive(Node* node, int value);

Node* createMirrorImage(Node* node);

int countNonLeafNodes(Node* node);

int countLeafNodes(Node* node);

bool isEqual(Node* node1, Node* node2);

};

void BST::insertRecursive(int value) {

root = insertRecursive(root, value);

Node* BST::insertRecursive(Node* node, int value) {

if (node == nullptr) {

return new Node(value);

if (value < node->data) {

node->left = insertRecursive(node->left, value);

} else if (value > node->data) {

node->right = insertRecursive(node->right, value);

94
 }

return node;

void BST::insertIterative(int value) {

if (root == nullptr) {

root = new Node(value);

return;

Node* current = root;

Node* parent = nullptr;

while (current != nullptr) {

parent = current;

if (value < current->data) {

current = current->left;

} else {

current = current->right;

if (value < parent->data) {

95
 parent->left = new Node(value);

} else {

parent->right = new Node(value);

void BST::deleteByCopying(int value) {

root = deleteNode(root, value);

Node* BST::deleteNode(Node* node, int value) {

if (node == nullptr) {

return nullptr;

if (value < node->data) {

node->left = deleteNode(node->left, value);

} else if (value > node->data) {

node->right = deleteNode(node->right, value);

} else { // Found the node to delete

if (node->left == nullptr && node->right == nullptr) { // Leaf node

delete node;

node = nullptr;

} else if (node->left == nullptr) { // One child (right)

Node* temp = node->right;

96
 delete node;

node = temp;

} else if (node->right == nullptr) { // One child (left)

Node* temp = node->left;

delete node;

node = temp;

} else { // Two children

// Find the inorder successor (smallest in the right subtree)

Node* temp = findMin(node->right);

node->data = temp->data;

node->right = deleteNode(node->right, temp->data);

return node;

Node* BST::findMin(Node* node) {

while (node->left != nullptr) {

node = node->left;

return node;

void BST::deleteByMerging(int value) {

97
 root = deleteNode(root, value);

Node* BST::findMax(Node* node) {

while (node->right != nullptr) {

node = node->right;

return node;

bool BST::search(int value) {

Node* current = root;

while (current != nullptr) {

if (value == current->data) {

return true;

} else if (value < current->data) {

current = current->left;

} else {

current = current->right;

return false;

98
void BST::preorderRecursive(Node* node) {

if (node != nullptr) {

cout << node->data << " ";

preorderRecursive(node->left);

preorderRecursive(node->right);

void BST::inorderRecursive(Node* node) {

if (node != nullptr) {

inorderRecursive(node->left);

cout << node->data << " ";

inorderRecursive(node->right);

void BST::postorderRecursive(Node* node) {

if (node != nullptr) {

postorderRecursive(node->left);

postorderRecursive(node->right);

cout << node->data << " ";

void BST::preorderIterative() {

99
 if (root == nullptr) {

return;

Node* current = root;

stack<Node*> s;

while (current != nullptr || !s.empty()) {

while (current != nullptr) {

cout << current->data << " ";

s.push(current);

current = current->left;

if (!s.empty()) {

current = s.top();

s.pop();

current = current->right;

void BST::inorderIterative() {

if (root == nullptr) {

return;

100
 }

Node* current = root;

stack<Node*> s;

while (current != nullptr || !s.empty()) {

while (current != nullptr) {

s.push(current);

current = current->left;

if (!s.empty()) {

current = s.top();

s.pop();

cout << current->data << " ";

current = current->right;

void BST::postorderIterative() {

if (root == nullptr) {

return;

101
 Node* current = root;

stack<Node*> s;

Node* previous = nullptr;

while (current != nullptr || !s.empty()) {

while (current != nullptr) {

s.push(current);

current = current->left;

if (!s.empty()) {

current = s.top();

if (current->right != nullptr && previous != current->right) {

current = current->right;

} else {

cout << current->data << " ";

s.pop();

previous = current;

current = nullptr; // Move to the next node to the left or right

102
void BST::levelOrderTraversal() {

if (root == nullptr) {

return;

for (int i = 1; i <= height(root); i++) {

printLevel(root, i);

cout << endl;

void BST::printLevel(Node* node, int level) {

if (node == nullptr) {

return;

if (level == 1) {

cout << node->data << " ";

} else if (level > 1) {

printLevel(node->left, level - 1);

printLevel(node->right, level - 1);

int BST::countNonLeafNodes() {

103
 return countNonLeafNodes(root);

int BST::countNonLeafNodes(Node* node) {

if (node == nullptr || (node->left == nullptr && node->right == nullptr)) {

return 0;

} else {

return 1 + countNonLeafNodes(node->left) + countNonLeafNodes(node->right);

int BST::countLeafNodes() {

return countLeafNodes(root);

int BST::countLeafNodes(Node* node) {

if (node == nullptr) {

return 0;

} else if (node->left == nullptr && node->right == nullptr) {

return 1;

} else {

return countLeafNodes(node->left) + countLeafNodes(node->right);

104
int BST::height(Node* node) {

if (node == nullptr) {

return 0;

} else {

int leftHeight = height(node->left);

int rightHeight = height(node->right);

return (leftHeight > rightHeight) ? (leftHeight + 1) : (rightHeight + 1);

void BST::createMirrorImage() {

root = createMirrorImage(root);

Node* BST::createMirrorImage(Node* node) {

if (node == nullptr) {

return nullptr;

Node* temp = node->left;

node->left = createMirrorImage(node->right);

node->right = createMirrorImage(temp);

return node;

105
bool BST::isEqual(BST& other) {

return isEqual(root, other.root);

bool BST::isEqual(Node* node1, Node* node2) {

if (node1 == nullptr && node2 == nullptr) {

return true;

} else if (node1 == nullptr || node2 == nullptr) {

return false;

} else if (node1->data != node2->data) {

return false;

} else {

return isEqual(node1->left, node2->left) && isEqual(node1->right, node2->right);

int main() {

BST tree;

int choice, value;

while (true) {

cout << "\nBinary Search Tree Operations Menu:\n";

cout << "1. Insert (Recursive)\n";

cout << "2. Insert (Iterative)\n";

106
cout << "3. Delete by Copying\n";

cout << "4. Delete by Merging\n";

cout << "5. Search\n";

cout << "6. Preorder Traversal (Recursive)\n";

cout << "7. Inorder Traversal (Recursive)\n";

cout << "8. Postorder Traversal (Recursive)\n";

cout << "9. Preorder Traversal (Iterative)\n";

cout << "10. Inorder Traversal (Iterative)\n";

cout << "11. Postorder Traversal (Iterative)\n";

cout << "12. Level Order Traversal\n";

cout << "13. Count Non-Leaf Nodes\n";

cout << "14. Count Leaf Nodes\n";

cout << "15. Height of Tree\n";

cout << "16. Create Mirror Image\n";

cout << "17. Check Equality with Another BST\n";

cout << "18. Exit\n";

cout << "Enter your choice: ";

cin >> choice;

switch (choice) {

case 1:

cout << "Enter value to insert: ";

cin >> value;

tree.insertRecursive(value);

break;

107
case 2:

cout << "Enter value to insert: ";

cin >> value;

tree.insertIterative(value);

break;

case 3:

cout << "Enter value to delete: ";

cin >> value;

tree.deleteByCopying(value);

break;

case 4:

cout << "Enter value to delete: ";

cin >> value;

tree.deleteByMerging(value);

break;

case 5:

cout << "Enter value to search: ";

cin >> value;

if (tree.search(value)) {

cout << "Value found in the BST.\n";

} else {

cout << "Value not found in the BST.\n";

break;

case 6:

108
 cout << "Preorder (Recursive): ";

tree.preorderRecursive(tree.root);

cout << endl;

break;

case 7:

cout << "Inorder (Recursive): ";

tree.inorderRecursive(tree.root);

cout << endl;

break;

case 8:

cout << "Postorder (Recursive): ";

tree.postorderRecursive(tree.root);

cout << endl;

break;

case 9:

cout << "Preorder (Iterative): ";

tree.preorderIterative();

cout << endl;

break;

case 10:

cout << "Inorder (Iterative): ";

tree.inorderIterative();

cout << endl;

break;

case 11:

109
 cout << "Postorder (Iterative): ";

tree.postorderIterative();

cout << endl;

break;

case 12:

cout << "Level Order Traversal: ";

tree.levelOrderTraversal();

cout << endl;

break;

case 13:

cout << "Non-Leaf Nodes: " << tree.countNonLeafNodes() << endl;

break;

case 14:

cout << "Leaf Nodes: " << tree.countLeafNodes() << endl;

break;

case 15:

cout << "Height of Tree: " << tree.height(tree.root) << endl;

break;

case 16:

tree.createMirrorImage();

cout << "Mirror image created.\n";

break;

case 17: {

BST tree2;

cout << "Creating a second BST...\n";

110
 int numElements;

cout << "Enter the number of elements for the second BST: ";

cin >> numElements;

cout << "Enter the values for the second BST:\n";

for (int i = 0; i < numElements; i++) {

int val;

cin >> val;

tree2.insertRecursive(val);

cout << "Trees are equal: " << (tree.isEqual(tree2) ? "Yes" : "No") << endl;

break;

case 18:

cout << "Exiting program.\n";

return 0;

default:

cout << "Invalid choice. Please enter a valid option.\n";

111
Assignment No: 15

Problem Statement: WAP to convert the Sparse Matrix into non-zero form and vice-versa.

Program Listing:

#include<iostream>

using namespace std;

class sparse

int sparse_matrix[10][10];

int s_row, s_col, size_nonzero=0;

int compact_matrix[3][100];

public:

void sparse_input();

void calculate_nonzero();

void calculate_compact_matrix();

void display_compact_matrix();

};

void sparse::sparse_input()

cout<<"Enter number of rows: ";

cin>>s_row;

cout<<"Enter number of comoumns: ";

cin>>s_col;

112
 cout<<"Enter the matrix: \n";

for(int i=0; i<s_row; i++)

for(int j=0; j<s_col; j++)

cin>>sparse_matrix[i][j];

void sparse::calculate_nonzero()

for(int i=0;i<s_row;i++)

for(int j=0;j<s_col;j++)

if(sparse_matrix[i][j]!=0)

size_nonzero++;

void sparse::calculate_compact_matrix()

113
{

calculate_nonzero();

int k=0;

for(int i=0;i<s_row;i++)

for(int j=0;j<s_col;j++)

if(sparse_matrix[i][j]!=0)

compact_matrix[0][k]=i;

compact_matrix[1][k]=j;

compact_matrix[2][k]=sparse_matrix[i][j];

k++;

void sparse::display_compact_matrix()

cout<<"The compact matrix is: \n";

cout<<"Row : ";

for(int i=0; i<s_row; i++)

for(int j=0; j<s_col; j++)

if(sparse_matrix[i][j]!=0)

114
 cout<<i<<" ";

cout<<endl;

cout<<"Coloumn: ";

for(int i=0; i<s_row; i++)

for(int j=0; j<s_col; j++)

if(sparse_matrix[i][j]!=0)

cout<<j<<" ";

cout<<endl;

cout<<"Value : ";

for(int i=0; i<s_row; i++)

for(int j=0; j<s_col; j++)

if(sparse_matrix[i][j]!=0)

cout<<sparse_matrix[i][j]<<" ";

cout<<endl;

class compact

int compact_matrix[3][100];

int sparse_matrix[10][10];

int c_row, c_col, size_nonzero=0;

public:

void compact_input();

void calculate_sparse_matrix();

115
 void sparse_display();

};

void compact::compact_input()

cout<<"Enter number of nonzero elements: ";

cin>>size_nonzero;

for(int i=0; i<size_nonzero; i++)

cout<<"Enter row index: ";

cin>>compact_matrix[0][i];

cout<<"Enter coloumn index: ";

cin>>compact_matrix[1][i];

cout<<"Enter value: ";

cin>>compact_matrix[2][i];

void compact::calculate_sparse_matrix() {

// Determine the dimensions of the sparse matrix

int maxRow = 0;

int maxCol = 0;

for (int i = 0; i < size_nonzero; i++) {

if (compact_matrix[0][i] > maxRow) {

maxRow = compact_matrix[0][i];

116
 }

if (compact_matrix[1][i] > maxCol) {

maxCol = compact_matrix[1][i];

c_row = maxRow + 1; // Add 1 to include the maximum row index

c_col = maxCol + 1; // Add 1 to include the maximum column index

// Initialize the sparse matrix with zeros

for (int i = 0; i < c_row; i++) {

for (int j = 0; j < c_col; j++) {

sparse_matrix[i][j] = 0;

// Populate the sparse matrix from the compact representation

for (int i = 0; i < size_nonzero; i++) {

sparse_matrix[compact_matrix[0][i]][compact_matrix[1][i]] = compact_matrix[2][i];

void compact::sparse_display() {

for (int i = 0; i < c_row; i++) {

for (int j = 0; j < c_col; j++) {

117
 cout << sparse_matrix[i][j] << " ";

cout << endl;

int main()

int choice;

cout<<"1. Sparse matrix to compact matrix\n2. Compact matrix to sparse matrix\n";

cout<<"Enter your choice: ";

cin>>choice;

if(choice==1)

sparse s;

s.sparse_input();

s.calculate_compact_matrix();

s.display_compact_matrix();

else if(choice==2)

compact c;

c.compact_input();

c.calculate_sparse_matrix();

118
 c.sparse_display();

else

cout<<"Wrong Input";

Output:

1. Sparse matrix to compact matrix

2. Compact matrix to sparse matrix

Enter your choice: 1

Enter number of rows: 3

Enter number of comoumns: 3

Enter the matrix:

010

100

011

The compact matrix is:

Row : 0 1 2 2

Coloumn: 1 0 1 2

Value : 1 1 1 1

1. Sparse matrix to compact matrix

2. Compact matrix to sparse matrix

119
Enter your choice: 2

Enter number of nonzero elements: 4

Enter row index: 0

Enter coloumn index: 1

Enter value: 1

Enter row index: 1

Enter coloumn index: 0

Enter value: 1

Enter row index: 2

Enter coloumn index: 1

Enter value: 1

Enter row index: 2

Enter coloumn index: 2

Enter value: 1

010

100

011

120
Assignment No: 16

Problem Statement: WAP to reverse the order of the elements in the stack using additional stack.

Program Listing:

#include <iostream>

using namespace std;

class stack {

int stack[100], top = -1;

public:

void push(int item) {

if (top == 99) {

cout << "Stack Full\n";

return;

top++;

stack[top] = item;

int pop() {

int item;

if (top == -1) {

cout << "Stack Empty\n";

item = 0;

return item;

121
 item = stack[top];

top--;

return item;

};

stack reverse_stack(stack s, int n) {

stack rev;

int item;

for (int i = 0; i < n; i++) {

item = s.pop();

rev.push(item);

return rev;

int main() {

stack s;

int n, item;

cout << "Enter number of elements for the stack: ";

cin >> n;

for (int i = 0; i < n; i++) {

cout << "Enter elements for the stack: \n";

cin >> item;

s.push(item);

122
 }

s = reverse_stack(s, n);

cout << "The reverse stack is: ";

for (int i = 0; i < n; i++) {

cout << s.pop() << " ";

Output:

Enter number of elements for the stack: 5

Enter elements for the stack:

Enter elements for the stack:

Enter elements for the stack:

Enter elements for the stack:

Enter elements for the stack:

The reverse stack is: 1 2 3 4 5

123
Assignment No: 17

Problem Statement: WAP to reverse the order of the elements in the stack using additional Queue.

Program Listing:

#include <iostream>

using namespace std;

class stack {

int stack[100], top = -1;

public:

void push(int item) {

if (top == 99) {

cout << "Stack Full\n";

return;

top++;

stack[top] = item;

int pop() {

int item;

if (top == -1) {

cout << "Stack Empty\n";

item = 0;

return item;

124
 item = stack[top];

top--;

return item;

};

class queue {

int queue[100], front = -1, rear = -1;

public:

void enqueue(int item) {

if (rear == 99) {

cout << "Queue Full\n";

return;

if (front == -1)

front = 0;

rear++;

queue[rear] = item;

int dequeue() {

int item;

if (front == -1 || front > rear) {

cout << "Queue Empty\n";

125
 item = 0;

return item;

item = queue[front];

front++;

return item;

};

stack reverse_stack(stack s, int n) {

queue rev;

int item;

for (int i = 0; i < n; i++) {

item = s.pop();

rev.enqueue(item);

for (int i = 0; i < n; i++) {

item = rev.dequeue();

s.push(item);

return s;

int main() {

stack s;

126
 int n, item;

cout << "Enter number of elements for the stack: ";

cin >> n;

for (int i = 0; i < n; i++) {

cout << "Enter elements for the stack: \n";

cin >> item;

s.push(item);

} // The original stack has the first input value at bottom and last inserted

// value at top

s = reverse_stack(s, n); // the reversed stack has the first inserted value at

// top and last input value at bottom

cout << "The reverse stack is: ";

for (int i = 0; i < n; i++) {

cout << s.pop() << " ";

Output:

Enter number of elements for the stack: 5

Enter elements for the stack:

Enter elements for the stack:

127
Enter elements for the stack:

Enter elements for the stack:

Enter elements for the stack:

The reverse stack is: 1 2 3 4 5

128
Assignment No: 18

Problem Statement: WAP to implement Diagonal Matrix using one-dimensional array.

Program Listing:

#include <iostream>

using namespace std;

class matrix {

int *arr_1d;

int size;

public:

void input() {

cout << "Enter the size of the diagonal matrix: ";

cin >> size;

arr_1d = new int[size];

cout << "Enter the elements of the diagonal matrix: \n";

for (int i = 0; i < size; i++) {

cin >> arr_1d[i];

void display_matrix() {

cout << "The diagonal matrix is: " << endl;

for (int i = 0; i < size; i++) {

for (int j = 0; j < size; j++) {

if (i == j) {

129
 cout << arr_1d[i] << " ";

} else {

cout << "0 ";

cout << endl;

};

int main() {

matrix m;

m.input();

m.display_matrix();

Output:

Enter the size of the diagonal matrix: 5

Enter the elements of the diagonal matrix:

The diagonal matrix is:

130
10000

02000

00300

00040

00005

131
Assignment No: 19

Problem Statement: WAP to implement Lower Triangular Matrix using one-dimensional array.

Program Listing:

#include <iostream>

using namespace std;

class lower_triangular {

int *arr_1d;

int size;

int total_size;

public:

void input_size() {

cout << "Enter the size of the array: ";

cin >> size;

void total_input() {

total_size = 0;

for (int i = 1; i <= size; i++) {

total_size += i;

void array_input() {

total_input();

arr_1d = new int[total_size];

132
 cout << "Enter the elements of the array in row major order: \n";

for (int i = 0; i < total_size; i++) {

cin >> arr_1d[i];

void display_matrix() {

int k = 0;

cout << "The lower triangular matrix is: \n";

for (int i = 0; i < size; i++) {

for (int j = 0; j < size; j++) {

if (i >= j) {

cout << arr_1d[k++] << " ";

} else {

cout << "0 ";

cout << endl;

};

int main() {

lower_triangular obj;

obj.input_size();

obj.array_input();

133
 obj.display_matrix();

Output:

Enter the size of the array: 3

Enter the elements of the array in row major order:

The lower triangular matrix is:

100

230

456

134
Assignment No: 20

Problem Statement: WAP to implement Upper Triangular Matrix using one-dimensional array.

Program Listing:

#include <iostream>

using namespace std;

class upper_triangular {

int *arr_1d;

int size;

int total_size;

public:

void input_size() {

cout << "Enter the size of the array: ";

cin >> size;

void total_input() {

total_size = 0;

for (int i = 1; i <= size; i++) {

total_size += i;

void array_input() {

total_input();

arr_1d = new int[total_size];

135
 cout << "Enter the elements of the array in row major order: \n";

for (int i = 0; i < total_size; i++) {

cin >> arr_1d[i];

void display_matrix() {

int k = 0;

cout << "The upper triangular matrix is: \n";

for (int i = 0; i < size; i++) {

for (int j = 0; j < size; j++) {

if (i <= j) {

cout << arr_1d[k++] << " ";

} else {

cout << "0 ";

cout << endl;

};

int main() {

upper_triangular obj;

obj.input_size();

obj.array_input();

136
 obj.display_matrix();

Output:

Enter the size of the array: 3

Enter the elements of the array in row major order:

The matrix is:

123

045

006

137
Assignment No: 21

Problem Statement: WAP to implement Symmetric Matrix using one-dimensional array.

#include <iostream>

using namespace std;

class SymmetricMatrix {

private:

int *data;

int size;

int index(int row, int col) const {

if (row > col) {

swap(row, col);

return (row * size) - (row * (row + 1) / 2) + col;

public:

SymmetricMatrix(int n) : size(n) { data = new int[n * (n + 1) / 2](); }

void set(int row, int col, int value) {

if (row < size && col < size) {

data[index(row, col)] = value;

} else {

138
 cerr << "Index out of bounds.\n";

int get(int row, int col) const {

if (row < size && col < size) {

return data[index(row, col)];

} else {

cerr << "Index out of bounds.\n";

return 0;

void print() const {

for (int i = 0; i < size; ++i) {

for (int j = 0; j < size; ++j) {

cout << get(i, j) << " ";

cout << endl;

};

int main() {

int n;

139
 cout << "Enter the size of the symmetric matrix: ";

cin >> n;

SymmetricMatrix matrix(n);

cout << "Enter the elements for the symmetric matrix:\n";

for (int i = 0; i < n; ++i) {

for (int j = i; j < n; ++j) {

int value;

cout << "Enter value for (" << i << ", " << j << "): ";

cin >> value;

matrix.set(i, j, value);

cout << "\nSymmetric Matrix:\n";

matrix.print();

return 0;

Output:

Enter the size of the symmetric matrix: 3

Enter the elements for the symmetric matrix:

Enter value for (0, 0): 1

140
Enter value for (0, 1): 2

Enter value for (0, 2): 3

Enter value for (1, 1): 4

Enter value for (1, 2): 5

Enter value for (2, 2): 6

Symmetric Matrix:

123

245

356

141