Home Courses Data Structures and Algorithms

Data Structures and Algorithms

Category: Gate CSE

Data Structures and Algorithms

Category: Gate CSE

₹8,000.00 ₹12,000.00

Instructor

Chekuri Srikanth Varma

Asymptotic Analysis and Insertion Sort, Merge Sort
Chapters : 8 Assignments : 2 Completed :

Why study DS and Algorithms?

1.1

Why study DS and Algorithms?

20 mins

Sorting & Searching : why bother with these simple tasks?

2.1

Sorting & Searching : why bother with these simple tasks?

17 mins

Insertion sort

3.1

Satellite data and key

11 mins

3.2

How it works: Card-sorting

20 mins

3.3

Pseudo code

18 mins

3.4

Correctness.

6 mins

3.5

In-place sorting

8 mins

3.6

Stable sort.

15 mins

3.7

Online sorting.

10 mins

Analyzing an algorithm

4.1

Model of computation

17 mins

4.2

Space and time analysis of Insertion Sort-1

7 mins

4.3

Space and time analysis of Insertion Sort-2

22 mins

Big O, Theta, Omega notation.

5.1

Insertion sort: Big O-notation

15 mins

5.2

Notations: Big O

15 mins

5.3

Notations: Big Omega, Theta

9 mins

5.4

Notations: Small O, Omega, Theta

24 mins

5.5

Relationships between various notations.

21 mins

5.6

Order of common functions & real world applications.

26 mins

5.7

Why does asymptotic analysis matter in the real world?

16 mins

5.8

Solved Problem: Polynomials

18 mins

5.9

Solved Problem: n>n0 case

5 mins

5.10

Solved Problem: GATE 2001

6 mins

5.11

Solved Problem: GATE 2011

10 mins

5.12

Solved Problem: GATE 2003, Inversions

12 mins

5.13

Solved Problem: GATE 2003

9 mins

5.14

Solved Problem: GATE 2008

5 mins

5.15

GATE 2013

6 mins

5.16

GATE 2006

7 mins

Practice Test-1 Insertion Sort & Asymptotics Notations

6.1

Solutions for Practice Test-1

66 mins

Practice Test-1 Insertion sort and Asymptotic Notations

Merge Sort

7.1

Why learn another sorting algorithm?

6 mins

7.2

How it works: Intuition

17 mins

7.3

Pseudo Code

19 mins

7.4

Analyzing time & space complexity

21 mins

7.5

Recursion tree method: intuition

13 mins

7.6

External Merge-Sort

25 mins

7.7

Solved Problem GATE 2007

5 mins

7.8

Solved Problem

4 mins

7.9

Solved Problem GATE 2015

5 mins

Practice Test 2 Ordering of Growth Functions & Merge Sort

8.1

Solutions for Practice Test-2

70 mins

Practice Test-2 Ordering of Growth Functions and Merge Sort

Recurrences, Recursion and Bubble Sort, Quick Sort
Chapters : 6 Assignments : 1 Completed :

Solving Recurrences

9.1

Recursion tree method

15 mins

9.2

Master theorem

21 mins

9.3

Extended Master Theorem

9 mins

9.4

Inadmissible cases & Shortcuts

6 mins

9.5

Substitution method.

15 mins

Recursion in programming

10.1

Factorial: Time and Space complexity

21 mins

10.2

Recursion vs iteration

7 mins

10.3

Tail recursion/Tail-Call Optimization

14 mins

Solved Problems of Solving Recurrences & Recursion in programming

11.1

GATE 2011

4 mins

11.2

Fibonacci: Time Complexity

7 mins

11.3

GATE 2007

6 mins

11.4

GATE 2006

7 mins

11.5

Shortcut + GATE 2004

6 mins

11.6

GATE 2009

3 mins

11.7

GATE 2008

4 mins

11.8

GATE 2005

4 mins

11.9

GATE 2003

8 mins

11.10

GATE 2016

8 mins

11.11

GATE 2016

7 mins

Bubble Sort

12.1

