Module 3 (PSP)

Best VTU Student Companion App You Can Get
DOWNLOAD NOW AND GET

Instant VTU Updates, Notes, Question Papers,
Previous Sem Results (CBCS), Class Rank, University Rank,
Time Table, Students Community, Chat Room and Many
More
CLICK BELOW TO DOWNLOAD VTU CONNECT APP

IF YOU DON’T HAVE IT
* Visit https://vtuconnect.in for more info. For any queries or questions wrt our
platform contact us at: support@vtuconnect.in
Download VTU Connect App Now From Google Play Store Go Digital, Go Green, Save Paper
C PROGRAMMING FOR PROBLEM SOLVING
MODULE III
3.1 ARRAYS
3.1.1Definition:
An array is a collection of elements of the same datatype which is stored in consecutive
memory locations.
Each value in an array is indicated by the same name that is array name and an index which
indicates the position of value in an array. The datatype of an array can be int, float, double, char
and string.
3.1.2 Representation of index:

In the below example, ‘a’ represents the name of an array. ‘0’ to ‘4’ represents the index.
The index always begins from zero (0) and continues till (size-1) position.
Ex: int a[5];
a[0] a[1] a[2] a[3] a[4]
a
Depending upon the length of the array, it is divided into 2 types. They are:
1. Fixed Length: is an array where the length is known at compile time.

Ex: int a[5];
2. Variable Length: is an array where the length is not known at compile time.
Ex: int a[ ];
3.1.3 Types of Arrays:
1. One dimensional array

2. Multidimensional array
DEPARTMENT OF CSE, BIT 1

3.2 One dimensional array(or) 1D array:

Definition:
The is the simplest type of array that contains only one row (linear list) for storing the
values of same datatype.
Declaration:
datatype array_name[size];
where datatype: type of an array.
array_name: name to represent the set of values.
size: the number of values that can be stored.
Ex: int a[5];
a[0] a[1] a[2] a[3] a[4]
a
Memory occupied by one dimensional array is

Total memory= (array_size) * sizeof(datatype).
Methods of initializing one dimensional array:
Initialization of array can be done in 3 ways. They are:
1. Initialize in a single statement.
2. Assigning values to each index.
3. Read input from keyboard.
1. Initialize in a single statement:
1. Basic Initialization:
Ex: int a[5]={10,20,30,40,50};
a[0] a[1] a[2] a[3] a[4]
a 10 20 30 40 50
2. Initialization without size:

Ex: int a[ ]={10,20,30,40,50};
a[0] a[1] a[2] a[3] a[4]
a 10 20 30 40 50
3. Partial Initialization:
Ex: int a[5]={10,20};
a[0] a[1] a[2] a[3] a[4]

a 10 20
4. Initialization with zero:
Ex: int a[5]={0};
a[0] a[1] a[2] a[3] a[4]
a 0 0 0 0 0
2.Assigning values to each index:

Initialization of elements can be done by one by one using the below syntax.
Ex: int a[5];
a[0]=10;
a[1]=20;
a[2]=30;
a[3]=40;
a[4]=50;
a[0] a[1] a[2] a[3] a[4]
a 10 20 30 40 50
3.Read input from keyboard:

The values to array can be read using scanf.
Syntax:
Consider an array a[n] where n value can be given directly (i.e., a[5]) or can be read using
scanf(i.e., scanf(“%d”, &n);) and ‘i’ is used to read the index values.
for(i=0;i<n;i++)
{
scanf(“%d”, &a[i]);
}
Methods of accessing one dimensional array:
C uses indexes to access individual elements in an array. Ex: To get the one element of an
array, a[0] can be used.
To print the elements of array, individual elements (or) all the elements of an array can be
done using printf statement.
Ex:

To access individual element,

