Tutorial

1. Write a procedure Add(Node * p1, *p2) that will add/multiply two polynomials represented by doubly linked lists whose head nodes are pointed by P1 & P2 2. consider p(x,y,z)=2xy2z3+3x2yz2+4xy3z+5xy3z+5x2y2 rewrite so that terms are ordered lexicographically , that is x in ascending order, for equal x powers y in a.o., then z in a.o 3. Write a procedure to count the no. of nodes in a one way linked list 4. Search for info 'x' and delete that node if it is found (one way) 5. Reverse the direction of the links in a one way linked circular list