How it works: intuition + code

22 mins

12.2

Space and time complexity

9 mins

12.3

Why bubble sort should be avoided?

5 mins

12.4

Solved Problem GATE 2000

8 mins

12.5

Solved Problem GATE 1995

3 mins

Quick sort

13.1

Why do we need another sorting algorithm?

5 mins

13.2

How it works: intuition

12 mins

13.3

Partitioning

15 mins

13.4

Quick sort by recursion

9 mins

13.5

Time complexity: Best and Worst cases.

16 mins

13.6

Randomized quicksort and amortized analysis

8 mins

13.7

Solved Problem GATE 2016

3 mins

13.8

Solved Problem GATE 2009

3 mins

13.9

Solved Problem GATE 2001

4 mins

13.10

Solved Problem GATE 2008

2 mins

13.11

Solved Problem GATE 2015

2 mins

13.12

Solved Problem GATE 2014

3 mins

13.13

Solved Problem GATE 2019

3 mins

Practice Test-3 Solving Recurrence Relations, Bubble Sort, Quick Sort, Linear Time Sorting etc

14.1

Solutions for Practice Test-3

78 mins

Practice Test-3 Solving Recurrence Relations,Bubble Sort, Quick Sort, Linear Time Sorting-Counting Sort and Radix Sort

Selection Sort and Linear Time Sorting
Chapters : 5 Assignments : 1 Completed :

Selection sort

15.1

How it works: intuition + code

11 mins

15.2

Space and time complexity.

7 mins

15.3

When to use Selection sort?

4 mins

15.4

Solved Problem GATE 2013, 2009

1 mins

15.5

Solved Problem GATE 2007

1 mins

15.6

Solved Problem GATE 2016

1 mins

15.7

Sample Question

3 mins

Linear time sorting

16.1

Lower bounds on worst case of comparison sorting

33 mins

16.2

Counting sort: intuition + code

19 mins

16.3

Space and time complexity

4 mins

16.4

Radix Sort

6 mins

16.5

Where to use which sorting algorithm?

8 mins

16.6

Solved Problem GATE 2008

6 mins

Interactive problem solving session on DS & Algo-1 (2022)

17.1

Interactive problem solving session on DS & ALGO PART 1 | GATE CS 2022

70 mins

Interactive problem solving session on DS & Algo-2 (2022)

18.1

Interactive problem solving session on DS & ALGO PART 2 | GATE CS 2022

79 mins

Practice Test-4 Introduction to Algorithms- Linear time sorting

19.1

Solutions for Practice Test-4

96 mins

Practice Test-4 Introduction to Algorithms - Linear Time Sorting Algorithms

Data structures introduction and linked lists
Chapters : 5 Assignments : 0 Completed :

Data Structures: Introduction

20.1

What are Data Structures?

12 mins

20.2

Where do arrays fail?

12 mins

Singly Linked List

21.1

Structure & memory organization

19 mins

21.2

Code for node

4 mins

21.3

Insertion

19 mins

21.4

Delete

13 mins

21.5

Traversal & Search

9 mins

21.6

Drawbacks

10 mins

21.7

Solved Problem GATE 2002

2 mins

21.8

Solved Problem GATE 2010

6 mins

Doubly Linked List

22.1

Motivation for DLL

9 mins

22.2

Structure & memory organization

6 mins

22.3

Insert

13 mins

22.4

Delete

10 mins

22.5

Drawbacks

2 mins

Circular Linked List

23.1

Motivation

4 mins

23.2

Singly and Doubly Linked Circular Lists

6 mins

23.3

Code

2 mins

23.4

Solved Problem GATE 2016

7 mins

Interactive Problem Solving DS & Algo-1

24.1

Interactive Problem Solving DS & Algo-1

58 mins

Stacks and stack operations
Chapters : 6 Assignments : 1 Completed :

Stacks

25.1

Motivation: Why we need them?

12 mins

25.2

Operations: Push and Pop

5 mins

25.3

How to implement a stack?

16 mins

25.4

