undefined | unit 3 arrays

C PPS

UNIT 3ARRAYS Q1) Explain one dimensional array?A1)One Dimensional Array:The array which is used to represent and store data in a linear form is called as 'single or one dimensional array.'Syntax:data-type array_name[size];

Example 2:

int a[3] = {2, 3, 5};

char ch[10] = "Data" ;

float x[3] = {2.5, 3.50,489.98} ;

Total Size of an array(in Bytes) can be calculated as follows: total size(in bytes) = length of array * size of data type In above example, a is an array of type integer which has storage size of 3 elements. One integer variable occupies 2 bytes. Hence the total size would be 3 * 2 = 6 bytes. Q2) Write a program to display the elements of single dimensional array?A2)

#include<stdio.h>
#include<conio.h>
void main()
{
int a[20];
int n,i;
printf("\n Enter the size of array :");
scanf("%d",&n);
printf("size of array is %d",n);
printf("\n Enter Values to store in array one by one by pressing ENTER :");

for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\n The Values in array are..");

for(i=0;i<n;i++)
{
printf("\n %d",a[i]);
}
getch();
}

P2: Program to copy 1-D array to another 1-D array Q4) Write a program to reverse the array?A4)

#include <stdio.h>

#include<conio.h>

void main()

{

int n, i, j, a[100], b[100];// a is original array and b is reversed array

printf("Enter the number of elements in array\n");

scanf("%d", &n);

printf("Enter the array elements\n");

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

scanf("%d", &a[i]);

* Copying elements into array b starting from end of array a

for (i = n - 1, j = 0; i >= 0; i--, j++)

b[j] = a[i];

Printing reversed array b

printf("Reverse array is\n");

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

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

getch();

}

Output: Q5) Explain multi- dimensional array?A5)1-D array has 1 row and multiple columns but multidimensional array has of multiple rows and multiple columns. Two Dimensional array: It is the simplest multidimensional array. They are also called as matrix. Declaration: data-type array_name[no.of rows][no. of columns]; Total no of elements= No.of rows * No. of Columns Example 3: int a[2][3]This example illustrates two dimensional array a of 2 rows and 3 columns. Col 0 Col 1 Col 2 Row 0

a[0][0]

a[0][1]

a[0][2]

a[1][0]

a[1][1]

a[1][2]

Row 1 Fig.2: Index positions of elements of a[2][3] Total no of elements: 2*3=6 Total no of bytes occupied: 6( total no.of elements )*2(Size of one element)=12 Q6) Explain initialization and storage representation?A6)In C, two dimensional arrays can be initialized in different number of ways. Specification of no. of columns in 2 dimensional array is mandatory while no of rows is optional.int a[2][3]={{1,3,0}, // Elements of 1st row {-1,5,9}}; // Elements of 2nd row OR int a[][3]={{1,3,0}, // Elements of 1st row {-1,5,9}}; // Elements of 2nd row OR int a[2][3]={1,3,0,-1,5,9}; Fig. 3 gives general storage representation of 2 dimensional array Col 0 Col 1 Col n Row 0

a[0][0]

a[0][1]

---

a[0][n]

a[1][0]

a[1][1]

---

a[1][n]

a[m][0]

a[m][1]

a[m][n]

Row 1 - - Row m Fig.3 General Storage Representation of 2 dimensional array. Eg 4. int a[2][3]={1,3,0,-1,5,9}

-1

Row 0 Row 1 Col 0 col1 col2 Q7) Explain how to access two dimensional array elements?A7)An element in 2-dimensional array is accessed by using the subscripts i.e. row index and column index of the array. For example:int val = A[1][2];The above statement will access element from the 2nd row and third column of the array A i.e. element 9.Q8) Explain character array and strings?A8)If the size of array is n then index ranges from 0 to n-1. There can be array of integer, floating point or character values. Character array is called as String.

Eg.1 A=

0 1 2 3 4

This example illustrates integer array A of size 5.

Array index ranges from 0 to 4.

Elements of array are {10, 20, 40, 5, 25}.

Arrays can be categorized in following types

One dimensional array

Multi Dimensional array

These are described below.The abstract model of string is implemented by defining a character array data type and we need to include header file ‘string.h’, to hold all the relevant operations of string. The string header file enables user to view complete string and perform various operation on the string. E.g. we can call ‘strlen’ function to find length of string, ‘strcat’ to concatenate two string, ‘strcpy’ to copy one string to another, ‘strrev’ to reverse the string. The definitions of all these functions are stored in the header file ‘string.h’. So string functions with the user provided data becomes the new data type in ‘C’. Q9) Explain string manipulation in C language ?A9) Strings are also called as the array of character.

