A linked list is a linear type of data structure that comes in handy while solving complex problems. This module gives a brief on the linked list along with discussing its advantages, disadvantages, and applications. You also have a demonstration on a linked list with the help of a code example.

Stack comes under a linear data structure and is known for its FILO/LIFO property. The module focuses on introducing you to stack and goes through its several advantages, disadvantages, and applications. You will also learn about its demonstration using an array with the help of a code example.

A queue is a linear form of data structure and follows the FIFO/LILO property. The module starts by giving you a brief on queue, its advantages, disadvantages, and applications. Lastly, you will have a demonstration of the queue using an array with the help of a code example.

Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted. This module explains bubble sort and its algorithm in detail.