Home Courses Programming, Data Structures and Algorithms

Programming, Data Structures and Algorithms

Category: Gate DA

Programming, Data Structures and Algorithms

Category: Gate DA

₹9,000.00 ₹11,000.00

Instructor

Chekuri Srikanth Varma

Python programming Introduction
Chapters : 4 Assignments : 2 Completed :

Python : Introduction

1.1

Why learn Python?

4 mins

1.2

Online tools for Python: Google Colab , HackerRank, LeetCode

14 mins

1.3

Learning Methodology for Programming

6 mins

1.4

Keywords and identifiers

6 mins

1.5

comments, indentation and statements

9 mins

1.6

Variables and data types in Python

32 mins

1.7

Standard Input and Output

7 mins

1.8

Operators

14 mins

1.9

Control flow: if else

10 mins

1.10

Control flow: while loop

16 mins

1.11

Control flow: for loop

15 mins

1.12

Control flow: break and continue

10 mins

Inbuilt Data Structures

2.1

Lists

38 mins

2.2

Tuples part 1

10 mins

2.3

Tuples part-2

4 mins

2.4

Sets

16 mins

2.5

Dictionary

21 mins

2.6

Strings

16 mins

Introduction to functions

3.1

Introduction

13 mins

3.2

Types of functions

25 mins

3.3

Function arguments

10 mins

Programming problems-1

4.1

Using HackerRank to practice programming

14 mins

4.2

Problem-1: Sum of "n" input integers

18 mins

4.3

Problem-2: Second largest element in a list

18 mins

4.4

Problem-3: Fizz Buzz

11 mins

4.5

*** Mandatory Exercise***

60 mins

4.6

Additional practice problems [optional]

1 mins

Python Recursion and miscellaneous topics
Chapters : 2 Assignments : 0 Completed :

Recursion and Dynamic Programming

5.1

Introduction to Recursion

20 mins

5.2

power(a,b) using recursion

25 mins

5.3

Asymptotic Analysis using Recursion Tree method

16 mins

5.4

Call-Stack for Recursion

13 mins

Miscellaneous topics in Python

6.1

Lambda functions

8 mins

6.2

File Handling in Python

23 mins

6.3

Exception Handling

15 mins

6.4

Debugging in Python

15 mins

6.5

Solved Problem: Find elements common in two lists

6 mins

6.6

Solved Problem: Find elements common in two lists using a Hashtable/Dict

12 mins

6.7

Build a simple Tiny URL service

24 mins

Object Oriented Programming(Optional)
Chapters : 1 Assignments : 0 Completed :

Object Oriented Programming

7.1

Procedural vs Object Oriented Programming

8 mins

7.2

Classes and Objects ( real-world example: the TinyURL service)

26 mins

7.3

Empty Classes and documentation

4 mins

7.4

Class Variables and Private Members

12 mins

7.5

Abstraction and Inheritance (with real-world examples)

25 mins

7.6

Common questions & experimental learning

14 mins

7.7

Example: OOP for representing Shapes

21 mins

7.8

How is OOP used in an ML role?

7 mins

7.9

Multiple Inheritance

16 mins

7.10

Polymorphism (with real world examples)

19 mins

7.11

Additional topics in OOPs

37 mins

7.12

***Mandatory Programming Exercise- 5 very-easy problems***

60 mins

Regex, Multiprocessing & Multi threading(Optional)
Chapters : 2 Assignments : 0 Completed :

Regex-- Code Walkthrough & Problem solving

8.1

Introduction to Regular Expressions

14 mins

8.2

Problem 1 : Masking Email

13 mins

8.3

Problem 2: Valid Email or not

18 mins

8.4

Problem 3: Mask Phone numbers

8 mins

8.5

Problem 4: Extract data from PDF invoice

30 mins

8.6

Problem 5: Check if valid integer or float

26 mins

8.7

Problem 6: Regex Matching using Recursion and Dynamic Programming

47 mins

Multiprocessing & Multithreading

9.1

Applied Introduction and Overview

17 mins

9.2

Multiprocessing: Compute the mean of 100 Million numbers

23 mins

9.3

Multi-threading with Code

21 mins

9.4

Joblib: Simplified Parallel Programming in Python

19 mins

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

Why study DS and Algorithms?

10.1

Why study DS and Algorithms?

20 mins

Sorting & Searching : why bother with these simple tasks?

