Queue most important topic

Types of queue :-                                                                                         "   Four types  of  queue. 

• Simple queue 
• Circular queue 
• Priority queue 
• Double ended queue 

    // main important topic for circular queue insertion and deletion operation.. 

Insertion an element  algorithm circular queue.. 

Step1, start

Step2, if (front==(rear+1) max, then "overflow"

Step3, else

               { rear=(rear+1)max

                  queue[rear]=element ;

              If ( front== - 1)

                    front==0;

                      } 

Step4, stop. 

//circular queue deletion algorithm.. 

 Deletion an element algorithm circular queue.. 

Step1, start

Step2, if ( front=rear) & & (rear==-1)

                then, "underflw" and return                 
Step3, else                                                                      

             { element =queue[front] 

            if (front==rear) 

                  front=rear= - 1

             else

                  front=(front+1)max

                    }

Strp4, stop. 

// main important topic inked list. 

Qns 1,, what is linked list and how these are Represent in the memory.. 

Qns 2, what is circular linked list, and how many types insert and delete //

                 

Ans2, // noted these point some hint are,, 

Circular linked list three types insert and delete

• Beginning position 
• Middle position (specific position)
• Ending position

// Simple algorithm for circular linked list at beginning position insertion & deletion...