MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION,

MUMBAI

A micro project
On
”OPERATION ON ARRAY”
DIPLOMA

In
Computer Engineering
Submitted by
MS. PALLAVI KASHINATH KORE

` MS. ALFIYA SAMEER SHEKH

MS. MANALI MAHADEV POWAR

MS. SHREYA SUBHASH THORAT

UNDER GUIDANCE OF

MR. A.T. NARVEKAR

DEPARTMENT OF COMPUTER ENGINEERING

SANT GAJANAN MAHARAJ RURAL POLYTECHNIC,
MAHAGAON
ACADEMIC YEAR 2023-2024
 SANT GAJANAN MAHARAJ RURAL HOSPITAL &RESEARCH CENTER, MAHAGAON

“SANT GAJANAN MAHARAJ RURAL POLYTECHNIC”

A/P –MAHAGAON, SITE –CHINCHEWADI, TAL-GADHINGLAJ, DIST-KOLHAPUR

CERTIFICATE
This is to that the following students of third Semester of Diploma in Computer
Engineering of Institute SANT GAJANAN MAHARAJ RURAL POLYTECHNIC,
MAHAGAON-416503. (CODE-0965) has completed Micro project “OPERATION ON
ARRAY” in subject “Data Structure Using C” subject code: -22317 of during the
academic year 2023to 2024.
Roll
Student name Enrollment no
No.

12 PALLAVI KASHINATH KORE 2209650014

48 ALFIYA SAMEER SHEKH 2209650053

49 MANALI MAHADEV POWAR 2209650054

52 SHREYA SUBHASH THORAT 2209650057

MR. A.T. NARVEKAR MR.G.K.BIRANAGADDI Prof.R.S.PATIL

(Subject Teacher) (Head of Department) (Principal)

INDEX
Sr. No Title Page No

0.1 Aims/Benefits of the micro project 1

0.2 Course outcome addressed. 1

0.3 Proposed methodology 1

0.4 Introduction 1

0.5 3
Actual Procedure Followed

0.6 3
Resources Required

0.7 Action plan 4

0.8 Program and output 5

0.9 Conclusion 7

10 References 7

PART A – Micro Project Proposal

 Title of micro project:Operations on Array

1.0 Ratitonale
The data structure is an important aspect for Computer Engineering and Information
Technology Diploma graduates. The data structure is a logical & mathematical model of
storing & organizing data in a particular way in a computer. The methods and techniques of
Data Structures are widely used in industries. After learning these subject students will be
able to identify the problem, analyse different algorithms to solve the problem & choose the
most appropriate data structure to represent the data.

2.0 Course outcome addressed.

1) Perform basic operations on array
2) Apply different searching and sorting techniques
3) Implement basic operations on the queue using array representation.

3.0 Literatures Review

An array is a data structure for storing more than one data item that has a similar data type.
The items of an array are allocated at adjacent memory locations. These memory locations
are called elements of that array. The total number of elements in an array is called length.
The basic operations in the Arrays are insertion, deletion, searching, display, traverse, and
update. These operations are usually performed to either modify the data in the array or to
report the status of the array.

4.0 Proposed methodology

In Academic Year 2023-2024 under the guidance of our teacher we have completed this
project. We followed study method to complete our DSU project ‘Operations on Array’.
We distributed project work among members we used different books as well as websites to
collect the information .We implemented programs to perform various operations on array.
We arranged information in proper sequence after program execution .we completed this
project successfully.

5.0 Resources Required

Sr. Name of Resource/material Specification Qty

No.
1. Internet service Google.com 1
2. Computer system with broad Intel i3-3220 CPU, 3.30GHZ 1
specifications 64 bit windows 7
3. Software Turbo C++ 1
4. Any other resource used Internet software 1

5.0 Action Plan

Sr.No Details of Activity Plan start Plan Finish Name of
date Date Responsible Team
member
1 Discussion and
finalization of topic
2 Preparation and
submission of abstract
3 Collection of data

4 Implementation and
execution of programs

5 Arranging project
sequentially

6 Submission of michro
project

PART B– Micro Project Proposal

 Title of micro project: Operations on Array

1.0Ratitonale

The data structure is an important aspect for Computer Engineering and Information
Technology Diploma graduates. The data structure is a logical & mathematical model of
storing & organizing data in a particular way in a computer. The methods and techniques of
Data Structures are widely used in industries. After learning these subject students will be
able to identify the problem, analyse different algorithms to solve the problem & choose the
most appropriate data structure to represent the data.

2.0 Course outcome addressed.

1) Perform basic operations on array
2) Apply different searching and sorting techniques
3) Implement basic operations on the queue using array representation.

3.0 Literatures Review

Array in Data Structure

An array is a data structure for storing more than one data item that has a
similar data type. The items of an array are allocated at adjacent memory locations.
These memory locations are called elements of that array. The total number of
elements in an array is called length.

Operations on Array

OPERATIONS ON ARRAY

1. Traversing

2. Inserting

3. Searching

4. Deletion

5. Updation
1.Traversing

Algorithm

Step 1:Start

Step 2:Declare an array of certain size and i variable.

Step 3:Initialize an Array by assigning the elements to the array

Program
#include<stdio.h>

#include<conio.h>

void main()

int arr[5]={1,2,3,4,5},i;

clrscr();

printf("Elements in array are:");

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

printf("\narr[%d]=%d",i,arr[i]);

getch();

Output:-
Program
#include<stdio.h>

#include<conio.h>

void main()

{int arr[20]={1,2,3,4,5},pos,i, n=5, x=7;

clrscr();

pos=2;

printf("Elements in array before insertion");

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

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

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

{arr[pos-1]=x;

printf("\nElememts in array after insertion");

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

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

}getch();}

Output:-
Program

0.5 Actual Procedure Followed

1. Searching the topic for micro-project

2. Collect information from the internet and textbook

3. Collect information from the DSU 22317 reference book

4. Arrange all information in ms word

5. Prepare a report on it using MS word
6. Print micro project
0.8 Program and output

#include<stdio.h>
#include<conio.h>
# define max 5
int queue[max], front=-1, rear=-1;
void enqueue ();
void dequeue ();
void display ();
int main ()
{
int ch;
clrscr ();
printf ("\n **** queue menu ****");
printf ("\n 1. insertion \n 2. deletion\n 3. display\n 4. exit");
while (1)
{
printf ("\n enter the choice (1 to 4)");
scanf ("%d", &ch);
switch(ch)
{
case 1: enqueue ();
break;
case 2: dequeue ();
break;
case 3: display ();
break;
 case 4: exit (0);
default: printf ("\n wrong choice!!");
}
}
return 0;
}
void enqueue ()
{
if(rear==max-1)
printf ("\n queue is full!!");
else
{
if (front ==-1)
front=0;
rear++;
printf ("\n enter element to insert:");
scanf ("%d", &queue[rear]);
}
}
void dequeue ()
{
if(front==-1)
printf ("\n queue is empty!!");
else
{
Printf ("\n delete element is %d", queue[front]);
front++;
if(front>rear)
front=rear=-1;
}
}
void display ()
{
int i;
if(rear==-1)
printf ("\n queue is empty!!");
else
{
Printf ("\n ----- element in queue -----\n");
For (i=front; i< =rear; i++)
printf ("%d”, queue [i]);
}
}

Output
0.9 Conclusion
 we have comprehended the concept of queue data structure and its
implementation utilizing Arrays in C.

10. References

 Array implementation of queue (Simple) – Geeks for Geeks

 Introduction and Array Implementation of Queue - GeeksforGeeks

 Implement Queue Using Array in Java - Java point

 Queue using Arrays in C (Implementation) | PrepInsta