Set 1
Write a Java program to solve Towers of Hanoi problem using recursion.
Write a Java program to convert an infix expression to postfix expression using a stack.
Set 2
Implement a Java program to check whether a given string is a palindrome using character
arrays.
Implement a Java program to perform push, pop, and display operations on a stack using
arrays.
Set 3
Write a Java program to perform insert, delete, and display operations on a queue using
arrays.
Write a Java program to solve Towers of Hanoi problem using recursion.
Set 4
Implement a Java program to perform push, pop, and display operations on a stack using
arrays.
Implement a Java program to sort an array of integers using Quick Sort algorithm.
Set 5
Implement a Java program to perform addition, subtraction, and multiplication of two
matrices.
Write a Java program to evaluate a postfix expression using stack.
Set 6
Implement a Java program to create a doubly linked list and traverse it in both directions.
Write a Java program to represent a graph using adjacency matrix.
Set 7
Write a Java program to perform addition, subtraction, and multiplication of two matrices.
Implement a Java program for Depth-First Search (DFS) traversal on a graph.
Set 8
Implement a Java program to check whether a given string is a palindrome using character
arrays.
Write a Java program to represent a graph using adjacency list.
Set 9
Write a Java program to perform insert, delete, and display operations on a queue using
arrays.
Implement a Java program to sort an array of integers using Quick Sort algorithm.
Set 10
Implement a Java program to create a singly linked list and perform insertion and deletion
operations.
Write a Java program to solve Towers of Hanoi problem using recursion.