0% found this document useful (0 votes)

18 views40 pages

Week 2 Dslab

The document outlines C programs for implementing single and double linked lists, detailing operations such as insertion, deletion, display, and reversal. It provides source code for these operations, including a menu-driven interface for user interaction. The document is affiliated with CMR College of Engineering & Technology and includes multiple sections for different linked list functionalities.

Uploaded by

vantepakaharshakumar

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

18 views40 pages

Week 2 Dslab

Uploaded by

vantepakaharshakumar

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 40

CMR COLLEGE OF ENGINEERING & TECHNOLOGY

(UGC AUTONOMOUS)
*Approved by AICTE *Affiliated to JNTUH * NAAC Accredited with A+ GRADE
Kandlakoya(V), Medchal Road, Hyderabad, Telangana-501401.
Website: www.cmrcet.ac.in

4.AIM:C program to implement single linked list and following operations.

i. Insertion
ii. Deletion
iii. Display

SOURCE CODE:
#include<stdio.h>
#include<stdlib.h>
void create();
void display();
void insert_begin();
void insert_end();
void insert_random();
void delete_begin();
void delete_end();
void delete_random();
struct node
{
int data;
struct node *next;
};
struct node *head=NULL;
int main()
{
int opt;
while(1)
{
printf("\n \t MENU");
printf("\n 1.create");
printf("\n 2.display");
printf("\n 3.Insert at begin");
printf("\n 4.Insert at end");
printf("\n 5.Insert at random");
printf("\n 6.Delete at begin");

Dept of CSE Page No.

CMR COLLEGE OF ENGINEERING & TECHNOLOGY
(UGC AUTONOMOUS)
*Approved by AICTE *Affiliated to JNTUH * NAAC Accredited with A+ GRADE
Kandlakoya(V), Medchal Road, Hyderabad, Telangana-501401.
Website: www.cmrcet.ac.in

printf("\n 7.Delete at end");

printf("\n 8.Delete at random");
printf("\n 9.exit");
printf("\n choose any option");
scanf("%d",&opt);
switch(opt)
{
case 1:create();break;
case 2:display();break;
case 3:insert_begin();break;
case 4:insert_end();break;
case 5:insert_random();break;
case 6:delete_begin();break;
case 7:delete_end();break;
case 8:delete_random();break;
case 9:printf("terminated by you");exit(0);

}// end of switch

}// end of while
return 0;
}// end of main
void create()
{
int val;
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node)) ;
printf("enter the value to insert");
scanf("%d",&val);
newnode->data=val;
newnode->next=NULL;
if(head==NULL)
head=newnode;
else
{
newnode->next=head;
head=newnode;
}
}

Dept of CSE Page No.

void display()
{
struct node *temp;
temp=head;
if(head==NULL)
printf("\n List is empty");
else
{
printf("\n list is ");
while(temp!=NULL)
{
printf("-->%d",temp->data);
temp=temp->next;
}
}
}
void insert_begin()
{
int val;
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
printf("enter the value to insert");
scanf("%d",&val);
newnode->data=val;
newnode->next=NULL;
if(head==NULL)
head=newnode;
else
{
newnode->next=head;
head=newnode;
}
}
void insert_end()
{
int val;
struct node *newnode,*temp;
newnode=(struct node*)malloc(sizeof(struct node)) ;
printf("enter the value to insert");
scanf("%d",&val);

Dept of CSE Page No.

newnode->data=val;
newnode->next=NULL;
if(head==NULL)
head=newnode;
else
{
temp=head;
while(temp->next!=NULL)
temp=temp->next;
temp->next=newnode;
}
}
void insert_random()
{
int val,pos,i;
struct node *newnode,*temp;
newnode=(struct node*)malloc(sizeof(struct node)) ;
printf("enter the value to insert");
scanf("%d",&val);
newnode->data=val;
newnode->next=NULL;
printf("enter position to insert");
scanf("%d",&pos);
if(pos==0)
insert_begin();
else
{
if(head==NULL)
{
head=newnode;
}
else
{
temp=head;
for(i=0;i<pos-1;i++)
{
temp=temp->next;
}
if(temp==NULL)
{

Dept of CSE Page No.

printf("\n position is out of scope");

}
else
{
newnode->next=temp->next;
temp->next=newnode;
}
}
}
}
void delete_begin()
{
struct node *temp;
if(head==NULL)
{
printf("\n List is empty");
}
else
{
temp=head;
head=head->next;
printf("deleting the node data is %d",temp->data);
free(temp);
}
}
void delete_end()
{
struct node *temp1,*temp2;
if(head==NULL)
{
printf("\n List is empty");
}
else
{
temp1=head;
while(temp1->next!=NULL)
{
temp2=temp1;
temp1=temp1->next;
}

Dept of CSE Page No.

temp2->next=NULL;
printf("\n deleting node data is %d",temp1->data);
free(temp1);
}
}
void delete_random()
{
struct node *temp,*position;
int i=0,pos;
if(head==NULL)
printf("\n List is empty");
else
printf("enter the position where you want to delete");
scanf("%d",&pos);
position=malloc(sizeof(struct node));
temp=head;
while(i<pos-1)
{
temp=temp->next;
i++;
}
position=temp->next;
temp->next=position->next;
free(position);
}
OUTPUT:

Dept of CSE Page No.

Dept of CSE PageNo.

Dept of CSE Page No.

5.AIM:C program to implement to reverse the nodes of a single linked list

SOURCE CODE:
#include<stdio.h>
#include<stdlib.h>
void create();
void display();
void reverse();
struct node
{
int data;
struct node *link;
};
struct node *head=NULL;
int main()
{
int opt;
while(1)
{
printf("\n \t MENU");
printf("\n 1.create");
printf("\n 2.display");
printf("\n 3.reverse");
printf("\n 4.exit");
printf("\n choose any option");
scanf("%d",&opt);
switch(opt)
{
case 1:create();break;
case 2:display();break;
case 3:reverse();break;
case 4:printf("terminated by you");exit(0);
}// end of switch
}// end of while
return 0;
}// end of main

Dept of CSE Page No.

void create()
{
int val;
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node)) ;
printf("enter the value to insert");
scanf("%d",&val);
newnode->data=val;
newnode->link=NULL;
if(head==NULL)
head=newnode;
else
{
newnode->link=head;
head=newnode;
}
}
void display()
{
struct node *temp;
temp=head;
if(head==NULL)
printf("\n List is empty");
else
{
printf("\n list is ");
while(temp!=NULL)
{
printf("-->%d",temp->data);
temp=temp->link;
}
}
}
void reverse()
{
struct node *prev,*current,*next;
prev=NULL;
current=next=head;
if(head==NULL)
printf("list is empty");

Dept of CSE Page No.

else
{
while(next!=NULL)
{
next=next->link;
current->link=prev;
prev=current;
current=next;
}
head=prev;
}
}
OUTPUT:

Dept of CSE Page No.