Application: Parenthesis check

20 mins

Expression evaluation

26.1

Infix, Prefix and Postfix

16 mins

26.2

Infix to Postfix

20 mins

26.3

Infix to Prefix

7 mins

26.4

Evaluation of postfix

7 mins

26.5

Evaluation of prefix

4 mins

More Applications: Call Stack

27.1

More Applications: Call Stack

18 mins

Space complexity of Quicksort using Call-stack

28.1

Worst case

15 mins

28.2

Sedgewick’s solution

22 mins

Solved Problems of Stacks

29.1

GATE 2004-1

1 mins

29.2

GATE 2004-2

5 mins

29.3

GATE 2007

4 mins

29.4

GATE 1997

2 mins

29.5

GATE 2005

3 mins

29.6

GATE 1991

1 mins

Practice Test 5 Single Linked List, Double Linked List, Circular Linked List, Stack, Expression Evaluation, Prefix, Infix, Postfix

30.1

Solutions for Practice Test-5

78 mins

Practice Test-5 Single Linked List, Double Linked List ,Circular Linked List, Stack, Expression Evaluation, Prefix ,Infix, Postfix

Queues and Arrays
Chapters : 8 Assignments : 1 Completed :

Queues

31.1

Motivation: Why we need them?

8 mins

31.2

Operations: Enqueue and Dequeue

5 mins

31.3

How to implement them?

12 mins

31.4

Linear and Circular Queue implementations.

5 mins

31.5

Solved Problem GATE 2018

4 mins

31.6

Solved Problem GATE 2004

4 mins

31.7

Solved Problem GATE 2016

11 mins

31.8

Solved Problem GATE 2013

4 mins

31.9

Solved Problem GATE 2016-2

2 mins

31.10

Solved Problem GATE 2012

5 mins

31.11

Solved Problem GATE 1996

2 mins

31.12

Solved Problem GATE 2007

6 mins

31.13

Solved Problem GATE 2014

7 mins

Arrays as a data-structure

32.1

One-dimensional array

17 mins

32.2

Multi-dimensional array

31 mins

Special types of 2D arrays

33.1

Symmetric matrix

12 mins

33.2

Lower triangular matrix & Diagonal matrix

8 mins

33.3

Tridiagonal matrix, Z-matrix, Toeplitz Matrix

7 mins

Dynamic arrays & Amortized time

34.1

Dynamic arrays & Amortized time

20 mins

Array vs Linked Lists

35.1

Array vs Linked Lists

3 mins

Solved Problems

36.1

GATE 2000

4 mins

36.2

GATE 2000-2

5 mins

36.3

GATE 2004

3 mins

36.4

GATE 2005

4 mins

36.5

GATE 1994

4 mins

36.6

GATE 1998

5 mins

36.7

Gate 2004

5 mins

36.8

GATE 2015

5 mins

36.9

GATE 2002

3 mins

Interactive problem solving session on DS & Algo-3 (2022)

37.1

Interactive problem solving session on DS & ALGO PART 3 | GATE CS 2022

80 mins

Practice Test-6 Queues and Arrays

38.1

Solutions for Practice Test-6

80 mins

Practice Test-6 Queue,Arrays

Searching, Binary Seatch Tree, Trees, Heap Sort
Chapters : 14 Assignments : 1 Completed :

Linear Search

39.1

Linear Search: intuition and code

10 mins

Binary Search

40.1

Intuition

19 mins

40.2

Pseudo code

9 mins

Binary Search Tree: intuition & terminology

41.1

Binary Search Tree: intuition & terminology

22 mins

Implementation using Pointers/References

42.1

Implementation using Pointers/References

6 mins

Implementation using Arrays

43.1

Implementation using Arrays

13 mins

Operations

44.1

Build a BST

18 mins

44.2

Operations: Search, Insert, Min and Max

22 mins

44.3

Traversals: in-order & sort, pre-order, post-order

17 mins

44.4

Operations: Delete

12 mins

Randomized BST

45.1

Randomized BST

