Depth First Search (DFS) is an algorithm for traversing a graph or a tree(any acyclic connected graph is a tree). We start at a starting node, traverse on a single path in the graph, backtrack when the path ends and again traverse non-visited paths while backtracking. DFS has the following…
We can use reflection feature of Java to invoke methods of a Java class. Suppose we have a class Employee, with getter methods for fields – name, age sex, salary, city. A user may want to send an array of property names to a method and based on the input…
Sometimes we may need to read data from a file in a Java class and this file lies in the same package as that of the class. Different Java classes may need to read data from a file lying in their own package. If all the files in different packages…