Advertisement

12.09.1998 at 10:28PM PST, ID: 10107022
[x]
Attachment Details

Questions about QUEUE...

[x]
The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

  • The Grade of the Solution
  • The Zone Rank of the Expert Providing the Solution
  • The Number of Author and Expert Comments
  • The Number of Experts Contributing
  • The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!
6.0
Zone:

C Programming Language

Here questions about QUEUE, can give your suggest answer??:
1st question:
Write the functions needed for the implementation of queues in a linear array when it can be assumed that the queue can be
emptied when necessary.
Write a function Append that will add an entry if there is room and, if not, will call another function ServeAll(Queue *Q) that
will empty queue. While writing this second function, you may assume the existence of an auxiliary function Service(QueueEntry
x) that will process a single entry that you have just removed from the queue.




2nd question:
By creating nodes and freeing nodes, write functions
   a.Append; and
   b.Serve
that will process entries for linked queues and that can be substituted directly for their contiguous counterparts.



3rd question:
Write the following C functions for linked queues.
   a.QueueEmpty
   b.ClearQueue
   c.QueueFront
   d.QueueFrontNode
QueueFrontNode returns a pointer to the node at the front of the queue, whereas QueueFront returns a copy of the front
entry.


Any way Thank You for helping.
Start your 7 day free trial to see this answer
Answered By: RONSLOW
Expert Since: 04/17/1997
Accepted Solutions: 808
RONSLOW has been an Expert for 11 years 8 months, during which he has posted 3774 comments and answered 808 questions. RONSLOW is just one of 581 experts in the C Programming Language Zone. 5 experts collaborated on this answer, which was graded a "C" by the asker.
 
 
20081119-EE-VQP-48 - Hierarchy