1. Write a Program to implement stack operations using arrays.
Ans: class StackArray {
int top = -1;
int[] stack = new int[5];
void push(int data) {
if (top == 4) {
[Link]("Stack Overflow");
return;
stack[++top] = data;
void pop() {
if (top == -1) {
[Link]("Stack Underflow");
return;
top--;
}
void display() {
for (int i = 0; i <= top; i++)
[Link](stack[i] + " ");
[Link]();
2. Write a Program to implement stack operations using Linked list.
ans class StackLL {
class Node {
int data;
Node next;
Node(int data) { [Link] = data; }
Node top;
void push(int data) {
Node node = new Node(data);
[Link] = top;
top = node;
}
void pop() {
if (top == null) {
[Link]("Stack Underflow");
return;
top = [Link];
void display() {
Node temp = top;
while (temp != null) {
[Link]([Link] + " ");
temp = [Link];
[Link]();
3. Write a Program to implement queue operations using arrays
Ans: class QueueArray {
int front = 0, rear = 0;
int[] queue = new int[5];
void enqueue(int data) {
if (rear == 5) {
[Link]("Queue Overflow");
return;
queue[rear++] = data;
void dequeue() {
if (front == rear) {
[Link]("Queue Underflow");
return;
front++;
void display() {
for (int i = front; i < rear; i++)
[Link](queue[i] + " ");
[Link]();
4. Write a Program to implement Queue operations using linked list
Ans: class QueueLL {
class Node {
int data;
Node next;
Node(int data) { [Link] = data; }
Node front, rear;
void enqueue(int data) {
Node node = new Node(data);
if (rear == null) front = rear = node;
else {
[Link] = node;
rear = node;
}
void dequeue() {
if (front == null) {
[Link]("Queue Underflow");
return;
front = [Link];
if (front == null) rear = null;
void display() {
Node temp = front;
while (temp != null) {
[Link]([Link] + " ");
temp = [Link];
[Link]();
5. Write a Program to implement Binary Search using recursion
Ans: int binarySearch(int[] arr, int left, int right, int target) {
if (left > right) return -1;
int mid = (left + right) / 2;
if (arr[mid] == target) return mid;
else if (arr[mid] > target)
return binarySearch(arr, left, mid - 1, target);
else
return binarySearch(arr, mid + 1, right, target);
6. Write a Program to implement Linear Search using recursion
Ans: int linearSearch(int[] arr, int index, int target) {
if (index >= [Link]) return -1;
if (arr[index] == target) return index;
return linearSearch(arr, index + 1, target);
7. Write a program to implement quicksort.
Ans: void quickSort(int[] arr, int low, int high) {
if (low < high) {
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
int partition(int[] arr, int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (arr[j] <= pivot) {
i++;
int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp;
int temp = arr[i+1]; arr[i+1] = arr[high]; arr[high] = temp;
return i + 1;
8. Write a program to implement Merge sort.
Ans: void mergeSort(int[] arr, int l, int r) {
if (l < r) {
int m = (l + r) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
void merge(int[] arr, int l, int m, int r) {
int[] left = [Link](arr, l, m + 1);
int[] right = [Link](arr, m + 1, r + 1);
int i = 0, j = 0, k = l;
while (i < [Link] && j < [Link])
arr[k++] = left[i] <= right[j] ? left[i++] : right[j++];
while (i < [Link]) arr[k++] = left[i++];
while (j < [Link]) arr[k++] = right[j++];
9. Write a program to implement Insertion sort.
Ans: void insertionSort(int[] arr) {
for (int i = 1; i < [Link]; i++) {
int key = arr[i], j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
arr[j + 1] = key;
}
10. Write a program to implement Selection sort.
Ans: void selectionSort(int[] arr) {
for (int i = 0; i < [Link] - 1; i++) {
int minIdx = i;
for (int j = i + 1; j < [Link]; j++)
if (arr[j] < arr[minIdx])
minIdx = j;
int temp = arr[minIdx]; arr[minIdx] = arr[i]; arr[i] = temp;
11. Write a Program for the Evaluation of a given postfix expression
Ans: int evaluatePostfix(String expr) {
Stack<Integer> stack = new Stack<>();
for (char c : [Link]()) {
if ([Link](c)) [Link](c - '0');
else {
int b = [Link]();
int a = [Link]();
switch (c) {
case '+': [Link](a + b); break;
case '-': [Link](a - b); break;
case '*': [Link](a * b); break;
case '/': [Link](a / b); break;
return [Link]();
12. Write a program to implement the Infix to Postfix expression
Ans: String infixToPostfix(String expr) {
StringBuilder result = new StringBuilder();
Stack<Character> stack = new Stack<>();
Map<Character, Integer> precedence = [Link]('+', 1, '-', 1, '*', 2, '/', 2, '^', 3);
for (char c : [Link]()) {
if ([Link](c)) [Link](c);
else if (c == '(') [Link](c);
else if (c == ')') {
while (![Link]() && [Link]() != '(')
[Link]([Link]());
[Link]();
} else {
while (![Link]() && [Link](c, 0) <=
[Link]([Link](), 0))
[Link]([Link]());
[Link](c);
while (![Link]()) [Link]([Link]());
return [Link]();