6.AIM:C program to implement various operations of double linked list and following operations
i. Creation
ii. Insertion
iii. Deletion
iv. Traversal
SOURCE CODE:
#include<stdio.h>
#include<stdlib.h>
void create();
void display();
void insert_begin();
void insert_end();
void insert_random();
void delete_begin();
void delete_end();
void delete_random();
struct node
{
int data;
struct node *next,*prev;
};
struct node *head=NULL;
int main()
{
int opt;
while(1)
{
printf("\n \t MENU");
printf("\n 1.create");
printf("\n 2.display");
printf("\n 3.Insert at begin");
printf("\n 4.Insert at end");
printf("\n 5.Insert at random");
printf("\n 6.Delete at begin");
printf("\n 7.Delete at end");
printf("\n 8.Delete at random");
printf("\n 9.exit");

Dept of CSE Page No.

printf("\n choose any option");

scanf("%d",&opt);
switch(opt)
{
case 1:create(); break;
case 2:display(); break;
case 3:insert_begin(); break;
case 4:insert_end(); break;
case 5:insert_random(); break;
case 6:delete_begin(); break;
case 7:delete_end(); break;
case 8:delete_random(); break;
case 9:printf("terminated by you"); exit(0);
break;

}// end of switch

}// end of while
return 0;
}// end of main
void create()
{
int n,i,val;
struct node *newnode;
printf("Enter number of nodes:");
scanf("%d",&n);
printf("Enter NODE DATA:");
for(i=0;i<n;i++)
{
scanf("%d",&val);
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=val;
newnode->next=NULL;
newnode->prev=NULL;
if(head==NULL)
{
head=newnode;
}
else
{

Dept of CSE Page No.

newnode->next=head;
head->prev=newnode;
head=newnode;
}
}
}
void display()
{
struct node *temp;
temp=head;
if(head==NULL)
printf("\n List is empty");
else
{
printf("\n list is ");
while(temp!=NULL)
{
printf("-->%d",temp->data);
temp=temp->next;
}
}
}
void insert_begin()
{
int val;
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
printf("enter the value to insert");
scanf("%d",&val);
newnode->data=val;
newnode->next=NULL;
newnode->prev=NULL;
if(head==NULL)
head=newnode;
else
{
newnode->next=head;
newnode->prev=NULL;
head->prev=newnode;
head=newnode;

Dept of CSE Page No.

}
}
void insert_end()
{
int val;
struct node *newnode,*temp;
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter value to insert:");
scanf("%d",&val);
newnode->data=val;
newnode->next=NULL;
newnode->prev=NULL;
if(head==NULL)
{
head=newnode;
}
else
{
temp=head;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=newnode;
newnode->prev=temp;
newnode->next=NULL;
}
}
void insert_random()
{
int val,i,pos;
struct node *newnode,*temp;
newnode=(struct node*)malloc(sizeof(struct node)) ;
printf("enter the value to insert");
scanf("%d",&val);
newnode->data=val;
newnode->next=NULL;
newnode->prev=NULL;
printf("enter position to insert");
scanf("%d",&pos)

Dept of CSE Page No.

if(pos==NULL)
{
head=newnode;
}
else
{
temp=head;
for(i=1;i<pos-1;i++)
{
temp=temp->next;
}
if(temp==NULL)
{
printf("\n position is out of scope");
}
else
{
newnode->next=temp->next;
newnode->prev=temp;
temp->next=newnode;
}
}
}
void delete_begin()
{
struct node *temp;
if(head==NULL)
{
printf("LIST IS EMPTY");
}
else
{
temp=head;
head=head->next;
head->prev=NULL;
free(temp);
}
}

Dept of CSE Page No.

void delete_end()
{
struct node *temp1,*temp2;
if(head==NULL)
{
printf("LIST IS EMPTY");
}
else
{
temp1=head;
while(temp1->next!=NULL)
{
temp2=temp1;
temp1=temp1->next;
}
temp1->prev=NULL;
temp2->next=NULL;
free(temp1);
}
}
void delete_random()
{
struct node *temp;
int pos,i=1;
printf("Enter position of node to delete:");
scanf("%d",&pos);
if(temp==head)
{
head=head->next;
head->prev=NULL;
free(temp);
}
else
{
temp=head;
while(i<pos)
{
temp=temp->next;
i++;
}

Dept of CSE Page No.

temp->prev->next=temp->next;
temp->next->prev=temp->prev;
free(temp);
}
}
OUTPUT:

Dept of CSE Page No.

7.AIM:C Program to implement circular linked list and its operations

i. Creation
ii. Insertion
iii. Deletion
iv. Traversal
SOURCE CODE:
#include<stdio.h>
#include<stdlib.h>
void create();
void display();
void insert_begin();
void insert_end();
void insert_random();
void delete_begin();
void delete_end();
void delete_random();
struct node
{
int data;
struct node *next;
};
struct node *head=NULL;
int main()
{
int opt;
while(1)
{
printf("\n \t MENU");
printf("\n 1.create");
printf("\n 2.display");
printf("\n 3.Insert at begin");
printf("\n 4.Insert at end");
printf("\n 5.Insert at random");
printf("\n 6.Delete at begin");
printf("\n 7.Delete at end");
printf("\n 8.Delete at random");
printf("\n 9.exit");

Dept of CSE Page No.

printf("\n choose any option");

scanf("%d",&opt);
switch(opt)
{
case 1:create();break;
case 2:display();break;
case 3:insert_begin();break;
case 4:insert_end();break;
case 5:insert_random();break;
case 6:delete_begin();break;
case 7:delete_end();break;
case 8:delete_random();break;
case 9:printf("terminated by you");exit(0);

}// end of switch

}// end of while
return 0;
}// end of main
void create()
{
struct node *ptr,*temp;
int i,n,val;
printf("enter no of elements\n");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
ptr=(struct node*)malloc(sizeof(struct node));
printf("enter data of node %d",i);
scanf("%d",&val);
ptr->data=val;
if(head==NULL)
{
head=ptr;
ptr->next=head;
temp=head;
}
else
{
temp->next=ptr;

Dept of CSE Page No.

temp=ptr;
temp->next=head;
}
}
}
void insert_begin()
{
struct node *temp,*ptr;
int num;
ptr=(struct node*)malloc(sizeof(struct node));
printf("enter data");
scanf("%d",&num);
ptr->data=num;
if(head==NULL)
{
head=ptr;
ptr->next=head;
}
else
{
temp=head;
if(temp->next==head)
{
temp->next=ptr;
ptr->next=temp;
}
else
{
while(temp->next!=head)
{
temp=temp->next;
}
ptr->next=head;
head=ptr;
temp->next=head;
}
}
}