A special character usually known as null character (\0) is used to indicate the end of the string.

To read and write the string in C program %s access specifier is required.

C language provides several built in functions for the manipulation of the string

To use the built in functions for string, user need to include string.h header file.

Syntax for declaring string is

Char string name[size of string]; Char is the data type, user can give any name to the string by following all the rules of defining name of variable. Size of the string is the number of alphabet user wants to store in string. Q10) Explain linear search ?A10)Thus Algorithm for Linear Search is1. start at one end of the list 2. if the current element is not equal to the search target, move to the next element, 3. stop when a match is found or the opposite end of the list is reached. Function for Linear search is

find(values, target)

{

for( i = 0; i < values.length; i++)

{

if (values[i] == target)

{ return i; }

}

return –1;

}

If element is found this function returns index of that element otherwise it returns –1.Example : we have an array of integers, like the following:

Elements 	9	6	7	12	1	5
Index 	0	1	2	3	4	5

Let’s search for the number 7. According to function for linear search index for element 7 should be returned. We start at the beginning and check the first element in the array.

First element is 9.Match is not found and hence we move to next element i.e 6.

Again match is not found so move to next element i.e.7.

9	6	7	12	1	5
0	1	2	3	4	5

We found the match at the index position 2. Hence output is 2. If we try to find element 10 in above array, it will return –1,as 10 is not present in the array. Q11) Explain the complexity analysis of linear search ?A11)An algorithm can be analyzed using following three cases. 1. Worst case 2. Average case 3. Best case 1. Worst case : In Linear search worst case happens when element to be searched is not present. When x is not present, the linear search function compares it with all the elements of A one by one. The size of A is n and hence x is to be compared with all n elements. Thus, the worst case time complexity of linear search would be O(n). 2. Average case : In average case analysis, we take all possible inputs and calculate computing time for all of the inputs. Sum all the calculated values and divide the sum by total number of inputs. Following is the value of average case time complexity. Average Case Time = = = O (n)3. Best Case : In linear search , the best case occurs when x is present at the first location. So time complexity in the best case would be O(1). Q12) Write a program for linear search ?A12)

#include<stdio.h> #include<conio.h> int search(int [],int, int); void main() { int a[20],k,i,n,m; clrscr(); printf(“\n\n ENTER THE SIZE OF ARRAY”); scanf(“%d”,&n); printf(“\n\nENTER THE ARRAY ELEMENTS\n\n”); for(i=0;i<n;i++) {
scanf(“%d”,&a[i]); }
printf(“\n\nENTER THE ELEMENT FOR SEARCH\n”); scanf(“%d”,&k); m=search(a,n,k); if(m==–1) { printf(“\n\nELEMENT IS NOT FOUND IN LIST”); } else { printf(“\n\nELEMENT IS FOUND AT LOCATION %d”,m); } } getch(); } int search(int a[],int n,int k) { int i; for(i=0;i<n;i++) { if(a[i]==k) { return i; } } if(i==n) { return –1; }
}

Q13) Write a program for binary search?A13)

#include<stdio.h>

#include<conio.h>

void main()

{

int n,i,search,f=0,low,high,mid,a[20];

clrscr();

printf("Enter the number of elements:");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

printf("Enter the number in ascending order a[%d]=",i);

scanf("%d",&a[i]);

}

printf("Enter the element to be searched:");

scanf("%d",&search);

low=0;

high=n–1;

while(low<=high)

{

mid=(low+high)/2;

if(search<a[mid])

{

high=mid–1;

}

else if(search>a[mid])

{

low=mid+1;

}

else

{

f=1;

printf("Element is found at the position %d:",mid);

exit();

}

if(f==0)

{

printf("Element not found");

}

getch();

}

Q14) Write a program for bubble sort?A14)

#include <stdio.h>

#include<conio.h>

void bubble_sort(int A[], int n);

int main()

{

int A[100], n, i, j, swap;

printf("Enter number of elements\n");

scanf("%d", &n);

printf("Enter the elements\n", );

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

scanf("%d", &A[i]);

bubble_sort(A, n);

printf("Sorted list in ascending order:\n");

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

printf("%ld\n", A[i]);

return 0;

}

void bubble_sort(int A[], int n)

{

int i, j, t;

for (i = 0 ; i < ( n – 1 ); i++)

{

for (j = 0 ; j < (n – i – 1); j++)

{

if (A[j] > list[j+1])

{

/* Swapping */

t = A[j];

A[j] = A[j+1];

A[j+1] = t;

}

Sign Up