Home Courses Data Structures and Algorithms

Gate CSE

Data Structures and Algorithms

Data Structures and Algorithms (DSA) is a core subject that focuses on organizing, storing, and processing data efficiently. It covers various data structures like arrays, linked lists, stacks, queues, trees, and graphs, along with algorithms for searching, sorting, and optimization. This subject is essential for designing efficient programs and solving complex computational problems.

Lectures

350+ Lectures

Duration

90+ Hours

Instructor

Satish

₹5,999.00 ₹9,999.00 40% OFF

Enroll Now

Course Content

INTRO

Insertion Sort, Merge Sort and Asymptotic Analysis

0min

Insertion Sort is a simple method that builds a sorted list step by step, while Merge Sort efficiently sorts data using a divide-and-conquer approach. Asymptotic Analysis helps evaluate and compare these algorithms by me...

Chapters: 3 Assignments: 0 0min

Insertion Sort

1.1

Introduction to Searching and Sorting

20 mins

1.2

Insertion sort : Key and Satellite Data

11 mins

1.3

insertion sort - Intuition with an Example

17 mins

1.4

Insertion sort - Pseudocode

22 mins

1.5

Insertion sort- In place Sorting

8 mins

1.6

Insertion Sort - Stable sort

13 mins

1.7

Insertion Sort - Online Sort

7 mins

1.8

Insertion Sort - Time Complexity-1

6 mins

1.9

Insertion sort - Time Complexity -2

21 mins

1.10

Insertion sort - Space Complexity

3 mins

1.11

Insertion sort - Big O Analysis

11 mins

1.12

Insertion Sort - Big O analysis with Examples

6 mins

Asymptotic Analysis

2.1

Big O Notation

13 mins

2.2

Big Theta and Big Omega Notations

10 mins

2.3

Small oh Notation

13 mins

2.4

Small Omega Notation

9 mins

2.5

Relation Between Various Notations

19 mins

2.6

Why does Asymptotic Analysis is Important in the real world ?

17 mins

Merge sort

3.1

Merge Sort: Why Study Another Sorting algorithm ?

6 mins

3.2

Merge Sort: Intuition

13 mins

3.3

Merge Sort: Pseudo Code

20 mins

Module 2

Bubble Sort, Quick Sort, Selection sort, Recursion and Recurrence Relations

0min

Bubble Sort, Selection Sort, and Quick Sort are sorting algorithms where Bubble and Selection are simple but less efficient, while Quick Sort is faster using a divide-and-conquer approach. Recursion is a technique where...

Chapters: 5 Assignments: 0 0min

Approaches to Solve Recurrence Relations

Recursion Concept with an Examples

Bubble Sort

Quick Sort

Selection sort

Module 3

Linear Time Sorting Algorithms

0min

Linear time sorting algorithms sort data in O(n) time by leveraging specific properties like limited range or digit structure instead of comparisons. Examples include Counting Sort, Radix Sort, and Bucket Sort, which are...

Chapters: 2 Assignments: 0 0min