10 mins

Solved Problems

46.1

GATE 2003

6 mins

46.2

GATE 2018

10 mins

46.3

GATE 2017

6 mins

46.4

GATE 2017

8 mins

46.5

GATE 2003

5 mins

46.6

GATE 2003

2 mins

46.7

GATE 2013

2 mins

46.8

GATE 2015

2 mins

46.9

GATE 2011

4 mins

46.10

GATE 1994

2 mins

46.11

GATE 2014

4 mins

Trees

47.1

Logical structure & implementation

12 mins

47.2

Terminology & Traversals

18 mins

47.3

Types of Binary Trees

14 mins

47.4

Properties of a Tree: Depth, Nodes, Leafs

12 mins

47.5

Application: Backtracking for Sudoku( optional)

35 mins

47.6

Application: Backtracking for Eight Queens(optional)

16 mins

47.7

Applications of Trees: Hierarchical information, Websites (DOM) (OPTIONAL)

10 mins

Solved Problems

48.1

GATE 2004

8 mins

48.2

GATE 2010

4 mins

48.3

GATE 2017

5 mins

48.4

GATE 2013

4 mins

48.5

GATE 2006

6 mins

48.6

GATE 2006

5 mins

Application: Expression Evaluation

49.1

Postfix to Expression Tree

13 mins

49.2

Evaluating an expression Tree

10 mins

Heap Sort

50.1

Heap: What and Why?

14 mins

50.2

Heapify

15 mins

50.3

Build a Heap

9 mins

50.4

Time Complexity of build_max_heap

19 mins

50.5

Heap Sort

12 mins

50.6

Time and Space complexity of HeapSort

5 mins

50.7

Priority queues: Application of Heaps

13 mins

50.8

Comparison of all sorting methods (time and space complexity)

6 mins

50.9

Solved Problem GATE 2006

2 mins

50.10

Solved Problem GATE 2005

5 mins

50.11

Solved Problem GATE 2003

4 mins

50.12

Solved Problem GATE 2018

4 mins

50.13

Solved Problem GATE 2016

3 mins

50.14

Solved Problem GATE 2004-1

2 mins

50.15

Solved Problem GATE 2004-2

3 mins

50.16

Solved Problem GATE 2014

2 mins

Interactive problem solving session on DS & Algo-4 (2022)

51.1

Interactive problem solving session on DS & ALGO PART 4 | GATE CS 2022

89 mins

Practice Test-7 Searching, Binary Search Tree, Trees, Heap Sort

52.1

Solutions for Practice Test-7

99 mins

Practice Test-7 Searching, Binary Search Tree, Trees ,Heap Sort

Balanced Trees and Hashing
Chapters : 13 Assignments : 1 Completed :

Balanced Trees: AVL Trees

53.1

AVL Trees: What and Why?

21 mins

53.2

Height of an AVL Tree & Searching

18 mins

Balancing a Tree using Rotations.

54.1

Single rotation: LL, RR

23 mins

Double rotation

55.1

RL Rotation

15 mins

55.2

LR Rotation

9 mins

Insertion with example

56.1

Insertion with example

41 mins

Delete

57.1

Delete

16 mins

Solved Problems

58.1

GATE 2009

3 mins

58.2

GATE 2008

2 mins

58.3

Sample Question

5 mins

Hash-Tables

59.1

Hash-Tables: What and Why?

8 mins

59.2

Direct access table

10 mins

59.3

Hash Functions and collisions

8 mins

59.4

Chaining & load factor

16 mins

Hash functions

60.1

Division method (Modulo Hash function)

12 mins

60.2

Multiplication method

11 mins

Collision Resolution

61.1

Open Addressing (Closed Hashing)

13 mins

61.2

Linear probing

9 mins

61.3

Double Hashing

4 mins

61.4

Quadratic Probing

4 mins

Applications

62.1

Sparse Matrix representation.

12 mins

62.2

Super Fast Search

7 mins

Solved Problems

63.1

GATE 2004

2 mins

63.2

GATE 2014

