Scribd
Upload
4 views5 pages

CSE 2001 - Data Structures and Algorithms: Module 2: Linear Data Structure-Linked List

The document discusses linear data structures, specifically linked lists, and their advantages over arrays. It highlights the drawbacks of arrays, including fixed size, expensive insertions/deletions, memory wastage, and inefficiency with variable-sized data. The content also includes operations on singly linked lists and applications of linked lists.

Uploaded by

samevi8763
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views5 pages

CSE 2001 - Data Structures and Algorithms: Module 2: Linear Data Structure-Linked List

The document discusses linear data structures, specifically linked lists, and their advantages over arrays. It highlights the drawbacks of arrays, including fixed size, expensive insertions/deletions, memory wastage, and inefficiency with variable-sized data. The content also includes operations on singly linked lists and applications of linked lists.

Uploaded by

samevi8763
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

CSE 2001 - Data Structures and

Algorithms
Module 2: Linear Data Structure- Linked List

1
Contents
• Linked List
• Singly Linked List
• Operation on the linear list using singly linked storage
structures
• Circular List
• Applications of Linked list.

2
Drawback of Arrays
Fixed Size
• Arrays have a fixed size once initialized
• Either waste memory if the array is too large or require resizing if
the array becomes too small.
Expensive Insertions/Deletions
• In arrays, inserting or deleting elements requires shifting
elements, which can be costly (O(n) time complexity

3
Drawback of Arrays
Memory Wastage
• Arrays allocate memory for all elements upfront, even if not all are
used
Inefficient Memory Usage in Large Arrays
• Large arrays may cause memory fragmentation because they
require contiguous memory allocation
No Efficient Support for Variable-Sized Data
• Arrays are not well-suited for handling variable-sized data

4
Demonstration of insertion-deletion
operations in arrays

You might also like