Algorithm for insertion into the circular queue, Data Structure & Algorithms

Assignment Help:

Algorithm for insertion of any element into the circular queue:

Step-1: If "rear" of the queue is pointing at the last position then go to step-2 or else Step-3

Step-2: make the "rear" value as 0

Step-3: increase the "rear" value by one

Step-4: a. if the "front" points where "rear" is pointing & the queue holds a not NULL value for it, then it's a "queue overflow" state, thus quit; else go to step-b

b. Insert the new value for the queue position pointed by the "rear"

Related Discussions:- Algorithm for insertion into the circular queue

Delete a given specific node from a doubly linked list. , D elete a specif...

D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[

Infix expression to postfix form using the stack function, Q. Convert the f...

Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

Pre-order and post order traversal of a binary tree, The pre-order and post...

The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum One node

Data structures, 1. You are required to hand in both a hard copy and an el...

1. You are required to hand in both a hard copy and an electronic copy of the written report on the project described in A, including all the diagrams you have drawn. 2. You

Array, extra key inserted at end of array is called

extra key inserted at end of array is called

The threaded binary tree, By changing the NULL lines in a binary tree to th...

By changing the NULL lines in a binary tree to the special links called threads, it is possible to execute traversal, insertion and deletion without using either a stack or recursi

The complexity of searching an element, The complexity of searching an elem...

The complexity of searching an element from a set of n elements using Binary search algorithm is O(log n)

Deletion from a red-black tree, Deletion in a RBT uses two main processes, ...

Deletion in a RBT uses two main processes, namely, Procedure 1: This is utilized to delete an element in a given Red-Black Tree. It involves the method of deletion utilized in

Order of the matrix, /* The program accepts matrix like input & prints the ...

/* The program accepts matrix like input & prints the 3-tuple representation of it*/ #include void main() { int a[5][5],rows,columns,i,j; printf("enter the order of

Explain about the string abstract data type operations, Explain about the S...

Explain about the String Abstract data type operations Symbol ADT has no concatenation operations, but presuming we have a full-featured String ADT, symbols can be concatenated

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages