What is TCPMon ?

TCPMon is a utility that allows the user to monitor the messages passed along in TCP based conversation. It is based on a swing UI and works on almost all platforms that Java supports.It has originally being part of Axis1 and now stands as an independent project.

TCPMon can be used in several ways. sush as : 

1. As an Explicit Intermediate
2. As a Request Sender for Web Services
3. As a Proxy
4. Slow Connection Simulation
5. HTTP Proxy support

For more information refer page about TCPMon in Apache web site : TCPMon

How to install TCPMon on Ubuntu.

Installing TCPMon on Ubuntu is quite easy task. What you have to do is just follow the following steps. 

1.Download the zip package from Apache TCPMon release (Only the Binary Version)

2.Go to you dowload directory and copy the zip file to your preferred destination

3.Open terminal and nevigate to the folder where you copy the zip file

4.Type in the termina " unzip tcpmon-1.0-bin.zip " and unzip it

1. type cd tcpmon-1.0-bin/build and hit enter
2. type chmod 777 tcpmon.sh and hit enter

7.finally type ./tcpmon.sh Thats it

When you are hoping to work with Google Maps Android  API v2 you may require SHA1 key. In this post i`m going to tell you how to obtain SHA1 Key from you machine.

To get the fingerprint(SHA1 ) just follow the below instructions :

Step 1 :

Go to - C:\Program Files\Java\jdk1.7.0_25\bin

Step 2 :

Inside the bin folder there is a .exe file which is named as "jarsigner.exe". Double click on the .exe file and run it.

Step 3:

open command prompt (press Windows Key + R then type "cmd" without quotations in the appearing dialogue box and then press Enter Key).

then type the code sniff below :

cd C:\Program Files\Java\jdk1.7.0_25\bin

then again type on cmd :

keytool -list -keystore "C:/Documents and Settings/Your Name/.android/debug.keystore"

Step 4:

Then it will ask for Keystore password now. The default password if "android" type and enter


Now Your are Done. You will have a Key Like Below :)

Tree Traversal 

Identify Tree Elements First..

Introduction..

       Here we are going to talk about Tree traversal. In computer science, that refers to the process of visiting each node in a tree structure,exactly once, in a systematic way. As in the above diagram nodes are indicated as circles. These kind of traversals are classified by the order in which the nodes are visited. In this post we are going to talk about traversing using algorithms in binary trees. this processes are not only true for the binary trees. Those can be generalized to the other trees as well (i.e ternary trees.).

Traversing in a Binary Tree..

            To traverse a binary tree there exist several different ways. Starting at the root of a binary tree( First node of the tree), there are three main steps that can be performed and the order in which they are performed  defines the traversal type. These steps (in no particular order) are: performing an action on the current node (referred to as "visiting" the node), traversing to the left child node, and traversing to the right child node.

Recursion and Co-Recursion..

Recursion..

Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to iteration). The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.

Resource : http://en.wikipedia.org/wiki/Recursion_(computer_science)
Co-Recursion..   

In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case. Put simply, corecursive algorithms use the data that they themselves produce, bit by bit, as they become available, and needed, to produce further bits of data. Some authors refer to this as generative recursion.           

Resource : http://en.wikipedia.org/wiki/Corecursion

Traversing a tree can be done in several ways. Normally how we do is we use iterating method to visit all the nodes in the tree.  Because from a given node there is more than one possible next node (it is not a linear data structure), then, assuming sequential computation (not parallel), some nodes must be deferred – stored in some way for later visiting. We do this using either stack or a queue. those data structures have implemented using  LIFO (Last In First Out) and FIFO (First inf Last Out) principles. As we know tree is a recursively defined data structure. Its known as self-referential data structures.  In a tree traversing can  be done in either recursion or either in corecursion manner. Usually we use recursion to traverse the tree.

There are two strategies that we used to traverse a tree. One is call Depth First and Other one is call the Breadth First.For the purpose of illustration, it is assumed that left nodes always have priority over right nodes. This ordering can be reversed as long as the same ordering is assumed for all traversal methods. Depth First Search can be easily implemented using a stack where as the breadth first traversal can be easily implemented using a queue.

Depth-first traversal is easily implemented via a stack, including recursively (via the call stack), while breadth-first traversal is easily implemented via a queue, including corecursively. For the purpose of illustration, it is assumed that left nodes always have priority over right nodes. This ordering can be reversed as long as the same ordering is assumed for all traversal methods.

Depth First 

In depth first traversal there are three main types of traversal methods are exist. Namely

1. Pre- Order Traversal 
2. In-Order Traversal
3. Post- Order Traversal

For a binary tree they are defined in the following way.

Pre- Order Traversal

 In pre-order traversal we follow 3 steps as listed below.

1. Visit the root
2. Traverse the left subtree.
3. Traverse  the right subtree.

In-Order Traversal

As pre-order traversal there also exist 3 methods to traverse the tree.

1. Traverse the left subtree
2. Visit the root
3. Traverse the right subtree

Post-Order Traversal

1. Traverse the left subtree
2. Traverse the right subtree
3. Visit the root

Through the following examples you may be able to figure out how we visit a binary tree in each of above mentioned method.

Breadth First 

Any tree can also be traversed in level-order, where we visit every node on a level before going to a lower level.

eg : Traverses the tree or graph level-by-level, visiting the nodes of the tree above in the order a b c d e f g h i j k.