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

Name the four data type groups, There are four data type groups: I...

There are four data type groups: Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

Explain about the abstract data type, Explain about the Abstract data type ...

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

Characteristics of good algorithms, What do we mean by algorithm? What are ...

What do we mean by algorithm? What are the characteristics of a good and relevant algorithm? An algorithm is "a step-by-step procedure for finishing some task'' An algorithm c

Algorithm, write an algorithm given each students name and grade points for...

write an algorithm given each students name and grade points for six courses.find his grade point average and group students into the gpa groups 3.5

Define techniques of dry running of flowcharts, Explain the term- Dry runni...

Explain the term- Dry running of flowcharts Dry running of flowcharts is essentially a technique to: Determine output for a known set of data to check it carries out th

Shortest path algorithms, A driver takes shortest possible route to attain ...

A driver takes shortest possible route to attain destination. The problem which we will discuss here is similar to this type of finding shortest route in any specific graph. The gr

Two sparce matrices multipilcation algorithm, Write an algorithm for multi...

Write an algorithm for multiplication of two sparse matrices using Linked Lists.

Stack, infix to revrse polish

infix to revrse polish

Operation of algorithm, Operation of Algorithm The following sequence o...

Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou

Various passes of bubble sort, Q. Show the various passes of bubble sort on...

Q. Show the various passes of bubble sort on the unsorted given list 11, 15, 2, 13, 6 Ans: The given data is as follows:- Pass 1:- 11 15 2 13

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages