DSA Java Project – Family Tree Builder
Program 1 // Project: Family Tree Builder (Based on BT and Linked list) /* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each...
DSA using Java Tutorials
DSA Java Project – Traffic Light Simulation
Program 1 // Project: Traffic Light Simulation Using Queue Linked List //———————————————————- // Features: // Add vehicles to queue (simulating arrival) // Process vehicles when the signal turns green // Show vehicles in the...
DSA Java Project – Restaurant Order Processing System
Program 1 // Project: Restaurant Order Processing System(Based on Doubly linked list and DQUEUE) /* Features: 1. Add order at the end of the queue (new order) 2. Serve the first order (remove from...
DSA Java Project – Movie Ticket Booking System
Program 1 // Movie Ticket Booking System( Based on 2D Array) import java.util.Scanner; class Seat { boolean booked; String name; public Seat() { booked = false; name = “”; } } public class MovieTheater...
DSA Java Project – To Do List
Program 1 // To-Do List Using Singly Linked List import java.util.Scanner; class Task { int id; String description; boolean completed; Task next; public Task(int id, String description) { this.id = id; this.description = description;...
DSA Java Project – Library Book Management System
Program 1 // Library Book Management System import java.util.Scanner; class Book { int id; String title; String author; Book prev; Book next; Book(int id, String title, String author) { this.id = id; this.title =...
Implementation of Queue using Array in DSA Java
Program 1 package dataflair; import java.util.Scanner; public class MyQueue { private int rear = -1; private int front = 0; private final int MAXSIZE = 10; private int queue[] = new int[MAXSIZE]; Scanner scan...
Shell Sort in Data Structures using Java
Program 1 import java.util.*; class ShellSort { public static void main(String args[]) { int a[],n,i; Scanner scan=new Scanner(System.in); System.out.println(“Enter the limit of array: “); n=scan.nextInt(); a=new int[n]; System.out.println(“Enter element in array”); for(i=0;i<n;i++) a[i]=scan.nextInt(); shellsort_method(a,n);...
Merge Sort in Data Structures using Java
Program 1 //Program for Merge sort import java.util.*; class TestMerge { public static void main(String args[]) { int a[],m,n,i,j,temp; Scanner scan=new Scanner(System.in); System.out.println(“Enter limit of array”); m=scan.nextInt(); a=new int[m]; System.out.println(“Enter elements in array”); for(i=0;i<m;i++)...
Tower of Hanoi in Data Structures using Java
Program 1 // Program for tower of Hanoi import java.util.*; class Tower { public static void main(String args[]) { int n; Scanner scan=new Scanner(System.in); System.out.println(“Enter Number of disk”); n=scan.nextInt(); move(n,’A’,’B’,’C’); } public static void...
