Help needed in C++

Experts,
i need an answer for the question, of queue class in C++. Dont ask me what queue class, because i dont know? I just want to know what a Queue class in C++ Programming mean???

Thanks in Advance
LVL 4
manavsiAsked:
Who is Participating?
 
d1rtyw0rmConnect With a Mentor Commented:
Queue class is similar to a 'printer queue' where all document is awaiting to be proceed when the current one will be finished.

A common scenario in applications is having a pool of worker threads that has to process several objects waiting in a queue. The operation to be executed on the waiting objects is the same, but it can be carried out by different threads on different objects.
0
 
manavsiAuthor Commented:
experts also please explain me about list class please... Any suggestions and resource links regarding this would be appreciated... Thanks..
0
 
Let_Me_BeCommented:
0
Cloud Class® Course: Amazon Web Services - Basic

Are you thinking about creating an Amazon Web Services account for your business? Not sure where to start? In this course you’ll get an overview of the history of AWS and take a tour of their user interface.

 
Let_Me_BeCommented:
0
 
manavsiAuthor Commented:
sorry evilrix,
This is not an HomeWork question, i am learning C++ and came across this topic in Standard Template Library, Chapter and just wanted to clarify regarding that, and nothing else... :)

Manavsi
0
 
d1rtyw0rmCommented:
Do you want more specification or it's ok like that ? :P
0
 
manavsiAuthor Commented:
i got that d1rtyw0rm, can you explain list like this please.. I want to understand the concept and later the syntax...
0
 
d1rtyw0rmConnect With a Mentor Commented:
List is similar to a tower where you can put item into.

1st stage = hello
2nd = manavsi
3rd = from
4nd = d1rtyw0rm

And then you can consult the list in order to get the item that you want.

Lists are a kind of sequence containers. As such, their elements are ordered following a linear sequence.

List containers are implemented as doubly-linked lists; Doubly linked lists can store each of the elements they contain in different and unrelated storage locations. The ordering is kept by the association to each element of a link to the element preceding it and a link to the element following it.

This provides the following advantages to list containers:


Efficient insertion and removal of elements anywhere in the container (constant time).
Efficient moving elements and block of elements within the container or even between different containers (constant time).
Iterating over the elements in forward or reverse order (linear time).
0
 
manavsiAuthor Commented:
d1rtyw0rm, you were great.. thanks.. i now understand it.. THANKS A LOT
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.