11.1

Sorting & Searching : why bother with these simple tasks?

17 mins

Insertion sort

12.1

Satellite data and key

11 mins

12.2

How it works: Card-sorting

20 mins

12.3

Pseudo code

18 mins

12.4

Correctness.

6 mins

12.5

In-place sorting

8 mins

12.6

Stable sort.

15 mins

12.7

Online sorting.

10 mins

12.8

Insertion sort Python Code

1 mins

Analyzing an algorithm

13.1

Model of computation

17 mins

13.2

Space and time analysis of Insertion Sort-1

7 mins

13.3

Space and time analysis of Insertion Sort-2

22 mins

Big O, Theta, Omega notation.

14.1

Insertion sort: Big O-notation

15 mins

14.2

Notations: Big O

15 mins

14.3

Notations: Big Omega, Theta

9 mins

14.4

Notations: Small O, Omega, Theta

24 mins

14.5

Relationships between various notations.

21 mins

14.6

Order of common functions & real world applications.

26 mins

14.7

Why does asymptotic analysis matter in the real world?

16 mins

14.8

Solved Problem: Polynomials

18 mins

14.9

Solved Problem: n>n0 case

5 mins

14.10

Solved Problem: GATE 2001

6 mins

14.11

Solved Problem: GATE 2011

10 mins

14.12

Solved Problem: GATE 2003, Inversions

12 mins

14.13

Solved Problem: GATE 2003

9 mins

14.14

Solved Problem: GATE 2008

5 mins

14.15

GATE 2013

6 mins

14.16

GATE 2006

7 mins

Practice Test-1 Insertion Sort & Asymptotics Notations

15.1

Solutions for Practice Test-1

66 mins

Practice Test-1 Insertion sort and Asymptotic Notations

Merge Sort

16.1

Why learn another sorting algorithm?

6 mins

16.2

How it works: Intuition

17 mins

16.3

Pseudo Code

19 mins

16.4

Merge Sort Python Code

1 mins

16.5

Analyzing time & space complexity

21 mins

16.6

Recursion tree method: intuition

13 mins

16.7

External Merge-Sort

25 mins

16.8

Solved Problem GATE 2007

5 mins

16.9

Solved Problem

4 mins

16.10

Solved Problem GATE 2015

5 mins

Practice Test 2 Ordering of Growth Functions & Merge Sort

17.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

18.1

Recursion tree method

15 mins

18.2

Master theorem

21 mins

18.3

Extended Master Theorem

9 mins

18.4

Inadmissible cases & Shortcuts

6 mins

18.5

Substitution method.

15 mins

Recursion in programming

19.1

Factorial: Time and Space complexity

21 mins

19.2

Recursion vs iteration

7 mins

19.3

Tail recursion/Tail-Call Optimization

14 mins

Solved Problems of Solving Recurrences & Recursion in programming

20.1

GATE 2011

4 mins

20.2

Fibonacci: Time Complexity

7 mins

20.3

GATE 2007

6 mins

20.4

GATE 2006

7 mins

20.5

Shortcut + GATE 2004

6 mins

20.6

GATE 2009

3 mins

20.7

GATE 2008

4 mins

20.8

GATE 2005

4 mins

20.9

GATE 2003

8 mins

20.10

GATE 2016

8 mins

20.11

GATE 2016

7 mins

Bubble Sort

21.1

How it works: intuition + code

22 mins

21.2

Space and time complexity

9 mins

21.3

Bubble Sort Python code

1 mins

21.4

Why bubble sort should be avoided?

5 mins

21.5

Solved Problem GATE 2000

8 mins

21.6

Solved Problem GATE 1995

3 mins

Quick sort

22.1

Why do we need another sorting algorithm?

5 mins

22.2

How it works: intuition

12 mins

22.3

Partitioning

15 mins

22.4

Quick sort by recursion

9 mins

22.5

Time complexity: Best and Worst cases.

16 mins

22.6

Quick Sort Python Code

1 mins

22.7

Randomized quicksort and amortized analysis

8 mins

22.8

Solved Problem GATE 2016

3 mins

22.9

Solved Problem GATE 2009

3 mins

22.10

Solved Problem GATE 2001

4 mins

22.11

Solved Problem GATE 2008

2 mins

22.12

Solved Problem GATE 2015

2 mins

22.13

Solved Problem GATE 2014

