What is the Importance and uses of data stuctures in Programming using C/C++ when using it?
.How Stack,Queue,and list works and give example problem that solve stacks (note:this is not a code program).t.y..i want your different opinions...pls...reply this tread..

>What is the Importance and uses of data stuctures in Programming using C/C++ when using it?
That should be intuitively obvious. Data is critical to programming and storing that data in effective ways is equally critical.

>How Stack,Queue,and list works and give example problem that solve stacks
This reeks of homework. As such, I'll fall back on the usual answer of "show me yours and I'll show you mine".

I think data storage and retrieval + usage of memory effeciently etc are the concepts that are the basis of Data Structure,...
answer my Few Question: -

In a drawing software can you tell me how many shapes are needed ?

In a Account Management System how many account holder your program can handle ?

this leads to the memory management, people often answer that they would utilize the heap to solve such problems....okey fine you utilizes the heap. now let talk about the retrieval of data...... infact you need the dynamic linkage between account holder to go forth and back...........how would you implement search! i.e. how can you figure out the specific account holder..... there are several problems which directly maps to the data structures....

Array is also a data structure , that provides you with Random Iterator . i.e. you can get anywhere within the bounds by indexing....why you need arrays. Again if you don't know how many of ints you need ? what you will do ? you'll either create a list or vector(similar to arrays).....................

Data structure not only stores information in a decent way but also provide the decent retrieval interface required by the problem... list, queues, stacks are linear structures you can think beyond that, Associative Structures.... maps in C++.

HOW STACK, QUEUES and list works
The three structures above are linear structure they provide different ways of retrieval, list is the most general structure that provide you to enter data at the beginning or at the end (dequeue=double ended queue). stack is the special structure allows you to enter the values on the top (like stacks of plates you can put(push) the plate on the top and remove(pop) from the top).. the opposite operation is provided by Queue....its depends upon your requirements whether to use the stacks or queues......

Hope you get the idea........