Description

TABLE OF CONTENT

Introduction
1.1 Overview of Data Structures and Algorithms
1.2 Importance of DS & Algo in Computer Science

Basics of Programming
2.1 Programming Paradigms
2.2 Control Structures
2.3 Basic Data Types and Variables

Time and Space Complexity Analysis
3.1 Big-O Notation
3.2 Time Complexity Analysis
3.3 Space Complexity Analysis

Arrays
4.1 Introduction to Arrays
4.2 Array Operations
4.3 Multi-dimensional Arrays

Linked Lists
5.1 Singly Linked Lists
5.2 Doubly Linked Lists
5.3 Circular Linked Lists

Stacks
6.1 Introduction to Stacks
6.2 Stack Operations
6.3 Applications of Stacks

Queues
7.1 Introduction to Queues
7.2 Queue Operations
7.3 Types of Queues

Trees
8.1 Introduction to Trees
8.2 Binary Trees
8.3 Tree Traversal Techniques

Graphs
9.1 Introduction to Graphs
9.2 Types of Graphs
9.3 Graph Traversal Algorithms

Sorting Algorithms
10.1 Bubble Sort
10.2 Selection Sort
10.3 Insertion Sort
10.4 Merge Sort
10.5 Quick Sort

Searching Algorithms
11.1 Linear Search
11.2 Binary Search
11.3 Hashing

Hashing
12.1 Introduction to Hashing
12.2 Hash Functions
12.3 Hash Tables

Dynamic Programming
13.1 Introduction to Dynamic Programming
13.2 Memoization
13.3 Tabulation

Greedy Algorithms
14.1 Introduction to Greedy Algorithms
14.2 Greedy Choice Property
14.3 Applications of Greedy Algorithms

Advanced Data Structures
15.1 Priority Queues and Heaps
15.2 Disjoint Set (Union-Find) Data Structure
15.3 Trie Data Structure