What are arrays in data in Data Structure?

 


If you want to make your career in the field of programming, then the first thing you have to learn is the basics of arrays. After that only, you could do the array problem solving questions.

              

Let us know what an array is.

 

An array is the collection of elements of the same data type stored at contiguous memory locations

 

What are the uses of an Array?

 

An array is a collection of elements of the same data type and its size sequence is fixed.

An array is a derived data type. When we want to store a large amount of data , or access or manipulate a large amount of data, then we use arrays.

In an Array all elements have the common name.

Arrays work on index numbers. The index of an array starts from 0 and ends with size-1. The collection of the same data type where each element has a separate memory location. An array is static and is a part of linear data structure.

 

 

What are the characteristicsof an array?

 

Have a look at some of the main characteristics of an array?

 

All the elements of an array have the same name and they are separated from one another by an index number.

We can modify the elements of an array separately without affecting other elements.

Index numbers have a very crucial role when we call an element.

The elements of an array are stored in contiguous memory locations.

The size of an array depends on the type of array and numbers of elements.

 

Types of Array.

 

There are basically two types of array.

1.     Single dimensional array

2.     Multi dimensional array

 

What is a single dimensional array?

 

Single dimensional array is an array that is defined with only one index.

Single dimensional array is used for searching and sorting.

 

Syntax:

Data type Array name [size];

      Example……

 int ar [20];

 

What is multi dimensional array?

 

Multi dimensional array is that which works with a double index. It is used for matrix manuculation.

 

Syntax….

Data type Array name[size][size];

   Example…..                

                             Int ar[30][10];

 

Write a program to find a sum of five nos. using Array in C language.

 

#include<stdio.h>

#include<conio.h>

void main()

{

int a[5]={18,10,17,34,21};

int i,s=0;

clrscr();

printf("Entered elements of arrays =");

for(i=0;i<5;i++)

{

printf("\n%d",a[i]);

s=s+a[i];

}

printf("\nSum=%d",s);

getch();

}

 

OUTPUT

 

Enter the elements of arrays =

18

10

17

34

21

Sum = 100

Comments

Post a Comment

Popular posts from this blog

What is Data Structure and Algorithm?

Image
  Data Structure is the method of collecting and organizing data in an organized way. So, that we can perform different types of operations on these data in a very effective way. Data Structure is a way of rendering data elements in terms of some relationship. Data Structure and Algorithm is a process of better organization and storage of data elements. For example, we have some data which has student’s name with Roll no. Like a student named Rohit and his roll number is 26. Here “Rohit” is of String data type and 26 is of integer data type. We can organize these data as a record lie student record, which will have both students’ names abc their roll number on it. Now we can collect and store the student’s record in a database or file as a data structure. For example “Rohit” 26, “Arman”5, “Sushil” 34.                                          If you know about the concepts of Object-Oriented Programming, then you are aware that class also does the same thing as a data structure.
Read more

What is a linked list and what are its characteristics?

Data structure is a very vast field. In data structure , today we will define a linked list in data structure.            What is Linked List?                   Linked list is a linear data structure which overcomes the limitation of another data structure array.                          In the linked list, each element is considered as an object. Unlike array, in Linked list, there is no any contiguous memory structure. Here each element is linked to the next element through a pointer.                            Every element in the linked list is called Node. Each node contains a key and an additional pointer which points to the next element in the list. The initial pinter of the linked list is called head. Here one thing to clear is that head is not another node but a pointer to the first element of the Linked list. The value of Head will be null for an empty Linked List.                                       What are the characteristics of a linked list?   Read out below the chara
Read more