Builds a batch file to create hidden shares for a bunch of sub-directories (eg, User shares)

Deletes all files and folders from a directory, including read-only and
hidden files and folders. DelAll starts in the directory you tell it,
removes all read-only and hidden attributes from all the files, removes
all of the subfolders and then all files therein. When DelAll is done,
you will be left in the directory from which you called DelAll. The
directory that you want cleaned will not be deleted.

KillProc will do a search of all the current processes and kill all that
match the name given. If the process name is misspelled, KillProc would
kill itself, based on the match. The 'find /v /i "KillProc"' part of the
search prevents KillProc from killing the CMD window it is running in.

Requires NT Resourcekit

Automated offline backup for Exchange server.
Requires ROBOCOPY from NTRK or other copy utility.
Requires manual adjustments

start remote admin connection from command line

A utility class that gets the MD5 hash of an input stream. Also includes a method for converting byte array to hex-formatted string.

Read a eight bytes in little endian order from the given InputStream and create a long out of them.

What is Dijkstra Algorithm? click on the link above and first understand what the algorithm is all about. in short it calculates the shortest path from A to F or vise versa. This code i can guarantee is the simplest and easiest code to understand. just search on google and try to compare this code and other dijkstra code and you will see what i am talking about. i spent alot of time myself and my instructor to guide me on the rite path.
http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm(Description)
to see how the algorithm really works go on this website it tells you step by step how to update the cost and which path to choose.
http://renaud.waldura.com/doc/java/dijkstra/
Please give some time to understand the algorithm first and then you can see my code. if you done understand the algorithm it is very useless. i know alot of people need Dijkstra algorithm in java for their HW assignment or Test. i am giving you the solution step by step. anyone who wants to understand please go to the url i have posted above and once you have understand then run the code and for those people who just want to copy so that they can get 90% in their test No Problem Here it is .
First open a notepad and name that file anything like data.txt or datas.txt and make sure the file looks something like this and in this format.
0 3 100 5 100 100 (100 represents infinity)
3 0 6 7 7 100
100 6 0 5 5 3
5 7 5 0 1 100
100 7 5 1 0 2
100 100 3 100 2 0
i name this file as a data.txt file. i have 6 nodes. and A is always the starting node which has the cost of 0 so by looking at the first line i
know that A to A have distance 0, A to B is 3, A to c is Infinity, A to D is 5, A to E is Infinity(means no edge connected with A), A to F is Infinity.
for second line(B to A is 3, and then vise versa) and for the 3rd line it starts for C and etc..
save the txt file by any name and then copy the code which i have posted and then to run type this:
javac routing.java
java routing data.txt
you will get the output. i will say this one more time understand how the algorithm works or ......................

To create a chatprogram in java we need 2 classes one for Client and one for Server from which the client will be able to connect and exchange text messages. to compile the code simply type these commands in command prompt window:-
1)ipconfig(memorize the Ip address)
2)javac client.java
3)javac server.java
4)java server 10.69.23.203 (You need to type your own ip address)
5) After this you need to open another command prompt window(Make sure the server command prompt window is also open). now type:
java client 10.69.23.203
Thats it.
if anyone have any problems please post a comment and i will answer all of your questions or if you are having trouble in compiling.

Servlet returning an image.