There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Monica Shiralkar wrote:
Gerard Gauthier wrote: areas of memory that can hold data.
What does areas of memory that can hold data mean. Even a string is also an area of memory that can hold data.
Monica Shiralkar wrote:I read that data structures in Java include Stacks , Queues. How is it decided whether a particular member of collections interface is a data structure or not. Thanks
Experience keeps a dear School, but Fools will learn in no other.
---
Benjamin Franklin - Postal official and Weather observer
...data structures.unpackaged, indexed
Monica Shiralkar wrote:I have heard a common interview question "have you worked on data structures ".Seeing what's mentioned in this thread each and every candidate would have worked on String atleast which is also a data structure .
Experience keeps a dear School, but Fools will learn in no other.
---
Benjamin Franklin - Postal official and Weather observer
Monica Shiralkar wrote:I read that data structures in Java include Stacks , Queues. How is it decided whether a particular member of collections interface is a data structure or not. Thanks
code is emotional
Paul Clapham wrote:
Monica Shiralkar wrote:I have heard a common interview question "have you worked on data structures ".Seeing what's mentioned in this thread each and every candidate would have worked on String atleast which is also a data structure .
And you should also ask what is meant by "worked on". I have been working in Java for many years and I don't believe I ever "worked on" a data structure. If you want to limit yourself to sets and maps and lists and things like that, I never "worked on" any of them. I just chose a suitable data structure for my data and went on with the actual work. Those are wheels which do not need to be re-invented.
Don't get me started about those stupid light bulbs. |