3 mins

22.14

Solved Problem GATE 2019

3 mins

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

23.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

24.1

How it works: intuition + code

11 mins

24.2

Selection Sort Python Code

1 mins

24.3

Space and time complexity.

7 mins

24.4

When to use Selection sort?

4 mins

24.5

Solved Problem GATE 2013, 2009

1 mins

24.6

Solved Problem GATE 2007

1 mins

24.7

Solved Problem GATE 2016

1 mins

24.8

Sample Question

3 mins

Linear time sorting

25.1

Lower bounds on worst case of comparison sorting

33 mins

25.2

Counting sort: intuition + code

19 mins

25.3

Counting sort Python code

1 mins

25.4

Space and time complexity

4 mins

25.5

Radix Sort

6 mins

25.6

Radix sort Python Code

1 mins

25.7

Where to use which sorting algorithm?

8 mins

25.8

Solved Problem GATE 2008

6 mins

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

26.1

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

70 mins

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

27.1

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

79 mins

Practice Test-4 Introduction to Algorithms- Linear time sorting

28.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

29.1

What are Data Structures?

12 mins

29.2

Where do arrays fail?

12 mins

Singly Linked List

30.1

Structure & memory organization

19 mins

30.2

Code for node

4 mins

30.3

Code for Node (Python)

1 mins

30.4

Insertion

19 mins

30.5

Insertion (Python code)

1 mins

30.6

Delete

13 mins

30.7

Delete (Python Code)

1 mins

30.8

Traversal & Search

9 mins

30.9

Traversal & Search (Python code)

1 mins

30.10

Drawbacks

10 mins

30.11

Solved Problem GATE 2002

2 mins

30.12

Solved Problem GATE 2010

6 mins

Doubly Linked List

31.1

Motivation for DLL

9 mins

31.2

Structure & memory organization

6 mins

31.3

Code for Node (Python)

1 mins

31.4

Insert

13 mins

31.5

Insertion (Python code)

1 mins

31.6

Delete

10 mins

31.7

Delete (Python Code)

1 mins

31.8

Drawbacks

2 mins

Circular Linked List

32.1

Motivation

4 mins

32.2

Singly and Doubly Linked Circular Lists

6 mins

32.3

Code

2 mins

32.4

Insertion (Python code)

1 mins

32.5

Delete (Python Code)

1 mins

32.6

Solved Problem GATE 2016

7 mins

Interactive Problem Solving DS & Algo-1

33.1

Interactive Problem Solving DS & Algo-1

58 mins

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

Stacks

34.1

Motivation: Why we need them?

12 mins

34.2

Operations: Push and Pop

5 mins

34.3

How to implement a stack?

16 mins

34.4

Stack Implementation [Python]

1 mins

34.5

Application: Parenthesis check

20 mins

34.6

Parenthesis Check [Python Code]

1 mins

Expression evaluation

35.1

Infix, Prefix and Postfix

16 mins

35.2

Infix to Postfix

20 mins

35.3

Infix to postfix [Python Code]

1 mins

35.4

Infix to Prefix

7 mins

35.5

Evaluation of postfix

7 mins

35.6

Evaluation of Postfix [Python code]

1 mins

35.7

Evaluation of prefix

4 mins

More Applications: Call Stack

36.1

More Applications: Call Stack

18 mins

Space complexity of Quicksort using Call-stack

37.1

Worst case

15 mins

37.2

Sedgewick’s solution

22 mins

Solved Problems of Stacks

38.1

GATE 2004-1

1 mins

38.2

GATE 2004-2

5 mins

38.3

GATE 2007

4 mins

38.4

GATE 1997

2 mins

38.5

GATE 2005

3 mins

38.6

GATE 1991

1 mins

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

39.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

40.1

Motivation: Why we need them?

8 mins

40.2

Operations: Enqueue and Dequeue

5 mins

40.3

How to implement them?

12 mins

40.4

Linear and Circular Queue implementations.

5 mins

40.5

Queue : Linked list Implementation (Python Code)

1 mins

40.6

Circular Queue : Linked List Implementation (python code)

1 mins

40.7

Solved Problem GATE 2018

4 mins

40.8

Solved Problem GATE 2004

4 mins

40.9

Solved Problem GATE 2016

11 mins

40.10

Solved Problem GATE 2013

4 mins

40.11

