Data Structure & Algorithm - Upskill with Webdroid

About Course

Data Structures and Algorithms (DSA) is a foundational area of computer science that focuses on organizing data efficiently and solving problems through step-by-step procedures. Data structures like arrays, linked lists, stacks, and trees are used to store and manage data, while algorithms such as sorting, searching, and recursion provide techniques to process that data. Mastery of DSA is essential for efficient problem-solving and is widely used in software development and technical interviews.

Fundamental data structures like arrays, linked lists, stacks, and queues.
Advanced data structures such as trees, graphs, heaps, and hash tables.
Searching and sorting algorithms (e.g., binary search, quicksort, mergesort).
Concepts of time and space complexity (Big O notation).
Recursion and backtracking techniques.
Greedy algorithms and dynamic programming.
Graph algorithms including depth-first search (DFS) and breadth-first search (BFS).
Practical problem-solving using data structures and algorithms for real-world applications.

Course Content

Introduction

Introduction to DSA

00:00
Why Learn DSA?

00:00
Prerequisites

00:00
Python Lists

00:00

Sorting Algorithms

Search Algorithms

Linked List

Circular Linked List

Doubly Linked List

Stacks and Queue

Hashing

String Matching Algorithms

Tree Data Structure

Binary Tree

Heaps

Graph Data Structure

Relationships in a Graph

Graph Based Algorithms

Greedy Algorithms

Sorting (II)

Balanced Trees

About Course

What Will You Learn?

Course Content

Introduction

Introduction to DSA

Why Learn DSA?

Prerequisites

Python Lists

Sorting Algorithms

Sorting

Bubble Sort

Selection Sort

Insertion Sort

Merge Sort

Quick Sort

Counting Sort

Search Algorithms

Search Algorithms

Linear Search

Binary Search

Linked List

Linked List

Linked List Operations

Examples: Linked List

Circular Linked List

Introduction to Circular Linked List

Circular Linked List Operations

Examples: Circular Linked List

Doubly Linked List

Introduction to Doubly Linked List

Doubly Linked List Operations

Examples: Doubly Linked List

Stacks and Queue

Stack

Queue

Drawbacks of Linear Queues

Circular Queue

Double Ended Queue (Deque)

Hashing

Introduction to Hashing

Hashing Techniques

Hash Collision

Hash Collision Resolution

Hash Functions8.6Additional Topics

String Matching Algorithms

Introduction

Brute Force Method

Rabin-Karp String Matching Algorithm

Knuth-Morris-Pratt (KMP) Algorithm

Tree Data Structure

Non-linear Data Structure

Tree Data Structure

Implementation of Trees

Tree Traversal

Binary Tree

Introduction to Binary Trees

Properties of Binary Trees

Implementation of Binary Trees

Traversal of Binary Tree

Types of Binary Trees

Example: Huffman Coding

Example: Binary Search Tree

Heaps

Array Representation of Binary Tree

Introduction to Heaps

Heap Operations

Heapify

Heap Sort

Heap as a Priority Queue

Graph Data Structure

Graph Data Structure

Graph Terminologies

Adjacency Matrix

Adjacency List

Graph Traversal With DFS Algorithm

BFS Algorithm

Relationships in a Graph

Graph Connectivity

Touring a Graph

Graph Comparisons and Special Properties