Practical No : 08 (C)

Assignmet Title:

Write C++ program to maintain club member‘s information using singly

linked list.
Aim: Department of Computer Engineering has student's 1/8 club named
'Pinnacle Club'. Students of Second, third and final year of department can
be granted membership on request. Similarly one may cancel the
membership of club. First node is reserved for president of club and last
node is reserved for secretary of club. Write C++ program to maintain club
member‘s information using singly linked list. Store student PRN and
Name. Write functions to
a)Add and delete the members as well as president or even secretary.
b) Compute total number of members of club
c) Display members
d) Display list in reverse order using recursion
e) Two linked lists exists for two divisions. Concatenate two lists

Input: Individual details

Output: Maintain information of the Club member's
Objectives:
To maintain club member's information by performing
different operations like add, delete, reverse, concatenate on
singly linked list.

Theory:

What is Linked List

1. Read
2. Discuss
3. Courses
4. Practice
5. Video

Like arrays, a Linked List is a linear data structure. Unlike arrays, linked list
elements are not stored at a contiguous location; the elements are linked using pointers.
They includea series of connected nodes.
 Here, each node stores the data and the address of the next node.

Why Linked List?

Arrays can be used to store linear data of similar types, but arrays have the
following limitations:
o The size of the arrays is fixed: So we must know the upper limit on the
number of elements in advance. Also, generally, the allocated memory is
equal to the upper limit irrespective of the usage.
o Insertion of a new element / Deletion of a existing element in an array of
elements is expensive: The room has to be created for the new elements and
to create room existing elements have to be shifted but in Linked list if we
have the head node then we can traverse to any node through it and insert
new node at the required position.

Advantages of Linked Lists over arrays:

o Dynamic Array.
o Ease of Insertion/Deletion.

Drawbacks of Linked Lists:

1. Random access is not allowed. We have to access elements sequentially

starting from the first node(head node). So we cannot do a binary search
with linked lists efficiently with its default implementation.
2. Extra memory space for a pointer is required with each element of the list.
3. Not cache-friendly. Since array elements are contiguous locations, there is
the locality of reference which is not there in the case of linked lists.
4. It takes a lot of time in traversing and changing the pointers.
5. Reverse traversing is not possible in singly linked lists.
 Types of Linked Lists:

1. Simple Linked List – In this type of linked list, one can move or traverse
the linked list in only one direction. where the next pointer of each node
points to other nodes but the next pointer of the last node points to NULL.
It is also called “Singly Linked List”.
2. Doubly Linked List – In this type of linked list, one can move or traverse
the linked list in both directions (Forward and Backward)
3. Circular Linked List – In this type of linked list, the last node of the linked
list contains the link of the first/head node of the linked list in its next
pointer.
4. Doubly Circular Linked List – A Doubly Circular linked list or a circular
two-way linked list is a more complex type of linked list that contains a
pointer to the next as well as the previous node in the sequence. The
difference between the doubly linked and circular doubly list is the same
as that between a singly linked list and a circular linked list. The circular
doubly linked list does not contain null in the previous field of the first
node.

5. Header Linked List – A header linked list is a special type of linked list
that contains a header node at the beginning of the list.

Basic operations on Linked Lists:

1. Deletion
2. Insertion
3. Search
4. Display

Representation of Singly Linked Lists:

A linked list is represented by a pointer to the first node of the linked list. The first
node is called the head of the linked list. If the linked list is empty, then the value
of the head points to NULL.

Each node in a list consists of at least two parts:

1. A Data Item (we can store integers, strings, or any type of data).
2. Pointer (Or Reference) to the next node (connects one node to another) or
An address of another node
Conclusion:
By this way, we can maintain club member‘s information using singly linked
list.