TOPIC - DEVELOP A ‘TO FIND MAXIMUM AND MINIMUM OF NODES USING

SINGLY LINKED LIST’

SUBMITTED IN PARTIAL FULFILLMENT OF THE DIPLOMA

IN COMPUTER ENGINEERING.

SUBMITTED BY:-
35. Samir Masram
38. Nagesh motirave
41. Rashi Nirale
Prathmesh Ramteke

DEPARTMENT OF COMPUTER,
ENGINEERING.
GOVERNMENT POLYTECNIC, YAVATMAL.
2023-2024
[Type

here]
 DEPARTMENT OF COMPUTER, ENGINEERING
GOVERNMENT POLYTECHNIC, YAWATMAL
** CERTIFICATE **
2023-2024

This Is To Be Certified That The Project Report

Entitled

Has been duly completed by following students has under

my guidance a satisfactory manner as partial fulfilment of the diploma
course in Computer Engineering MSBTE Mumbai.

SUBJECT TEACHER PRINCIPLE HOD

[Link] Mam Dr. R. P. MOGRE [Link] Mam

[Type

here]
 It Is An Incident Of Great Pleasure For Us Submitting This Micro Project I
Take This Opportunity To Express Our Deep Sense Of Gratitude & Great Thanks To
My Guide
[Link] Mam And Head Of Department Prof [Link] Mam , Who Has Been A
Constant Source Of Guidance And Inspiration Of Thoughts.
I Will Always Be Grateful To Them For The Encouragement & Suggestion Given By
Them From Time To Time. I Would Like To Thank All The Teaching Members Of
Computer Engineering Department & Sincere Thanks To Our Principal Dr. R. P.
MOGRE Who Always Inspire Us.
I Also Thankful To Our Friends & Library Staff Members Whose Encouragement
Suggestion Helped Us To Complete Our Micro Project. Last But Not Least I Thankful
To My Classmates Whose Best Wishes Are Always With Me.

Microproject Members:

35. Samir Masram

38. Nagesh motirave
41. Rashi Nirale
Prathmesh Ramteke

[Type

here]
 ANNEXURE - I

TOPIC : TO FIND, MAXIMUM AND MINIMUM OF NODES USING SINGLY

LINKED LIST.

1.0 Aim/Benefits of the microproject:

To write a program related to finding maximum and minimum

values of nodes using singly linked [Link] singly linked list node contains
data and pointer to next node which helps to maintain structure of
[Link] maintaines order of list.

2.0 Course Outcomes:

Develope skills for implementation of relevant structure to represent
the maximum and minimum values of given node using singly linked list.

3.0 Proposed Methodology:

First of all we, have to select a topic and then take a reference of
subject teacher. The teacher will assign one set of micro projects and said
to the student to create a report on Data structure using c We collected
information about the topic using source such as the internet, Data
structure book and then we asked subject teacher about topic. Set up and
submitted to subject teacher after the setup of Part A we prepare report on
topic. After finishing all the data in proper arrangement. The writing work
is done by om bhonge and the collection of information is done by ojas
kharate and the analyzation is done by pravin junghare. We selecte
proper margin for A4 page size etc. At least we get the hardcopy of
[Type
microproject and submitted to teacher.

here]
4.0 Action Plan:

Sr. Details of Activity Plan Start Plan End Responsibilities

No. Date Date Taken by
Member
1 Topic Selection & 07/10/2023 10/10/2023 All
Discussion
2 Collecting 10/10/2023 15/10/2023 All
Information
3 Coding 15/10/2023 18/10/2023 All

4 Annexure 1 & 18/10/2023 22/10/2023 All

Annexure 2

5.0 Resources Resquired:

Sr Name of
No. Resources Specification Quantity
Reference Data St
1. Books 1
Software
2. Application MS-WORD, Coding App.
2

3. Website [Link] 2
[Link]
etc.
[Type

here]
6.0 NAME OF MEMBER

Sr No. Name of Student for Micro Roll No.

Project.
1. Samir masram 35

2. Nagesh motirave 38

3. Rashi Nirale 41

4. Prathmesh Ramteke