5 mins

63.3

GATE 2015

8 mins

63.4

GATE 2006

2 mins

63.5

GATE 2015

2 mins

63.6

GATE 2007

3 mins

63.7

Sample Question-8

6 mins

Practice test 8 Balanced Trees( AVL Trees), Hashing

64.1

Problem 1

7 mins

64.2

Problem 2

4 mins

64.3

Problem 3

4 mins

64.4

Problem 4

9 mins

64.5

Problem 5

5 mins

64.6

Problem 6

8 mins

64.7

Problem 7

1 mins

64.8

Problem 8

1 mins

64.9

Problem 9

2 mins

64.10

Problem 10

4 mins

64.11

Problem 11

6 mins

64.12

Problem 12

4 mins

64.13

Problem 13

5 mins

64.14

Problem 14

6 mins

64.15

Problem 15

3 mins

Practice Test-8 Balanced Trees : AVL Trees , Hashing

Interactive Problem Solving DS & Algo-2

65.1

Interactive Problem Solving DS & Algo-2

66 mins

Graphs
Chapters : 5 Assignments : 1 Completed :

Graphs-I

66.1

Graphs: Why, What and Basics

32 mins

66.2

Representation of Graphs: Adjacency Matrix

13 mins

66.3

Representation of Graphs: Adjacency Lists

12 mins

66.4

Connectivity in undirected Graphs

19 mins

66.5

Connectivity in Directed Graphs

15 mins

66.6

Breadth First Search: Intuition and example

19 mins

66.7

BFS: Color coding intuition

7 mins

66.8

BFS: Code and Complexity

15 mins

66.9

BFS: Applications

10 mins

66.10

Depth First Search: Intuition and code

36 mins

66.11

DFS: Analysis

5 mins

66.12

DFS: Edge types

11 mins

66.13

Application of DFS: Detect cycles in a di-graph

9 mins

66.14

Application: Strongly connected components

26 mins

66.15

Application of DFS: Topological Sort

19 mins

66.16

Solved Problems GATE 2003

5 mins

66.17

Solved Problem GATE 2016

4 mins

66.18

Solved Problem GATE 2016 - 1

4 mins

66.19

Solved Problem GATE 2000

5 mins

66.20

Solved Problem GATE 2014-Set 1

5 mins

66.21

Solved Problem GATE 2014 Set 2

5 mins

66.22

Solved Problem GATE 2014 Set 3

6 mins

Interactive problem solving session on DS & Algo-5 (2022)

67.1

Interactive problem solving session on DS & ALGO PART 5 | GATE CS 2022

79 mins

Graphs: Spanning Trees

68.1

Minimal Spanning Tree: What and Why?

19 mins

68.2

Kruskal's Algorithm

24 mins

68.3

Prim's Algorithm

34 mins

68.4

Properties of MST

23 mins

68.5

Solved Problem GATE 2016

12 mins

68.6

Solved Problem-2

5 mins

68.7

Solved Problem: MST using Prim's and Kruskal's Algorithms

12 mins

68.8

Solved Problem GATE 2016

8 mins

68.9

Solved Problem GATE 2005

5 mins

68.10

Solved Problem GATE 2006

7 mins

68.11

Solved Problem GATE 2014

9 mins

68.12

Solved Problem GATE 2015

5 mins

Graphs: Shortest Paths

69.1

Shortest paths: What and Why?

11 mins

69.2

Dijikstra's Algorithm

20 mins

69.3

Bellman-Ford Algorithm

20 mins

69.4

Shortest Paths for DAGs

14 mins

69.5

All Pairs shortest paths: Matrix Operations

31 mins

69.6

Floyd-Warshall Algorithm

21 mins

69.7

Solved Problem GATE 2013

1 mins

69.8

Solved Problem GATE 2006

4 mins

69.9

Solved Problem GATE 2004

3 mins

69.10

Solved Problem GATE 2008

6 mins

69.11

Solved Problem GATE 2007

2 mins

69.12

Solved Problem GATE 2012

