Data Structure
part 1 of DS
I was learning DS as a part of my MCA syllabus and thought to write some blogs on data structure one topic at a time. from the basic beginning to the end of the difficult part. this blog is about basic of ds firstly what are data structure? they are basically arrangements or collection of data so that they can be used efficiently.
things to keep in ming-Arrangement and Operation and inside main memory. every application deals with some data, that data has to be in the main memory. how can we arrange them for efficient use. that arrangement is called a data structure. array, matrices, LinkedList are physical data structure-how arranges they define how memory should be organized during storing of data stacks, queues, trees, graph, hashing, recursion, sorting are logical data structure-implemented using array and linked list
some terms to keep in mind: database-how data is organized in hard disk in some model like a relational model. commercial data- it can be categorized into 2 parts operational- which is used currently legacy data/old data - kept as storage somewhere so that is can be used later. so the large size data which is kept is called a data warehouse. storing and analyzing very large size data, that study is called big data to be continued...