Solved Problem GATE 2016-2

2 mins

40.12

Solved Problem GATE 2012

5 mins

40.13

Solved Problem GATE 1996

2 mins

40.14

Solved Problem GATE 2007

6 mins

40.15

Solved Problem GATE 2014

7 mins

Arrays as a data-structure

41.1

One-dimensional array

17 mins

41.2

Multi-dimensional array

31 mins

Special types of 2D arrays

42.1

Symmetric matrix

12 mins

42.2

Lower triangular matrix & Diagonal matrix

8 mins

42.3

Tridiagonal matrix, Z-matrix, Toeplitz Matrix

7 mins

Dynamic arrays & Amortized time

43.1

Dynamic arrays & Amortized time

20 mins

Array vs Linked Lists

44.1

Array vs Linked Lists

3 mins

Solved Problems

45.1

GATE 2000

4 mins

45.2

GATE 2000-2

5 mins

45.3

GATE 2004

3 mins

45.4

GATE 2005

4 mins

45.5

GATE 1994

4 mins

45.6

GATE 1998

5 mins

45.7

Gate 2004

5 mins

45.8

GATE 2015

5 mins

45.9

GATE 2002

3 mins

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

46.1

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

80 mins

Practice Test-6 Queues and Arrays

47.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

48.1

Linear Search: intuition and code

10 mins

Binary Search

49.1

Intuition

19 mins

49.2

Pseudo code

9 mins

Binary Search Tree: intuition & terminology

50.1

Binary Search Tree: intuition & terminology

22 mins

Implementation using Pointers/References

51.1

Implementation using Pointers/References

6 mins

Implementation using Arrays

52.1

Implementation using Arrays

13 mins

Operations

53.1

Build a BST

18 mins

53.2

Build Binary Search Tree [python code]

1 mins

53.3

Operations: Search, Insert, Min and Max

22 mins

53.4

Operations: Search, Min, max [Python Code]

1 mins

53.5

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

17 mins

53.6

Preorder Traversal: Recursive and Iterative [Python code]

1 mins

53.7

Inorder Iterative Approach [Python code]

1 mins

53.8

Post Order Traversal : Recursive Approach [Python Code]

1 mins

53.9

Post Order Traversal: Iterative Apparoch using 2 stacks [Python code]

1 mins

53.10

Post Order Traversal: Iterative Approach using one stack [Python code]

1 mins

53.11

Operations: Delete

12 mins

53.12

Binary Search Tree: Deletion [python Code]

1 mins

Randomized BST

54.1

Randomized BST

10 mins

Solved Problems

55.1

GATE 2003

6 mins

55.2

GATE 2018

10 mins

55.3

GATE 2017

6 mins

55.4

GATE 2017

8 mins

55.5

GATE 2003

5 mins

55.6

GATE 2003

2 mins

55.7

GATE 2013

2 mins

55.8

GATE 2015

2 mins

55.9

GATE 2011

4 mins

55.10

GATE 1994

2 mins

55.11

GATE 2014

4 mins

Trees

56.1

Logical structure & implementation

12 mins

56.2

Terminology & Traversals

18 mins

56.3

Types of Binary Trees

14 mins

56.4

Properties of a Tree: Depth, Nodes, Leafs

12 mins

56.5

Counter Total nodes and Leaf nodes [Python code]

1 mins

56.6

Maximum Depth of Binary Tree [Python code]

1 mins

56.7

Application: Backtracking for Sudoku( optional)

35 mins

56.8

Application: Backtracking for Eight Queens(optional)

16 mins

56.9

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

10 mins

Solved Problems

57.1

GATE 2004

8 mins

57.2

GATE 2010

4 mins

57.3

GATE 2017

5 mins

57.4

GATE 2013

4 mins

57.5

GATE 2006

6 mins

57.6

GATE 2006

5 mins

Application: Expression Evaluation

58.1

Postfix to Expression Tree

13 mins

58.2

Evaluating an expression Tree

10 mins

58.3

Evaluating Expression Tree [Python code]

1 mins

Heap Sort

59.1

Heap: What and Why?

14 mins

59.2

Heapify

15 mins

59.3

Build a Heap

9 mins

59.4

Time Complexity of build_max_heap

19 mins

59.5

Build Max Heap [Python code]

1 mins

59.6

Heap Sort

12 mins

59.7

Time and Space complexity of HeapSort