printf(“ %d”,&a[0]);
To access all the elements,
for(i=0;i<n;i++)
{
printf(“%d\t”, &a[i]); (“/t” is used to get spaces in between the elements)
}
Write a program to read and display elements of a one dimensional array.
#include<stdio.h>
main()
{
int a[10], n, i;
printf(“ Enter the size of an array”);
scanf(“%d”,&n);
printf(“ Enter the elements of an array”);
for(i=0;i<n;i++)
{
scanf(“%d”, &a[i]);
}
printf(“ The array elements are:”);
for(i=0;i<n;i++)
{
printf(“%d\t”, &a[i]);
}
}
Output:
Enter the size of an array
5
Enter the elements of an array
1 2 3 4 5
The array elements are:
1 2 3 4 5

3.3Two dimensional array(or) 1D array:

Definition:
The two dimensional array is the simplest type of the multi-dimensional array. A two
dimensional array is that which contains rows and columns for storing the values of same datatype.
Declaration:
datatype array_name[size1][size2];
where datatype: type of an array.
array_name: name to represent the set of values.
size1: the number of rows that can be stored.
Size2: the number of columns that can be stored.
Ex: int a[3][5];
a[0][0] a[0][1] a[0][2] a[0][3] a[0][4]
a[1][0] a[1][1] a[1][2] a[1][3] a[1][4]
a[2][0] a[2][1] a[2][2] a[2][3] a[2][4]
Methods of initializing one dimensional array:

Initialization of array can be done in 3 ways. They are:
1. Initialize in a single statement.
2. Assigning values to each index.
3. Read input from keyboard.
1. Initialize in a single statement:
Ex: int a[3][3]={{10,20,30},{40,50}};
10 20 30
40 50
2. Assigning values to each index:

Initialization of elements can be done by one by one using the below syntax.
Ex: int a[3][3];
a[0][0]=10;
a[0][1]=20;
a[1][0]=30;

a[1][1]=40;
10 20
30 40
3.Read input from keyboard:

The values to array can be read using scanf.
Syntax:
Consider an array a[n] where n value can be given directly (i.e., a[5]) or can be read using
scanf(i.e., scanf(“%d”, &n);) and ‘i’ is used to read the index values.
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf(“%d”, &a[i][j]);
}
}
Methods of accessing one dimensional array:
C uses indexes to access individual elements in an array. Ex: To get the one element of an
array, a[0][0] can be used.
To print the elements of array, individual elements (or) all the elements of an array can be
done using printf statement.
Ex:
To access individual element,
printf(“ %d”,a[0][1]);
To access all the elements,

for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf(“%d\t”, a[i][j]); //(/t is used to spaces between the numbers)
}
printf(“\n”); // (/n is used to differentiate rows and columns)
}

Write a program to read and display elements of a two dimensional array.
#include<stdio.h>
main()
{
int a[10][10],m, j, n, i;
printf(“ Enter the no of rows and columns of an array”);
scanf(“%d%d”,&m, &n);
printf(“ Enter the elements of an array”);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf(“%d”, &a[i][j]);
}
}
printf(“ The array elements are:”);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf(“%d\t”, a[i][j]);
}
printf(“\n”);
}
}
Output:
Enter the no of rows and columns of an array
2 2
Enter the elements of an array
1 2 3 4
The array elements are:
1 2
3 4

3.4 STRINGS
Definition:
Strings are defined as an array of characters where it is terminated with a special character
‘\0’ (NULL Character).
Declaration:
char string_name[length];
where: char is the datatype of strings, string_name represents the name of the string, and
length represents the length of the string.
Initialization:
There are 2 ways to initialize the string :
Method 1: Syntax : string_variable[SIZE] = {‘V’,’A’,’L’,’U’,’E’,’S’,’\0’};

Example : str_var[6] = {‘p’,’r’,’o’,’g’,’r’,’a’,’m’,’s’,’\0’};
Method 2: Syntax : string_variable[SIZE] = {“values”};

Example : str_var[6] = {“programs”};
String Input and Output in C programming
It can be done in 2 different ways :

 printf and scanf
 puts aand gets
