Program segment for the deletion of any element from the queue

delmq(i)  /* Delete any element from queue i */

{

int i,x;

if ( front[i] == rear[i])

printf("Queue is empty");

{

x = mqueue[front[i]];

front[i] = front[i]-1 ;

return x;

}

}

Posted Date: 4/10/2013 1:40:37 AM | Location : United States

Ask an Expert

Related Discussions:- Deletion of any element from the queue, Assignment Help, Ask Question on Deletion of any element from the queue, Get Answer, Expert's Help, Deletion of any element from the queue Discussions

Write discussion on Deletion of any element from the queue
Your posts are moderated

Write your message here..

Related Questions

Insertion of a key into a b-tree, Example: Insertion of a key 33 into a B-... Example: Insertion of a key 33 into a B-Tree (w/split) Step 1: Search first node for key closet to 33. Key 30 was determined. Step 2: Node pointed through key 30, is se

What is string, What is String Carrier set of the String ADT is the s... What is String Carrier set of the String ADT is the set of all finite sequences of characters from some alphabet, including empty sequence (the empty string). Operations on s

Time complexity, The  total  of  time  needed  by  an algorithm to run to i... The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

Algorithm to add element in the end of circular linked list, Q. Write down ... Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

Dynamic programming., Count Scorecards(30 points) In a tournament, N playe... Count Scorecards(30 points) In a tournament, N players play against each other exactly once. Each game results in either of the player winning. There are no ties. You have given a

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

Hash table, Programming for hash table? Programming for hash table?

Total impedent of the circuit, an electrical student designed a circuit in... an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

Sorted list followed by a few "random" elements, You have to sort a list L ... You have to sort a list L having of a sorted list followed by a few "random" elements. Which sorting methods would be especially suitable for this type of task?   Insertion sort

All pairs shortest paths algorithm, In the last section, we discussed regar... In the last section, we discussed regarding shortest path algorithm that starts with a single source and determines shortest path to all vertices in the graph. In this section, we