(d) Explain Adjacency matrix and path matrix of a given graph with example.

2. (a) Explain Dynamic Storage Management.

(b) Given single circular linked list containing a set of data. Obtain the reverse direction of links from the data structure .

3. (a) Explain how arithmetic expressions are evaluated using stack.

(b) Evaluate the following expression:

7 5 2 + * 4 1 5 -/ –

4. Explain the procedure to insert an element and delete an element into and from a Deduce

respectively.

5. Derive an algorithm for determining whether the two binary trees T1 and T2 are similaror not . Out of these T1 is represented with linked storage representation and T2 is represented with sequential storage representation