1. Read & write Strings in C using Scanf() and Printf()functions
%s format specifier is used for strings input/output operations. “&” symbol is optional for
reading string data in scanf() statement.
Example :
#include<stdio.h>
#include<string.h>
void main()
{
Char name[10]; //string declaration
printf(“enter your name \n”):
scanf(“%s”, name); //reading string data using scanf()

printf(“%s”,name); // printing string data using printf()

}
2. Read & write Strings in C using gets()and puts() functions
%s format specifier is not used for strings input/output operation. & symbol is not used for
reading string data in gets() statement.
Example :
#include<stdio.h>
#include<string.h>
void main()
{
Char name[10]; //string declaration
puts(“enter your name \n”):
gets(name); //reading string data using gets()
puts(name); // printing string data using puts
}
3.4.1 String Manipulation functions/ String operations:
Some of the functions using in string library are:
1. String length:
strlen() function is used to find out the length of the string in terms of number of charatcers
in it.
Syntax: strlen(string_data);
Example:
#include<stdio.h>
main()
{
char s[10]= “HELLO”;
int len = strlen(s);
printf(“ String Length is %d”,len):
}
Output: String Length is 5
2. String concatenation:
Strcat() function is used to combine 2 strings. One string will be attached to another string.
Syntax: strcat(string1,string2);

Example:
#include<stdio.h>
main()
{
char s1[20],s2[20];
int k;
printf(“Enter string 1”);
scanf(“%s”,s1);
scanf(“%s”,s2);
strcat(s1,s2);
printf(“Concatenated String is %s”, s1);
}
Output:
Enter string 1: Bangalore
Enter string 2: City
Concatenated String is BangaloreCity
3. String compare:
Strcmp() function is used to compare 2 strings. Every character of one string is compared
with corresponding position of another string.
Syntax: strcmp(string1,string2);
Note:
 If the function returns zero (0), then strings are equal.
 If the string returns value greater than zero (0), then first string is greater.
 If the string returns value lesser than zero (0), then second string is greater.
Example:
#include<stdio.h>
main()
{
char s1[20],s2[20];
int k;
scanf(“%s”,s1);
scanf(“%s”,s2);
k= strcmp(s1,s2);
if(k==0)
printf(“Strings are equal”);
else if(k>0)
printf(“string 1 is greater”);

else
printf(“string 2 is greater”);
}
Output:
Enter string 1: BIT
Enter string 2: BIT
Strings are equal
4. String copy:
strcpy( ) function is used to copy content of one string to another.
Syntax: strcpy(destination_string, source_string):
Example:
#include<stdio.h>
main()
{
Char s1[10]=”BIT”,s2[10];
strcpy(s2,s1);
printf(“ The string s2 is %s”, s2);
}
5. String reverse:
Strrev( ) function is used to reverse the string.
Syntax: strrev(string);
Example:
#include<stdio.h>
main()
{
char s1[10]=”BIT”,s2[10];
s2=strrev(s1);
printf(“s2=%s”,s2);
}
Output: TIB
6. String lower:
Strlwr( ) function is used to convert the upper case alphabets to lower case alphabets.
Syntax: strlwr(string);
Example: Strlwr(“BIT”); // Output: bit
7. String Upper
Strupr( ) function is used to convert the lower case alphabets to upper case alphabets.
Syntax: strupr(string);
Example: Strupr(“bit”); // Output: BIT

8. Searching specific character in the string:

Strchr( ) function is used to search a specific character in a string.
Syntax: strchr(string, searching_character);
Example: Strchr(“Bengaluru”); // Output: luru
9. String set:
Strset( ) function is used to replace the string with a specific character.
Syntax: strset(string, character);
Example: Strset(“BIT”,*); // Output: ***
3.5 Searching Algorithms

The process of identifying or finding a particular element in the given series is called
searching. Searching techniques can be implemented using arrays. Some the algorithms are:
1. Linear Search algorithm
2. Binary Search algorithm
3.5.1 Linear Search algorithm:

Procedure:
Linear search in C to find whether a number is present in an array. If it's present, then at
what location it occurs. It is also known as a sequential search. It is straightforward and works as
follows: we compare each element with the element to search until we find it or the list ends.
Example: Consider the number 20 is searched by comparing with each element of the array
sequentially starting from 10 until we find 20 in the given array (or) until it reaches end of the
array if the element is not found.

