{"id":4119,"date":"2023-08-28T11:29:03","date_gmt":"2023-08-28T05:59:03","guid":{"rendered":"https:\/\/cbsepython.in\/?p=4119"},"modified":"2023-08-28T11:29:03","modified_gmt":"2023-08-28T05:59:03","slug":"data-structures-class-12-notes","status":"publish","type":"post","link":"https:\/\/cbsepython.in\/data-structures-class-12-notes\/","title":{"rendered":"Data Structures Class 12 Notes"},"content":{"rendered":"

Data Structures Class 12 Notes<\/span><\/h2>\n

DATA STRUCTURES<\/strong><\/span><\/p>\n

A data structure defines a mechanism to store, organise and access data along with operations (processing) that can be efficiently performed on the data. A data structure is a group of data that have different data types which can be accessed as a unit .<\/span><\/p>\n

For example, string is a data structure containing a sequence of elements where each element is a character. On the other hand, list is a sequence data structures in which each element may be of different types.We can apply different operations like reversal, slicing, counting of elements etc. on list and string. <\/span><\/p>\n

Hence, a data structure organises a multiple elements in a way so that certain operations on each elements as well as the collective data unit could be performed easily.<\/span><\/p>\n

Data Structures Class 12 Notes<\/span><\/span><\/h3>\n

 <\/p>\n

Data type vs Data structure<\/span><\/h3>\n

\u2022 A data type defines a set of values along with well-defined operations stating its <\/span>input-output behavior. <\/span>
\n\u2022 A data structure is a physical implementation that clearly defines a way of storing, <\/span>accessing, manipulating data stored in a data structure. <\/span>
\nFor example, List as a data type which can store heterogeneous data type of elements, <\/span>but when implemented as data structure its behavior is clearly prescribed (searching, <\/span>sorting etc.)<\/span><\/p>\n

 <\/p>\n

Implementation of data structures can be done in two ways.<\/span><\/h2>\n

Simple Data Structures : <\/strong>Built from primitive data types(integers, real, character, boolean). Example Array or Linear list<\/span><\/p>\n

Compound Data Structures :<\/strong> Simple data structures are used to form more data structure . They are classified into two types<\/span><\/p>\n

1.Linear :<\/strong> Means elements are stored in sequential order. <\/span><\/p>\n

Example: Stack, Queue, Linked List<\/span><\/p>\n

2.Non Linear :<\/strong> Data can be stored as multilevel structures. <\/span><\/p>\n

Example Trees, Graph<\/span><\/p>\n

(Only similarity between stack and queue is that both belong to linear data structures)<\/span><\/p>\n

Data Structures Class 12 Notes<\/span><\/span><\/h3>\n

What is Stack?<\/span><\/h2>\n