Learn how to create DataFrame using Python library called pandas and see how elegently arrays are processed and presented in tabular form.

Learn how to create an empty data frame and add new columns in it (prime number and its square)

Learn how to add, delete and update data in a DataFrame.

Learn how to generate nth Prime number.

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.

Insertion Sort is a simple sorting algorithm in which each Item is placed in the sorted sequence one by one

Merge Sort is a sorting algorithm that uses a divide-and-conquer technique to efficiently sort a list of elements

Exploring an adaptive search algorithm that automatically uses linear search for unsorted arrays and binary search for sorted ones.

The goal of Breadth-First Search (BFS) is to systematically explore all of the nodes or vertices of a graph in layers, starting from a particular node and moving outward to its neighbors before exploring deeper levels

Depth First Search (DFS) is to systematically explore all the nodes in a graph or tree structure by traversing as far as possible along each branch before backtracking

Singly Linked List (SLL), which includes its creation, traversal , insertion of elements, deletion of elements, and search for elements through visualization.

CPU Scheduling is a fundamental concept in oerating systems, responsible for determining which process runs at any given time

Encoding Hamming Code. Computers represent data digitally as 1s and 0s, called 'bits'. Sometimes these bits are mistakenly swapped, for example: a scratched CD or a message garbled in transit between computers. Invented in 1950 by Richard Wesley Hamming. Hamming Code can correct 1-bit errors and detect 2-bit errors, making data transfer and saving more robust.

Extracting text from two images using Optical Character Recognition (OCR) technique and comparing their content using Natural Language Processing (NLP) techniques.

Fundamentals of building Deterministic Finite Automata (DFA) using regular expressions.