5 mins

59.8

Heap Sort [Python code]

1 mins

59.9

Priority queues: Application of Heaps

13 mins

59.10

Comparison of all sorting methods (time and space complexity)

6 mins

59.11

Solved Problem GATE 2006

2 mins

59.12

Solved Problem GATE 2005

5 mins

59.13

Solved Problem GATE 2003

4 mins

59.14

Solved Problem GATE 2018

4 mins

59.15

Solved Problem GATE 2016

3 mins

59.16

Solved Problem GATE 2004-1

2 mins

59.17

Solved Problem GATE 2004-2

3 mins

59.18

Solved Problem GATE 2014

2 mins

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

60.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

61.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

62.1

AVL Trees: What and Why?

21 mins

62.2

Height of an AVL Tree & Searching

18 mins

Balancing a Tree using Rotations.

63.1

Single rotation: LL, RR

23 mins

Double rotation

64.1

RL Rotation

15 mins

64.2

LR Rotation

9 mins

Insertion with example

65.1

Insertion with example

41 mins

65.2

AVL Tree: Insertion [Python code]

1 mins

Delete

66.1

Delete

16 mins

66.2

AVL Tree: Delete (Python)

1 mins

Solved Problems

67.1

GATE 2009

3 mins

67.2

GATE 2008

2 mins

67.3

Sample Question

5 mins

Hash-Tables

68.1

Hash-Tables: What and Why?

8 mins

68.2

Direct access table

10 mins

68.3

Hash Functions and collisions

8 mins

68.4

Chaining & load factor

16 mins

Hash functions

69.1

Division method (Modulo Hash function)

12 mins

69.2

Multiplication method

11 mins

Collision Resolution

70.1

Open Addressing (Closed Hashing)

13 mins

70.2

Linear probing

9 mins

70.3

Double Hashing

4 mins

70.4

Quadratic Probing

4 mins

Applications

71.1

Sparse Matrix representation.

12 mins

71.2

Super Fast Search

7 mins

Solved Problems

72.1

GATE 2004

2 mins

72.2

GATE 2014

5 mins

72.3

GATE 2015

8 mins

72.4

GATE 2006

2 mins

72.5

GATE 2015

2 mins

72.6

GATE 2007

3 mins

72.7

Sample Question-8

6 mins

Practice test 8 Balanced Trees( AVL Trees), Hashing

73.1

Problem 1

7 mins

73.2

Problem 2

4 mins

73.3

Problem 3

4 mins

73.4

Problem 4

9 mins

73.5

Problem 5

5 mins

73.6

Problem 6

8 mins

73.7

Problem 7

1 mins

73.8

Problem 8

1 mins

73.9

Problem 9

2 mins

73.10

Problem 10

4 mins

73.11

Problem 11

6 mins

73.12

Problem 12

4 mins

73.13

Problem 13

5 mins

73.14

Problem 14

6 mins

73.15

Problem 15

3 mins

Practice Test-8 Balanced Trees : AVL Trees , Hashing

Interactive Problem Solving DS & Algo-2

74.1

Interactive Problem Solving DS & Algo-2

66 mins

Graphs
Chapters : 5 Assignments : 1 Completed :

Graphs-I

75.1

Graphs: Why, What and Basics

32 mins

75.2

Representation of Graphs: Adjacency Matrix

13 mins

75.3

Representation Graph: Adjacency Matrix [Python code]

1 mins

75.4

Representation of Graphs: Adjacency Lists

12 mins

75.5

Representation Graph: Adjacency List [Python code]

1 mins

75.6

Connectivity in undirected Graphs

19 mins

75.7

Connectivity in Directed Graphs

15 mins

75.8

Breadth First Search: Intuition and example

19 mins

75.9

BFS: Color coding intuition

7 mins

75.10

BFS: Code and Complexity

15 mins

75.11

BFS: Applications

10 mins

75.12

BFS [Python code]

1 mins

75.13

Depth First Search: Intuition and code

36 mins

75.14

DFS: Analysis

5 mins

75.15

DFS: Edge types

11 mins

75.16

DFS [Python Code]

1 mins

75.17

Application of DFS: Detect cycles in a di-graph

9 mins

75.18

Application: Strongly connected components

26 mins

75.19

Application of DFS: Topological Sort

19 mins

75.20

Solved Problems GATE 2003

5 mins

75.21