CBSE Class 12 Computer Science Data Structures Concepts

In Computer Science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, Stacks are used in function call during execution of a program, while B-trees are particularly well-suited for implementation of databases. The data structure can be classified into following two types: Simple Data Structure: These data structures are normally built from primitive data types like integers, floats, characters. For example arrays and structure. Compound Data Structure: simple data structures can be combined in various ways to form more complex structure called compound structures. Linked Lists, Stack, Queues and Trees are examples of compound data structure.

Data Structure Arrays

Data structure array is defined as linear sequence of finite number of objects of same type with following set of operation:

¶ Creating : defining an array of required size

¶ Insertion: addition of a new data element in the in the array

¶ Deletion: removal of a data element from the array

¶ Searching: searching for the specified data from the array

¶ Traversing: processing all the data elements of the array

¶ Sorting : arranging data elements of the array in increasing or decreasing order

¶ Merging : combining elements of two similar types of arrays to form a new array of same type

In C++ an array can be defined as

Datatype arrayname[size];

Please refer to attached file for CBSE Class 12 Computer Science Data Structures Concepts