Dept of CSE Page No.

void insert_end()
{
struct node *ptr,*temp;
int num;
ptr=(struct node*)malloc(sizeof(struct node));
printf("enter data");
scanf("%d",&num);
ptr->data=num;
if(head==NULL)
{
head=ptr;
ptr->next=head;
}
else
{
temp=head;
if(temp->next==head)
{
temp->next=ptr;
ptr->next=temp;
}
else
{
while(temp->next!=head)
{
temp=temp->next;
}
temp->next=ptr;
ptr->next=head;
}
}
}
void insert_random()
{
struct node *ptr;
int pos,i=1,num;
ptr=(struct node*)malloc(sizeof(struct node));
printf("enter data");
scanf("%d",&num);
ptr->data=num;

Dept of CSE Page No.

printf("enter position to insert:");

scanf("%d",&pos);
if(head==NULL)
{
head=ptr;
ptr->next=head;
}
else
{
struct node *temp;
temp=head;
while(i<pos-1)
{
temp=temp->next;
i++;
}
ptr->next=temp->next;
temp->next=ptr;
}
}
void delete_begin()
{
if(head==NULL)
{
printf("list is empty");
}
else
{
struct node *temp,*temp1;
temp=head;
temp1=head;
if(temp->next==head)
{
head==NULL;
printf("Deleted element is %d",temp->data);
free(temp);
}
else
{
while(temp->next!=head)

Dept of CSE Page No.

{
temp=temp->next;
}
head=temp1->next;
temp->next=head;
printf("Deleted element is %d",temp1->data);
free(temp1);
}
}
}
void delete_end()
{
if(head==NULL)
{
printf("list is empty");
}
else
{
struct node *temp1,*temp;
temp=head;
if(temp->next==head)
{
head==NULL;
printf("Deleted element is %d",temp->data);
free(temp);
}
else
{
while(temp->next!=head)
{
temp1=temp;
temp=temp->next;
}
temp1->next=head;
printf("deleted element is %d",temp->data);
free(temp);
}
}
}

Dept of CSE Page No.

void delete_random()
{
int pos,i=1;
if(head==NULL)
{
printf("list is empty");
}
else
{
struct node *temp,*t;
temp=head;
printf("enter position to delete");
scanf("%d",&pos);
if(temp->next==NULL)
{
head=NULL;
printf("deleted element is %d",temp->data);
free(temp);
}
else
{
while(i<pos-1)
{
temp=temp->next;
i++;
}
t=temp->next;
temp->next=t->next;
t->next=NULL;
printf("deleted element is %d",t->data);
free(t);
}
}
}
void display()
{
if(head==NULL)
{

Dept of CSE Page No.

printf("list is empty");
}
else
{
struct node *temp;
temp=head;
printf("The linked list is:\n");
while(temp->next!=head)
{
printf("%d->",temp->data);
temp=temp->next;
}
printf("%d",temp->data);
}
}
OUTPUT:

Dept of CSE Page No.