Submitted by:

35. Samir Masram

38. Nagesh motirave
41. Rashi Nirale
Prathmesh Ramteke

[Type

here]
 ANNEXURE - II

MICROPROJECT REPORT
TO FIND, MAXIMUM AND MINIMUM OF NODES USING
SINGLY LINKED LIST

1.0 Rationale:

The project provides a knowldge of finding minimum

and maximum values of node using singly linked list.

2.0 Aims :

Prepare a report on finding minimum and maximum

values of node using singly linked list.

3.0 Course Outcomes :

Develope skills for implementation of relevant

structure to represent the maximum and minimum values of
given node using singly linked list.

4.0 LITERATURE REVIEW :

 In cadroid to implement program based on singly linked
list we used structure and pointer and implement program .

5.0 APPROACH:
The idea is to traverse the linked list to end and initialize
the [Link] check the condition and assigning current
node values .similarly checking current node value with another
values. Repeat above steps until end of list is reached.
6.0 Skills Developed/ Learning Outcomes of this Micro-project :

a) Communication skill and planning for micro-project with

group members skill developed.
b) Presentation skill developed how to present our project and
perform the action of micro-project.
c) Leadership developed and time budget and cost estimation

and schedule management skill developed.

d) Internet surfing skill.

7.0 Name of team member

Sr No. Name of Student for Micro Roll No.

Project.
1. Samir masram 35

2. Nagesh motirave 38

3. Rashi Nirale 41
 4. Prathmesh Ramteke

CODE OF PROJECT:

#include<stdio.h>
#include<stdlib.h>
struct node
{
int info;
struct node *link;
};
struct node *create_list(struct node *start);
void display(struct node *start);
struct node *addatbeg(struct node *start,int data);
struct node *addatend(struct node *start,int data);
int largest(struct node *start);
int smallest(struct node *start);
int main()
{
struct node *start=NULL;
int n;
start=create_list(start);
display(start);
printf("\n Maximum Value Of Node in list: %d\n",largest(start));
printf("\n Minimum Value Of Node in list: %d\n",smallest(start));
return 0;
}
int largest(struct node *ptr)
{
int large=ptr->info;
 while(ptr!=NULL)
{
if(ptr->info >large)
large = ptr->info;
ptr=ptr->link;
}
return large;
}/*End of largest()*/

int smallest(struct node *ptr)

{
int small=ptr->info;
while(ptr!=NULL)
{
if(ptr->info < small)
small = ptr->info;
ptr=ptr->link;
}
return small;
}/*End of smallest()*/
struct node *create_list(struct node *start)
{
int i,n,data;

printf("\n\n\n");
printf("\n MAX AND MIN VALUES OF NODES USING SINGLY LINKED LIST ");
printf("\n");

printf(" \n\n \n Enter the number of nodes : ");

scanf("%d",&n);
start=NULL;
if(n==0)

return start;
printf("\n Enter the data to be inserted : ");
scanf("%d",&data);
start=addatbeg(start,data);
 for(i=2;i<=n;i++)
{
printf("\n Enter the data to be inserted : ");
scanf("%d",&data);
start=addatend(start,data);
}
return start;
}/*End of create_list()*/
void display(struct node *start)
{
struct node*p;
if(start==null)
{
printf("\nList Is Empty\n");
return 0;
}
p=start;
printf("\n================================");
printf("\nListEnter By You Is :\n");
while(p!=null)
{
printf("%d->",p->info);
p=p->link;
}
printf("\n");
}
struct node *addatbeg(struct node *start,int data)
{
struct node *tmp;
tmp=(struct node *)malloc(sizeof(struct node));
tmp->info=data; tmp->link=start; start=tmp;
return start;
}/*End of addatbeg()*/
struct node *addatend(struct node *start,int data)
{
struct node*p,*tmp;
tmp=(struct node*)malloc(sizeof(struct node));
 tmp->info=data;
p=start;
while(p->link!=NULL)
p=p->link; p->link=tmp; tmp->link=NULL;
}
/*End of addatend()*/

8.0 Outputs of the Micro-projects:

*****************************THANK YOU************************