Types of Queue<\/strong><\/p>\n\n\n\n

1. Linear Queue<\/strong><\/li>
2. Circular Queue<\/strong><\/li>
3. Priority Queue<\/strong><\/li><\/ol>\n\n\n\n

   Linear Queue<\/strong><\/p>\n\n\n\n

   Algorithm: Insert Operation on <\/strong>Queue<\/strong><\/p>\n\n\n\n

   Step 1: If Rear=Max-1<\/strong><\/p>\n\n\n\n

   Print \u201cOverflow : Queue is full\u201d and Exit<\/strong><\/p>\n\n\n\n

   End If<\/strong><\/p>\n\n\n\n

   Step 2: If Front=-1<\/strong><\/p>\n\n\n\n

   Set Front =0<\/strong><\/p>\n\n\n\n

   End If<\/strong><\/p>\n\n\n\n

   Step 3: Rear=Rear+1<\/strong><\/p>\n\n\n\n

   Step 4: Queue[Rear]=Element<\/strong><\/p>\n\n\n\n

   Step 5: End<\/strong><\/p>\n\n\n\n

   Algorithm: Delete Operation on Queue<\/strong><\/p>\n\n\n\n

   Step 1: If Front=-1<\/strong><\/p>\n\n\n\n

   Print \u201cUnderflow: Queue is empty\u201d and Exit<\/strong><\/p>\n\n\n\n

   End if<\/strong><\/p>\n\n\n\n

   Step 2: Set Del_element=Queue[Front]<\/strong><\/p>\n\n\n\n

   Step 3: If Front=Rear<\/strong><\/p>\n\n\n\n

   Set Front=Rear=-1<\/strong><\/p>\n\n\n\n

   Else<\/strong><\/p>\n\n\n\n

   Front=Front+1<\/strong><\/p>\n\n\n\n

   End If<\/strong><\/p>\n\n\n\n

   Step 4: Return Del_Element<\/strong><\/p>\n\n\n\n

   Step 5: End<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"

   What is Queue? Queue is a liner data structure.it means elements in this data structure have a unique predecessor and a unique successor. Queue follows First In First Out (FIFO) technique. Initial value of Rear and Front is -1 which is known as centennial value. When new Element is inserted in a Queue then Rear is Incremented by one […]<\/p>\n","protected":false},"author":1,"featured_media":499,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,3,9,8],"tags":[],"class_list":["post-498","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-12th-computer-science","category-bca","category-cbse-12th-computer-science","category-jac-12th-computer-science"],"_links":{"self":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/498","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/comments?post=498"}],"version-history":[{"count":1,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/498\/revisions"}],"predecessor-version":[{"id":500,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/498\/revisions\/500"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media\/499"}],"wp:attachment":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media?parent=498"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/categories?post=498"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/tags?post=498"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}