DSA - Circular LINK LIST & STACK QUE

Document Sample
DSA - Circular LINK LIST & STACK QUE Powered By Docstoc
					DATA STRUCTURES & ALGORITHMS
BSIT Fall 2007                                 Lab Instructor: Ms. Maria Chauhdary
LAB Circular Linked List                        Teacher Assistant: M. Yaser Razzaq


Objective:
 To look at an Implementations of Linear Double & Circular Double Link List.
TASK 1:

      Complete the Implementation of Linear Double Link List discussed in class.
      Should implement following Functions:

      o   insertAtHead( value );
      o   insertAtTail( value );
      o   insertBefore( key, value );
      o   insertAfter( key, value );
      o   deleteAfter( key );
      o   deleteBefore( key);
      o   deleteFromHead( );
      o   deleteFromTail( );
      o   searchNode( key );

TASK 2:

      Complete the Implementation of Circular Double Link List discussed in class.
      Should implement following Functions:

      o   insertAtHead( value );
      o   insertAtTail( value );
      o   insertBefore( key, value );
      o   insertAfter( key, value );
      o   deleteAfter( key );
      o   deleteBefore( key);
      o   deleteFromHead( );
      o   deleteFromTail( );
      o   searchNode( key );
                                  POST LAB TASKS

TASK 1:

     Complete the ADT of Linked Based Queue discussed in class.
     Should implement following Functions:

     o    Constructor.
     o    Destructor
     o    Void enQueue( int );
     o    int deQueue() ;
     o    int isEmpty();


TASK 2:

     Complete the ADT of Linked Based Stack discussed in class.
     Should implement following Functions:

     o    Constructor.
     o    Destructor.
     o    void push( int );
     o     int pop();
     o     int stackTop();
     o    int isEmpty();




               “The Race is not over, because I have not yet won”
                                  [Anonymous]

				
DOCUMENT INFO