Algorithm:
Step 1: Start
Step 2: [Input the number of elements]
read n
Step 3: initialize found 0
Step 4: [ Input the array items]
for i  0 to n-1
read a[i]
end for
Step 4: [Input the key]
read key
Step 5: [Compare key element with array element sequentially]
for i=0 to n
if key = a[i]
print “Key found”
set found  1
end if
end for
Step 6: if found = 0
print “Element not found”
end if
Step 7: Stop
Program:
#include<stdio.h>
#include<string.h>
void main()
{
int a[10],key,i,found=0;
printf(“enter the number of elements to read,n=”);
scanf(“%d”,&n);
printf(“enter the elements in ascending order\n”);
for(i=0;i<n;i++)
scanf(“%d”,&a[i]);
printf(“enter the name to search:”);
scanf(“%d”,&key);
for(i=0;i<n;i++)
{
if(key==a[i])
{
printf(“Element found at %d”,i+1);
found=1;
exit(0);
}

}
if(found==0)
{
printf(“Element not found”):
}
}
3.5.2 Binary Search algorithm:

Procedure:
Binary search algorithm applies to a sorted array for searching an element. The search starts
with comparing the target element with the middle element of the array. If value matches, then the
position of the element is returned. In case the target element is less than the middle element
(considering the array follows an ascending order) of the array then the second half of the array is
discarded and the search continues by dividing the first half. The process is the same when the
target element is greater than the middle element, only, in this case, the first half of the array is
discarded before continuing with the search. The iteration repeats until a match for the target
element is found.
Algorithm: To search a key element using Binary search
Step 1: Start

read n
Step 3: [ Input the array items]
for i  0 to n-1
read a[i]
end for
Step 4: [Input the key]
read key
Step 5: [Initialize low to zero and high to last element]
low  0
high  n-1
Step 6: [Calculate mid element and compare with key]
while (low<=high && !found)
mid  (low+high)/2
if a[mid] = key then
goto step 7
else if a[mid]>key then
high  mid-1
else
low  mid+1
end if
end while
Step 7: [Print a message for successful or not successful]
if found ==1 then
print “search successful, print in mid+1 location”
else
print “search unsuccessful key not present in the list”
end if
Step 8: Stop
Program:
#include<stdio.h>
#include<string.h>
void main()
{
int a[10],key,n,i,low,high,mid,found=0;
printf(“enter the number of elements to read,n=”);
scanf(“%d”,&n);
printf(“enter the elements in ascending order\n”);
for(i=0;i<n;i++)
printf(“enter the name to search:”);
scanf(“%d”,&key);
low=0;
high=n-1;
while(low<=high&&!found)

{
mid=(low+high)/2;
if(a[mid]==key)
found=1;
else if(a[mid]<key)
low=mid+1;
else
high=mid-1;
}
if(found==1)
printf(“Key found in position:%d”,mid+1);
else
printf(“Key not found”);
}
3.6 Sorting Techniques:

Sorting can be defined as the method of arranging the data in a particular manner that
follows some order(ascending/descending). We will be studying about 2 important techniques.
They are:
1. Bubble Sort
2. Selection Sort
3.6.1 Bubble Sort:
Procedure:
This is the simplest sorting algorithm that works by repeatedly swapping the adjacent
elements if they are in wrong order. This repetitively compares adjacent pairs of elements and
swaps if necessary. Scan the array, swapping adjacent pair of elements if they are not in relative
order. This bubbles up the largest element to the end. Then scan the array again, bubbling up the
second largest element. Repeat until all the elements are in order.
Algorithm: To sort N integer numbers using Bubble sort
Step 1: Start
read n
Step 3: [Input unsorted elements in array]
for i0 to n-1
read a[i]
Step 4: [Sort the elements in ascending order]
for i 0 to n-1
for j0 to n-i

if a[j] > a[j+1] then

