StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
text
Body
copied!<p>As per my understanding data structure is any data residing in memory of any electronic system that can be efficiently managed. Many times it is a game of memory or faster accessibility of data. In terms of memory again, there are tradeoffs done with the management of data based on cost to the company of that end product. Efficiently managed tells us how best the data can be accessed based on the primary requirement of the end product. This is a very high level explanation but data structures is a vast subjects. Most of the interviewers dive into data structures that they can afford to discuss in the interviews depending on the time they have, which are linked lists and related subjects.</p> <p>Now, these data types can be divided into primitive, abstract, composite, based on the way they are logically constructed and accessed. </p> <ul> <li><strong>primitive data structures</strong> are basic building blocks for all data structures, they have a continuous memory for them: boolean, char, int, float, double, string.</li> <li><strong>composite data structures</strong> are data structures that are composed of more than one primitive data types.class, structure, union, array/record.</li> <li><strong>abstract datatypes</strong> are composite datatypes that have way to access them efficiently which is called as an algorithm. Depending on the way the data is accessed data structures are divided into linear and non linear datatypes. Linked lists, stacks, queues, etc are linear data types. heaps, binary trees and hash tables etc are non linear data types.</li> </ul> <p>I hope this helps you dive in.</p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload