0% found this document useful (0 votes)
4 views2 pages

Dsusing JavaLab Set

The document outlines a series of Java programming tasks organized into ten sets. Each set includes various algorithms and data structure implementations, such as solving the Towers of Hanoi problem, converting expressions, and performing operations on stacks, queues, and linked lists. The tasks also cover sorting algorithms and graph representations.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views2 pages

Dsusing JavaLab Set

The document outlines a series of Java programming tasks organized into ten sets. Each set includes various algorithms and data structure implementations, such as solving the Towers of Hanoi problem, converting expressions, and performing operations on stacks, queues, and linked lists. The tasks also cover sorting algorithms and graph representations.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

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.

You might also like