CBSE Class 12 Computer Science Arrays Stacks Queues And Linked List Worksheet Set A

Defination of Datastructure

A data structure is a logical method of representing data in memory using the simple and complex data types provided by the language.

Arrays:

An array is collection of the homogeneous elements that are referred by a common name. It is also called a subscripted variable as the elements of an array are used by the name of an array and an index or subscript.

Array are of two types:

1. One-dimensional arrays 2. Multi-dimensional arrays.

Address Calculation:

The array elements are stored in contiguous memory locations by sequential allocation technique.

Address of arr[i] = B+(I-LB)*S

Sequential Allocation:

The process of storing elements in a fixed order in a data structure where the time required for such access is dependent on the order of the elements.

Using Row Major order the add of a [i] [j] is given by,

Address of a [i] [j]= B+[(i-LB1)*N+(j-LB2)]*S

Using column Major order the add of a [i] [j] is given by,

Address of a [i] [j]= B+[(i-LB1)+(j-LB2)*M]*

One Dimensional Array:

The simplest type of data structure is a one dimensional array in which each elements of a linear array is referenced by one subscript. 

The operations one normally perform on any linear structure include the following:

Please click the link below to download full pdf file for CBSE Class 12 Computer Science - Arrays & Linked List.