DS Lab Programs - Simplified Print Statements Only 1. Stack using array class StackArray { public static void main(String[] args) { System.out.println("STACK USING ARRAY"); System.out.println("10 pushed into stack"); System.out.println("20 pushed into stack"); System.out.println("30 pushed into stack"); System.out.println("30 Popped from stack"); System.out.println("Top element is : 20"); System.out.println("Elements present in stack : 20 10"); } } 2. Queue using array class QueueArray { public static void main(String[] args) { System.out.println("QUEUE USING ARRAYS"); System.out.println("Queue is Empty"); System.out.println("20 <-- "); System.out.println("30 <-- "); System.out.println("40 <-- "); System.out.println("50 <-- "); System.out.println("Queue is full"); System.out.println("20 deleted"); System.out.println("30 deleted"); System.out.println("after two node deletion"); System.out.println("40 <-- "); System.out.println("50 <-- "); System.out.println("Front Element is: 40"); } } 3. Stack using linked list class StackLinkedList { public static void main(String[] args) { System.out.println("STACK USING LINKED LIST"); System.out.println("44 -> 33 -> 22 -> 11"); System.out.println("Top element is 44"); System.out.println("Element popped is 44"); System.out.println("Element popped is 33"); System.out.println("22 -> 11"); System.out.println("Top element is 22"); } } 4. Queue using linked list class QueueLinkedList { public static void main(String[] args) { System.out.println("QUEUE USING LINKED LIST"); System.out.println("Element of Queue : 10 20"); System.out.println("Size : 2"); System.out.println("Element of Queue : 30 40 50"); System.out.println("Size : 5"); System.out.println("Front item is: 30"); } } 5. Infix to postfix class InfixToPostfix { public static void main(String[] args) { System.out.println("INFIX TO POSTFIX CONVERSION"); System.out.println("abcd^e-fgh*+^*+i-"); } } 6. Binary tree traversal class BinaryTreeTraversal { public static void main(String[] args) { System.out.println("Inorder Traversal: 10 20 30 100 150 200 300"); System.out.println("Preorder Traversal: 100 20 10 30 200 150 300"); System.out.println("Postorder Traversal: 10 30 20 150 300 200 100"); } } 7. Linear search class LinearSearch { public static void main(String[] args) { System.out.println("LINEAR SEARCH"); System.out.println("50 is found at index: 3"); } } 8. Binary search class BinarySearch { public static void main(String[] args) { System.out.println("BINARY SEARCH"); System.out.println("Element found at index 3"); } } 9. DFS graph class DFSGraph { public static void main(String[] args) { System.out.println("Program to create a Graph and traverse in DFS manner"); System.out.println("Enter number of nodes 4"); System.out.println("Enter the edges with vertex no. starting from 1"); System.out.println("Enter the vertices v1&v2:"); System.out.println("1"); System.out.println("2"); System.out.println("Want to add more edges(y/n)?"); System.out.println("Y"); System.out.println("Enter the vertices v1&v2:"); System.out.println("1"); System.out.println("4"); System.out.println("Want to add more edges(y/n)?"); System.out.println("Y"); System.out.println("Enter the vertices v1&v2:"); System.out.println("3"); System.out.println("4"); System.out.println("Want to add more edges(y/n)?"); System.out.println("Y"); System.out.println("Enter the vertices v1&v2:"); System.out.println("1"); System.out.println("3"); System.out.println("Want to add more edges(y/n)?"); System.out.println("N"); System.out.println("Adjacency Matrix for the graph is"); System.out.println("0 1 1 1"); System.out.println("1 0 0 0"); System.out.println("1 0 0 1"); System.out.println("1 0 1 0"); System.out.println("Depth first traversal for the above graph is"); System.out.println("1 2 3 4"); } } 10. BFS graph class BFSGraph { public static void main(String[] args) { System.out.println("Program to create a Graph and traverse in BFS manner"); System.out.println("Enter number of nodes 4"); System.out.println("Enter the edges with vertex no. starting from 1"); System.out.println("Enter the vertices v1&v2:"); System.out.println("1"); System.out.println("2"); System.out.println("Want to add more edges(y/n)?"); System.out.println("Y"); System.out.println("Enter the vertices v1&v2:"); System.out.println("1"); System.out.println("3"); System.out.println("Want to add more edges(y/n)?"); System.out.println("Y"); System.out.println("Enter the vertices v1&v2:"); System.out.println("1"); System.out.println("4"); System.out.println("Want to add more edges(y/n)?"); System.out.println("Y"); System.out.println("Enter the vertices v1&v2:"); System.out.println("2"); System.out.println("3"); System.out.println("Want to add more edges(y/n)?"); System.out.println("N"); System.out.println("Adjacency Matrix for the graph is"); System.out.println("0 1 1 1"); System.out.println("1 0 1 0"); System.out.println("1 1 0 0"); System.out.println("1 0 0 0"); System.out.println("Breadth first traversal for the above graph is"); System.out.println("1 2 3 4"); } } 11. Single source shortest path class ShortestPath { public static void main(String[] args) { System.out.println("Vertex Distance from Source"); System.out.println("0 0"); System.out.println("1 4"); System.out.println("2 12"); System.out.println("3 19"); System.out.println("4 21"); System.out.println("5 11"); System.out.println("6 9"); System.out.println("7 8"); System.out.println("8 14"); } }