Scribd
Upload
108 views15 pages

Intro to Linked Lists Lab

The document describes a lab assignment on data structures and linked lists. The objective is to learn about data structures, specifically single linked lists. There are three tasks: 1) Create a function to add nodes to a linked list, 2) Create a function to delete nodes from a linked list, and 3) Create a function to display all data in the linked list sequentially. Source code is provided for each task that implements the required functions for a linked list class.

Uploaded by

Muhammad Hamza Amin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
108 views15 pages

Intro to Linked Lists Lab

The document describes a lab assignment on data structures and linked lists. The objective is to learn about data structures, specifically single linked lists. There are three tasks: 1) Create a function to add nodes to a linked list, 2) Create a function to delete nodes from a linked list, and 3) Create a function to display all data in the linked list sequentially. Source code is provided for each task that implements the required functions for a linked list class.

Uploaded by

Muhammad Hamza Amin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

AIR UNIVERSITY

DEPARTMENT OF ELECTRICAL AND COMPUTER


ENGINEERING
LAB TITLE: Introduction To Data Structure

Student Name: M. Hamza Amin [Link]: 191862

Objective: To learn about types of data structure and mainly the concept of single
linked list.

LAB ASSESSMENT:

Excellent Good Average Satisfactory Unsatisfactory


Attributes
(5) (4) (3) (2) (1)
Ability to Conduct
Experiment
Ability to assimilate the
results
Effective use of lab
equipment and follows
the lab safety rules

Total Marks: Obtained Marks:

LAB REPORT ASSESSMENT:


Excellent Good Average Satisfactory Unsatisfactory
Attributes
(5) (4) (3) (2) (1)

Data presentation

Experimental results

Conclusion

Total Marks: Obtained Marks:

Date: Signature:
LAB# 01

DATA STRUCTURE

STUDENT NAME: M. HAMZA AMIN


ID NO: 191862
SUBMITTED TO: SIR UZAIR
TOPIC:
Introduction to data structure
Linked list:
A liked list is a linear data structure where each element is a
separate object. Each element (we will call it node) of a list is
comprising of two items - the data and a reference to the next
node. The last node has reference to null.

Lab Task # 1:
Make a function with name add link. Whenever you call this
function in the main, it will create a new node containing data.
SOURCE CODE:
#include<iostream>
using namespace std;
struct node
{
int data;
node *next;
};
class list
{
private:
node *head;
public:
//constructor to intialize
list()
{
head = NULL;
}
// make function add fuction to call this function in main
void add_link(int d)
{
node *temp,*ptr;
if(head==NULL)
{
head = new node;
head->data=d;
head->next=NULL;
}
else
{
ptr=head;
while(ptr->next!=NULL)ptr=ptr->next;
temp = new node;
temp->data=d;
temp->next=NULL;
ptr->next=temp;
}
}
//function to display value
void show()
{
node *temp;
temp = head;
cout<<"The nodes containing data is as follow:"<<endl;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp = temp->next;
}
}
};
//main function
int main()
{
list l;
l.add_link(10);
l.add_link(20);
l.add_link(30);
l.add_link(12);
[Link]();
cout<<endl;
}
Screen shot of program
OUTPUT:
TASK # 2:
Make a function which deletes node from your linked list.
SOURCE CODE:
#include<iostream>
using namespace std;
struct node
{
int data;
node *next;
};
class list
{
private:
node *head;
public:
list()
{
head = NULL;
}
void add(int d)
{
node *temp,*ptr;
if(head==NULL)
{
head = new node;
head->data=d;
head->next=NULL;
}
else
{
ptr=head;
while(ptr->next!=NULL)ptr=ptr->next;
temp = new node;
temp->data=d;
temp->next=NULL;
ptr->next=temp;
}
}
void del(int v)
{
node *temp, *pre;
temp = head;
if(temp->data==v)
{
head = temp->next;
delete temp;
cout<<endl<<v<<"has been deleted."<<endl;
return;

}
pre = temp;
while(temp!=NULL)
{
if(temp->data==v)
{
pre->next=temp->next;
delete temp;
cout<<"/nValue deleted."<<endl;
return;
}
pre = temp;
temp = temp->next;
}
cout<<endl<<v

}
void display()
{
node *temp;
temp = head;
cout<<"The list is as follow:"<<endl;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}

}
};
int main()
{
list l;
[Link](12);
[Link](13);
[Link](14);
[Link](15);
[Link]();
cout<<endl;
[Link](12);
[Link]();
}
SCREEN SHOTS OF PROGRAM:
OUTPUT:

TASK #3
Write a function to display all the data of your linked list
sequentially.
SOURCE CODE:

You might also like