temp a[j]
a[j]  a[j+1]
a[j+1]  temp
end if
end for
end for
Step 5: [Output the sorted elements]
for i0 to n-1
print a[i]
Step 6: Stop
Program:
#include<stdio.h>
void main()
{
int a[10],n,i,j,temp;
printf("Enter the number of elements\n");
scanf("%d",&n);
printf("Enter the values\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=1;i<n;i++) // Sorting starts here
{
for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("\nThe sorted elements are\n");
for(i=0;i<n;i++)
printf("%d\t",a[i]);
}

3.6.2 Selection Sort:

The selection sort algorithm sorts an array by repeatedly finding the minimum element
(considering ascending order) from unsorted part and putting it at the beginning.
Algorithm:
Step1: Start
Step2: Read n
Step3: read array elements to be sorted
for i=1 to n
read a[i]
end for
Step4: Sort the elements
for i=0 to n-1
min=i
find minimum value starting from index i+1
for j=i+1 to n
if a[j] is less than a[min], then
min=j
end if
end for
swap a[i] and a[min]
end for
Step5: Print Sorted elements
for i=1 to n
print a[i]
Step6: Stop
Program:
#include<stdio.h>
main()
{
int i,j,min,n,a[10],temp;
printf(“Enter the number of elements”);
scanf(“%d”,&n);
printf(“Enter the array elements”);
for(i=0;i<n;i++)
{
}

for(i=0;i<n-1;i++)
{
min=1;
/*finding min value starting from index i+1*/
for(j=i+1;j<n;j++)
{
if(a[j]<a[min])
{
min=j;
}
}
/* Swapping first element of unsorted part with minimum*/
temp=a[i];
a[i]=a[min];
a[min]=temp;
}
/* Printing sorted array using selection sort */
printf(“Elements in sorted order”);
for(i=0;i<n;i++)
{
printf(“%d\t”,a[i]);
}
}

Module 3 (PSP)

Uploaded by

Module 3 (PSP)

Uploaded by

Best VTU Student Companion App You Can Get

DOWNLOAD NOW AND GET

CLICK BELOW TO DOWNLOAD VTU CONNECT APP

3.1.2 Representation of index:

1. Fixed Length: is an array where the length is known at compile time.

3.1.3 Types of Arrays:

1. One dimensional array

DEPARTMENT OF CSE, BIT 1

3.2 One dimensional array(or) 1D array:

Memory occupied by one dimensional array is

2. Initialization without size:

DEPARTMENT OF CSE, BIT 2

2.Assigning values to each index:

3.Read input from keyboard:

DEPARTMENT OF CSE, BIT 3

To access individual element,

Write a program to read and display elements of a one dimensional array.

DEPARTMENT OF CSE, BIT 4

3.3Two dimensional array(or) 1D array:

Methods of initializing one dimensional array:

2. Assigning values to each index:

DEPARTMENT OF CSE, BIT 5

3.Read input from keyboard:

To access all the elements,

DEPARTMENT OF CSE, BIT 6

Write a program to read and display elements of a two dimensional array.

DEPARTMENT OF CSE, BIT 7

There are 2 ways to initialize the string :

Method 1: Syntax : string_variable[SIZE] = {‘V’,’A’,’L’,’U’,’E’,’S’,’\0’};

Method 2: Syntax : string_variable[SIZE] = {“values”};

String Input and Output in C programming

It can be done in 2 different ways :

DEPARTMENT OF CSE, BIT 8

printf(“%s”,name); // printing string data using printf()

DEPARTMENT OF CSE, BIT 9

DEPARTMENT OF CSE, BIT 10

DEPARTMENT OF CSE, BIT 11

8. Searching specific character in the string:

3.5 Searching Algorithms

3.5.1 Linear Search algorithm:

DEPARTMENT OF CSE, BIT 12

DEPARTMENT OF CSE, BIT 13

3.5.2 Binary Search algorithm:

Algorithm: To search a key element using Binary search

DEPARTMENT OF CSE, BIT 14

DEPARTMENT OF CSE, BIT 15

3.6 Sorting Techniques:

DEPARTMENT OF CSE, BIT 16

if a[j] > a[j+1] then

DEPARTMENT OF CSE, BIT 17

3.6.2 Selection Sort:

DEPARTMENT OF CSE, BIT 18

DEPARTMENT OF CSE, BIT 19

You might also like