6 mins

69.13

Solved Problem GATE 2009

6 mins

69.14

Solved Problem GATE 2005

2 mins

69.15

Solved Problem GATE 2016 - 1

11 mins

69.16

Solved Problem GATE 2016 - 2

6 mins

Practice Test-9 Solutions for Graph Algorithms

70.1

2 mins

70.2

3 mins

70.3

2 mins

70.4

2 mins

70.5

4 mins

70.6

7 mins

70.7

2 mins

70.8

7 mins

70.9

1 mins

70.10

2 mins

70.11

6 mins

70.12

5 mins

70.13

3 mins

70.14

15 mins

70.15

3 mins

70.16

7 mins

70.17

8 mins

70.18

9 mins

70.19

8 mins

70.20

3 mins

70.21

4 mins

70.22

6 mins

70.23

3 mins

70.24

2 mins

70.25

3 mins

Practice Test-9 Graph Search,DFS,BFS,Spanning Trees, Prim's , Kruskal, Shortest Path, DIjkstra, Bellman Ford, Floyd Warshall, Topological Sorting

Dynamic Programming
Chapters : 2 Assignments : 1 Completed :

Dynamic Programming

71.1

Introduction: Fibonacci numbers

34 mins

71.2

Longest Common Subsequence (LCS)

33 mins

71.3

LCS: Example

21 mins

71.4

0/1 Knapsack

31 mins

71.5

0/1 Knapsack: example

21 mins

71.6

Matrix Chain Multiplication

36 mins

71.7

Subset-sum problem

23 mins

71.8

Traveling Salesman problem

20 mins

71.9

Bellman Ford Algorithm as Dynamic Programming

18 mins

71.10

Floyd Warshall Algorithm as Dynamic Programming

12 mins

71.11

Solved Problem GATE 2016

1 mins

71.12

Solved Problem GATE 2015

3 mins

71.13

Solved Problem GATE 2011

8 mins

71.14

Solved Problem GATE 2008

5 mins

Practice Test-10 Dynamic Programming

72.1

Solutions for Practice Test-10

78 mins

Practice Test-10 Dynamic Programming

Greedy Algorithms
Chapters : 4 Assignments : 1 Completed :

Greedy Algorithms

73.1

Greedy Algorithms: Fractional Knapsack

30 mins

73.2

Solved Problem: GATE [2018]

10 mins

73.3

Huffman Coding for Data Compression

31 mins

73.4

Solved Problem: GATE 2017

7 mins

73.5

Solved Problem: GATE 2007

4 mins

73.6

Solved Problem: GATE 2006

4 mins

73.7

Job Sequencing with deadlines

16 mins

73.8

Solved Problem [GATE 2005]

5 mins

73.9

Optimal Merge Pattern

14 mins

73.10

Solved Problem: GATE 1999

5 mins

73.11

Solved Problem: GATE 2014

4 mins

73.12

Minimum Spanning Trees: Prim's algorithm

20 mins

73.13

Minimum Spanning Trees: Greedy Kruskal's Algorithm

15 mins

73.14

Greedy Algorithm: Dijkstra's algorithm

16 mins

Practice Test 11 Greedy Algorithms

74.1

Solutions for Practice Test-11

65 mins

Practice Test- 11 Greedy Algorithms

Interactive Problem Solving session on DS ALGO

75.1

Interactive Problem Solving Data Structures and Algorithms

66 mins

Interactive problem solving session on DS & Algo-6 (2022)

76.1

Interactive problem solving session on DS & ALGO PART 6 | GATE CS 2022

88 mins

GATE Previous Year Q & A with Video Solutions
Chapters : 19 Assignments : 0 Completed :

Previous year GATE Questions (2007)

77.1

3 mins

77.2

3 mins

77.3

4 mins

77.4

1 mins

77.5

11 mins

77.6

3 mins

77.7

5 mins

77.8

6 mins

77.9

4 mins

77.10

10 mins

77.11

13 mins

77.12

7 mins

77.13

7 mins

77.14