CMR College of Engineering & Technology
No ratings yet
CMR College of Engineering & Technology
90 pages
Data Structures Lab Record
No ratings yet
Data Structures Lab Record
90 pages
Cs3311 Ds Lab
No ratings yet
Cs3311 Ds Lab
98 pages
Linked List Micro Project Report
No ratings yet
Linked List Micro Project Report
18 pages
CM - 3rd SEM 2023
No ratings yet
CM - 3rd SEM 2023
75 pages
Unit Ii DS
No ratings yet
Unit Ii DS
47 pages
C Programming Syllabus Overview
No ratings yet
C Programming Syllabus Overview
7 pages
CSC 122 Course Syllabus: Data Structure
No ratings yet
CSC 122 Course Syllabus: Data Structure
7 pages
Problem Solving Using C Theory
No ratings yet
Problem Solving Using C Theory
28 pages
Cs8381 Datastructures Lab Manual Converted 1
No ratings yet
Cs8381 Datastructures Lab Manual Converted 1
145 pages
Data Structures Laboratory Manual
No ratings yet
Data Structures Laboratory Manual
102 pages
C Language Workshop
No ratings yet
C Language Workshop
2 pages
1 - FC4503 DS-Curr 2023
No ratings yet
1 - FC4503 DS-Curr 2023
12 pages
Csbs Dsa Lab
No ratings yet
Csbs Dsa Lab
74 pages
BSC COMPUTER SCIENCE
No ratings yet
BSC COMPUTER SCIENCE
9 pages
DATA STRUCTURE RECORD Update
No ratings yet
DATA STRUCTURE RECORD Update
47 pages
Cs8381 Datastructures Lab Manual
82% (28)
Cs8381 Datastructures Lab Manual
125 pages
CSC 122 Data Structure Syllabi
No ratings yet
CSC 122 Data Structure Syllabi
7 pages
Computer Science & Engineering-3rd Sem
No ratings yet
Computer Science & Engineering-3rd Sem
14 pages
BSC ITM
No ratings yet
BSC ITM
60 pages
Data Structures Lab Manual in C++
No ratings yet
Data Structures Lab Manual in C++
86 pages
Ppsuc Hand Out - 2019-2020
No ratings yet
Ppsuc Hand Out - 2019-2020
17 pages
Cnos
No ratings yet
Cnos
122 pages
BTech Programming Course Outline
No ratings yet
BTech Programming Course Outline
12 pages
Wa0006.
No ratings yet
Wa0006.
18 pages
Intro to C Programming Course
No ratings yet
Intro to C Programming Course
7 pages
LAB - XBC206 - Data Structure Lab Manual
No ratings yet
LAB - XBC206 - Data Structure Lab Manual
80 pages
Singly Linked List Implementation in C
No ratings yet
Singly Linked List Implementation in C
9 pages
Syllabus 2020-23
No ratings yet
Syllabus 2020-23
24 pages
C++ Data Structures Training Report
No ratings yet
C++ Data Structures Training Report
23 pages
Amitpathak
No ratings yet
Amitpathak
44 pages
PF-CIS-Fall 2022 LAB
No ratings yet
PF-CIS-Fall 2022 LAB
4 pages
Marking Guide Com204
No ratings yet
Marking Guide Com204
9 pages
Linked List - Module 3
No ratings yet
Linked List - Module 3
24 pages
Course File for Computing & Programming
No ratings yet
Course File for Computing & Programming
18 pages
DSA Lab Manual 2024-2025 Updated
No ratings yet
DSA Lab Manual 2024-2025 Updated
86 pages
DAA - ALGORITHM LAB Assignment - 2019
No ratings yet
DAA - ALGORITHM LAB Assignment - 2019
7 pages
Final B.C.a Syllabus I&II Year-13!1!25
No ratings yet
Final B.C.a Syllabus I&II Year-13!1!25
62 pages
ADA Lab Manual - AnujJain ITM Universe Vadodara
No ratings yet
ADA Lab Manual - AnujJain ITM Universe Vadodara
74 pages
DS - Lab (KCS-351) Manual
No ratings yet
DS - Lab (KCS-351) Manual
65 pages
CSE - Syllabus R23
No ratings yet
CSE - Syllabus R23
14 pages
BSC - Itm New Syllabus 2020
No ratings yet
BSC - Itm New Syllabus 2020
87 pages
Oopslab Btech
No ratings yet
Oopslab Btech
8 pages
Lodalasan
No ratings yet
Lodalasan
4 pages
2023 Admitted 1st Year Syllabus - Revised 16.11.2023
No ratings yet
2023 Admitted 1st Year Syllabus - Revised 16.11.2023
31 pages
Data Structure Lab Manual 2022-23
No ratings yet
Data Structure Lab Manual 2022-23
9 pages
Micro Project of Data Structure Using C++ - 3rd SEM - CO
100% (1)
Micro Project of Data Structure Using C++ - 3rd SEM - CO
13 pages
MCA Curriculum Overview 2005
No ratings yet
MCA Curriculum Overview 2005
48 pages
Data Structures Lab Guide
No ratings yet
Data Structures Lab Guide
43 pages
B.sc. Computer Science UG Syllabus SEP
No ratings yet
B.sc. Computer Science UG Syllabus SEP
13 pages
DS Lab Manual
No ratings yet
DS Lab Manual
151 pages
DSU Project For Review
No ratings yet
DSU Project For Review
28 pages
BoS Circular
No ratings yet
BoS Circular
9 pages
WBPDCL Recruitment 2019 01
No ratings yet
WBPDCL Recruitment 2019 01
5 pages
Ideathon
No ratings yet
Ideathon
18 pages
Academic Leadership Profile
No ratings yet
Academic Leadership Profile
20 pages
AI Club Hackathon Problem Statements
No ratings yet
AI Club Hackathon Problem Statements
26 pages
AICTE Approval Extension 2024-25
No ratings yet
AICTE Approval Extension 2024-25
4 pages
Confusion Regarding The Eligibility For Director/Principal of Engg./Technical Institutes
100% (1)
Confusion Regarding The Eligibility For Director/Principal of Engg./Technical Institutes
6 pages
Information Bulletin Gcek 2021 22
No ratings yet
Information Bulletin Gcek 2021 22
187 pages
Kumaraguru College of Technology
No ratings yet
Kumaraguru College of Technology
5 pages
Ii & Iii Year Hall Plan 10-3-2025 An
No ratings yet
Ii & Iii Year Hall Plan 10-3-2025 An
13 pages
Graded Quiz 1
No ratings yet
Graded Quiz 1
7 pages
AICTE Internship Recommendation Letter - EduSkills - 2025
No ratings yet
AICTE Internship Recommendation Letter - EduSkills - 2025
1 page
AICTE Approval Status 2011-12
No ratings yet
AICTE Approval Status 2011-12
144 pages
Writ Petition of Approved Teachers of VSPD
No ratings yet
Writ Petition of Approved Teachers of VSPD
16 pages
MTECH Quantum Curriculum
No ratings yet
MTECH Quantum Curriculum
48 pages
Aeronautical Engineering Student Lists
No ratings yet
Aeronautical Engineering Student Lists
27 pages
Educational Administration Structure Function and Processes at The State Government Level
100% (4)
Educational Administration Structure Function and Processes at The State Government Level
11 pages
Higher Education System
No ratings yet
Higher Education System
6 pages
Online Test Shortlists
No ratings yet
Online Test Shortlists
6 pages
Custodian Certificate For Pass port-B.Tech
No ratings yet
Custodian Certificate For Pass port-B.Tech
275 pages
Aph 2019-20
No ratings yet
Aph 2019-20
266 pages
Pune Polytechnic Courses 2015-2016
No ratings yet
Pune Polytechnic Courses 2015-2016
28 pages
AICTE Approval Guide for Institutions
No ratings yet
AICTE Approval Guide for Institutions
286 pages
Authority Letters from ICL Group
No ratings yet
Authority Letters from ICL Group
285 pages
NAAC Accreditation Process and Requirements
No ratings yet
NAAC Accreditation Process and Requirements
4 pages
Eoa Report 2024-2025 (Aicte)
No ratings yet
Eoa Report 2024-2025 (Aicte)
4 pages
All India Council For Technical Education: Approval Process 2019-20 Extension of Approval (Eoa)
No ratings yet
All India Council For Technical Education: Approval Process 2019-20 Extension of Approval (Eoa)
3 pages
UPES FAQ: Recognition, Placements, Admissions
No ratings yet
UPES FAQ: Recognition, Placements, Admissions
3 pages
APH 2024 27 Compressed
No ratings yet
APH 2024 27 Compressed
216 pages
NPTEL Online Courses Enrollment 2024
No ratings yet
NPTEL Online Courses Enrollment 2024
2 pages

Week 2 Dslab

Uploaded by

Week 2 Dslab

Uploaded by

CMR COLLEGE OF ENGINEERING & TECHNOLOGY

4.AIM:C program to implement single linked list and following operations.

Dept of CSE Page No.

printf("\n 7.Delete at end");

}// end of switch

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

printf("\n position is out of scope");

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE PageNo.

Dept of CSE Page No.

5.AIM:C program to implement to reverse the nodes of a single linked list

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

printf("\n choose any option");

}// end of switch

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

7.AIM:C Program to implement circular linked list and its operations

Dept of CSE Page No.

printf("\n choose any option");

}// end of switch

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

printf("enter position to insert:");

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

Dept of CSE Page No.

You might also like