Create a Java class called Student with the following details as variables within it.
Write a Java program to implement the Stack using arrays.
Design a superclass called Staff with details as StaffId, Name, Phone, Salary.
Write a Java class called Customer to store their name and date_of_birth.
Write a Java program to read two integers a andb. Compute a/b and print, when b is not zero.
Write a Java program that implements a multi-thread application that has three threads.
Sort a given set of n integer elements using Quick Sort method and compute its time complexity.
Sort a given set of n integer elements using Merge Sort method and compute its time
Implement in Java, the 0/1 Knapsack problem using Dynamic Programming method
Implement in Java, the 0/1 Knapsack problem using Greedy method.
From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.
Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal'salgorithm.
Find Minimum Cost Spanning Tree of a given connected undirected graph using Prim's algorithm.
Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
Implement Travelling Sales Person problem using Dynamic programming.
Design and implement in Java to find a subset of a given set S = {Sl, S2,.....,Sn} of n positive integers
Design and implement in Java to find all Hamiltonian Cycles in a connected undirected Graph G