Home Courses Interview Preparation Course

Interview Preparation Course

Category: INTERVIEW PREPARATION COURSE

Interview Preparation Course

Category: INTERVIEW PREPARATION COURSE

Instructor

Applied Roots

Python Programming
Chapters : 6 Assignments : 0 Completed :

Python Introduction

1.1

Python, Anaconda and relevant packages installations

23 mins

1.2

Why Learn Python

4 mins

1.3

Keywords and identifiers

6 mins

1.4

comments, indentation and statements

9 mins

1.5

Variables and data types in Python

32 mins

1.6

Standard Input and Output

7 mins

1.7

Operators

14 mins

1.8

Control flow: if else

10 mins

1.9

Control flow: while loop

16 mins

1.10

Control flow: for loop

15 mins

1.11

Control flow: break and continue

10 mins

Python 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

Functions

3.1

Introduction

13 mins

3.2

Types of functions

25 mins

3.3

Function arguments

10 mins

3.4

Recursive functions

16 mins

3.5

Lambda functions

8 mins

3.6

Modules

7 mins

3.7

Packages

6 mins

3.8

File Handling

23 mins

3.9

Exception Handling

15 mins

3.10

Debugging Python

15 mins

Python live sessions

4.1

Code Walkthrough: Basic programming & bug-fixing in Python

30 mins

4.2

Code Walkthrough: Numerical algorithms using Python

4.3

Code Walkthrough: Numerical methods in Python - II

4.4

Code Walkthrough: Problems in Python [ Strings and Regex ]

4.5

Code Walkthrough: Problems in Python [ Strings and Regex -II]

4.6

Code Walkthrough: Dynamic Programming & Python in-built data-structures

Python Object Oriented Programming

5.1

Object Oriented Programming Part 1

120 mins

5.2

Object Oriented Programming Part 2

120 mins

How to Use Github?

6.1

How to Use Github?

90 mins

Module 1: C-Programming (Optional)
Chapters : 16 Assignments : 0 Completed :

Introduction

7.1

C: What, Why and How?

22 mins

7.2

Simplified model of a computer

19 mins

7.3

Tools for Coding

10 mins

Basics with example

8.1

Input and Output

32 mins

8.2

Choosing one option vs another

21 mins

8.3

Repeating over and over

24 mins

8.4

Reuse and Simplify

18 mins

Let's dive in

9.1

Character Set in C

15 mins

9.2

Keywords and Identifiers

13 mins

9.3

Data Types

29 mins

9.4

Variables

14 mins

9.5

Constants

25 mins

9.6

Input and Output

30 mins

9.7

Formatting input and output

30 mins

Operators and Expressions

10.1

Integer Arithmetic Operations

10 mins

10.2

Floating Point Arithmetic operations

7 mins

10.3

Assignment Operators

10 mins

10.4

Increment & Decrement Operators

8 mins

10.5

Solved Problem

4 mins

10.6

Relational Operators

8 mins

10.7

Logical or Boolean operators

8 mins

10.8

Comma operator

6 mins

10.9

Conditional (ternary) operator

7 mins

10.10

Solved Problem

4 mins

10.11

Sizeof operator

4 mins

10.12

Operator Precedence

29 mins

10.13

Type conversion

16 mins

10.14

Bitwise operators

19 mins

Operators and Expressions Practice Test

Bank PO Mock Test 2

operators and expressions (practice Test)

Bank PO Mock Test 2

Control statements

13.1

If else

23 mins

13.2

While-loop

25 mins

13.3

Do-while

7 mins

13.4

For loop

36 mins

13.5

Nested and Infinite loops

14 mins

13.6

Break & Continue

23 mins

13.7

goto

11 mins

13.8

switch-case

12 mins

13.9

Sample Problem 1

11 mins

13.10

Solved Problem 2

6 mins

13.11

Solved Problem 3

5 mins

13.12

Solved Problem 4

9 mins

13.13

Solved Problem 5

2 mins

13.14

Solved Problem 6

5 mins

13.15

Solved Problem 7

7 mins

Functions

14.1

Introduction to functions

38 mins

14.2

Let’s dive in: more details

33 mins

14.3

Local, Global and static variables

14 mins

14.4

Recursion: the basics

34 mins

14.5

Recursion: Towers of Hanoi.

36 mins

14.6

Storage classes: auto, extern, static, register,

40 mins

14.7

Solved Problems:

29 mins

Control statements, Functions - Practice Test

MOCK GT-01

Pointers

16.1

Introduction

27 mins

16.2

Dereferencing a pointer variable

20 mins

16.3

Let’s dive into pointers

33 mins

16.4

Pointers and One dimensional arrays

30 mins

16.5

Pointers and Two dimensional arrays

33 mins

16.6

Pointers and Functions

32 mins

16.7

Array of pointers & Void Pointers (Pointer array)

21 mins

16.8

Dynamic memory allocation functions

36 mins

Strings

17.1

Introduction to Strings in C

24 mins

17.2

String Library Functions

39 mins

17.3

Pointers, Arrays and Strings

24 mins

17.4

Pointers to arrays (1D,2D,3D); Double/Triple pointers

48 mins

Pointers, Strings - Practice Test

Mock GT-02

Structure and Union

19.1

Introduction to Structures

31 mins

19.2

Let’s dive into Structures

31 mins

19.3

Unions

20 mins

Files

20.1

Introduction to files

33 mins

20.2

File Input/Output

32 mins

Structures, Unions, and Files - Practice Test

Mock GT-03

Miscellanious Concepts

22.1

Static And Dynamic Scoping

18 mins

22.2

Function Pointers

24 mins

22.3

Enum

10 mins

Module 2: Searching, Sorting and Analysis
Chapters : 17 Assignments : 0 Completed :

Sorting & Searching : why bother with these simple tasks?

23.1

Sorting & Searching : why bother with these simple tasks?

17 mins

Insertion Sort

24.1

Satellite data and key

11 mins

24.2

How it works: Card-sorting

20 mins

24.3

Pseudo code

24 mins

24.4

Insertion sort Python Code

7 mins

24.5

Correctness

6 mins

24.6

In-place sorting

8 mins

24.7

Stable sort

15 mins

24.8

Online sorting

10 mins

Analyzing an algorithm.

25.1

Model of computation

17 mins

25.2

Space and time analysis of Insertion Sort-1

7 mins

25.3

Space and time analysis of Insertion Sort-2

22 mins

Big O, Theta, Omega notation

26.1

Insertion sort: Big O-notation

15 mins

26.2

Notations: Big O

15 mins

26.3

Notations: Big Omega, Theta

9 mins

26.4

Notations: Small O, Omega, Theta

24 mins

26.5

Relationships between various notations

21 mins

26.6

Order of common functions & real world applications.

26 mins

26.7

Why does asymptotic analysis matter in the real world?

16 mins

Solved Problems: Big O, Theta, Omega notation.

27.1

Solved Problem: Polynomials

18 mins

27.2

Solved Problem: n>n0 case

5 mins

27.3

Solved Problem:1

6 mins

27.4

Solved Problem2

10 mins

27.5

Solved Problem 3

12 mins

27.6

Solved Problem 4

9 mins

27.7

Solved Problem 5

5 mins

27.8

Solved Problem 6

5 mins

27.9

Solved Problem 7

6 mins

Asymptotic Notations and Insertion sort : Practice Test

Insertion Sort and Asymptotic Notations

Merge Sort

29.1

Why learn another sorting algorithm?

6 mins

29.2

How it works: Intuition

17 mins

29.3

Pseudo Code

19 mins

29.4

Merge Sort Python Code

13 mins

29.5

Merge sort: Analysing time & space complexity

21 mins

29.6

Recursion tree method: intuition

13 mins

29.7

External Merge-Sort

25 mins

Solved Problems of Merge sort

30.1

Solved Problem 1

5 mins

30.2

Solved problem 2

4 mins

30.3

Solved Problem 3

5 mins

Ordering of Growth Functions and Merge Sort - Practice Test

IBPS OFFICE ASSISTANT – GT-1

Bubble Sort

32.1

How it works: intuition + code

22 mins

32.2

Bubble Sort Python code

7 mins

32.3

Space and time complexity

9 mins

32.4

When to use Bubble sort?

5 mins

Quick Sort

33.1

Why do we need another sorting algorithm?

5 mins

33.2

How it works: intuition

13 mins

33.3

Partitioning

15 mins

33.4

Quick sort by recursion

10 mins

33.5

Time complexity: Best and Worst cases.

16 mins

33.6

Quick Sort Python Code

12 mins

33.7

Randomized quicksort and amortized analysis

8 mins

Sample Questions on Quicksort

34.1

Solved Problem 1

3 mins

34.2

Solved Problem 2

3 mins

34.3

Solved Problem 3

4 mins

34.4

Solved Problem 4

2 mins

34.5

Solved Problem 5

2 mins

34.6

Solved Problem 6

3 mins

34.7

Solved Problem 7

3 mins

Selection Sort

35.1

How it works: intuition + code

11 mins

35.2

Selection Sort Python Code

7 mins

35.3

Space and time complexity.

7 mins

35.4

When to use Selection sort?

4 mins

Solved Problems of Selection sort

36.1

Sample Problem 1

1 mins

36.2

Sample Problem 2

1 mins

36.3

Sample Problem 3

1 mins

36.4

Sample Problem 4

1 mins

Linear Time Sorting

37.1

Lower bounds on worst case of comparison sorting

30 mins

37.2

Counting sort: intuition + code

19 mins

37.3

Counting sort Python code

14 mins

37.4

Counting sort Python code

15 mins

37.5

Space and time complexity

4 mins

37.6

Radix Sort

6 mins

37.7

Radix sort Python Code

15 mins

37.8

Where to use which sorting algorithm?

8 mins

Solved Problems of Linear time sorting

38.1

Solved Problem 1

6 mins

Linear Time Sorting Algorithms - Practice Test

IBPS RRB SCALE-1 MAINS GT-02

Module3: Data structures
Chapters : 38 Assignments : 0 Completed :

Data Structures: Introduction

40.1

What are Data Structures?

12 mins

40.2

Where do arrays fail?

12 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

43.2

Where do arrays fail?

12 mins

Solved Problems

44.1

Solved Problem 1

4 mins

44.2

Solved Problem 2

5 mins

44.3

Solved Problem 3

3 mins

44.4

Solved Problem 4

4 mins

44.5

Solved Problem 5

4 mins

44.6

Solved Problem 6

5 mins

44.7

Solved Problem 7

5 mins

44.8

Solved Problem 8

5 mins

44.9

Solved Problem 9

3 mins

Singly Linked List

45.1

Structure & memory organization

19 mins

45.2

Code for node: (C Code)

4 mins

45.3

Code for Node (Python)

4 mins

45.4

Insertion: (C code)

19 mins

45.5

Insertion (Python code)

18 mins

45.6

Delete: (C - Code)

13 mins

45.7

Delete (Python Code)

9 mins

45.8

Traversal & Search

9 mins

45.9

Traversal & Search (Python code)

8 mins

45.10

Drawbacks

10 mins

Solved Problems of Singly Linked List

46.1

Solved Problem 1

2 mins

46.2

Solved Problem 2

5 mins

Doubly Linked List

47.1

Introduction to Doubly Linked List

9 mins

47.2

Structure & memory organization

6 mins

47.3

Code for Node (Python)

3 mins

47.4

Insert

13 mins

47.5

Insertion (Python code)

13 mins

47.6

Delete

10 mins

47.7

Delete (Python Code)

13 mins

47.8

Drawbacks

2 mins

Circular Linked List

48.1

Introduction to Circular Linked lists

4 mins

48.2

Circular Singly and Doubly Linked Lists

6 mins

48.3

Circular Linked List: C-Code

2 mins

48.4

Insertion (Python code)

14 mins

48.5

Delete (Python Code)

9 mins

Solved Problems of Circular Linked List

49.1

Solved Problem 1

6 mins

Arrays vs Linked Lists

50.1

Array vs Linked Lists

3 mins

Stacks

51.1

Introduction to Stacks

12 mins

51.2

Stack Operations: Push and Pop

5 mins

51.3

How to implement a stack?

16 mins

51.4

Stack Implementation [Python]

11 mins

51.5

Application: Parenthesis check

20 mins

51.6

Parenthesis Check [Python Code]

10 mins

Expression Evaluation

52.1

Infix, Prefix and Postfix

16 mins

52.2

Infix to Postfix

20 mins

52.3

Infix to postfix [Python Code]

21 mins

52.4

Infix to Prefix

7 mins

52.5

Evaluation of postfix

7 mins

52.6

Evaluation of Postfix [Python code]

11 mins

52.7

Evaluation of prefix

4 mins

Solved Problems of Stacks

53.1

Solved Problem 1

1 mins

53.2

Solved Problem 2

5 mins

53.3

Solved Problem 3

4 mins

53.4

Solved Problem 4

2 mins

53.5

Solved Problem 5

3 mins

53.6

Solved Problem 6

1 mins

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

IBPS RRB OFFICE ASSISTANT MAINS GT-01

Queues

55.1

Motivation: Why we need them?

8 mins

55.2

Operations: Enqueue and Dequeue

5 mins

55.3

How to implement them?

12 mins

55.4

Linear and Circular Queue implementations.

5 mins

55.5

test

30 mins

55.6

Queue : Linked list Implementation (Python Code)

12 mins

55.7

Circular Queue : Linked List Implementation (python code)

14 mins

Solved Questions of Queues

56.1

Solved Problem 1

5 mins

56.2

Solved Problem 2

4 mins

56.3

Solved Problem 3

10 mins

56.4

Solved Problem 4

4 mins

56.5

Solved Problem 5

2 mins

56.6

Solved Problem 6

4 mins

56.7

Solved Problem 7

2 mins

56.8

Solved Problem 8

7 mins

56.9

Solved Problem 9

7 mins

Practice Test - Queue,Arrays

IBPS CLERK MAINS -02

Binary Search Trees

58.1

Binary Search Tree: intuition & terminology

22 mins

58.2

Implementation using Pointers/References

6 mins

58.3

Implementation using Arrays

13 mins

58.4

Build a Binary search tree

18 mins

58.5

Build Binary Search Tree [python code]

12 mins

58.6

Operations: Search, Insert, Min and Max

22 mins

58.7

Operations: Search, Min, max [Python Code]

12 mins

58.8

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

17 mins

58.9

Preorder Traversal: Recursive and Iterative [Python code]

13 mins

58.10

Inorder Iterative Approach [Python code]

11 mins

58.11

Post Order Traversal : Recursive Approach [Python Code]

5 mins

58.12

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

14 mins

58.13

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

18 mins

58.14

Operations: Delete

12 mins

58.15

Binary Search Tree: Deletion [python Code]

23 mins

58.16

Randomized BST

10 mins

Solved Problems On Binary Search Tree

59.1

Solved Problem 1

6 mins

59.2

Solved Problem 2

10 mins

59.3

Solved Problem 3

6 mins

59.4

Solved Problem 4

8 mins

59.5

Solved Problem 5

5 mins

59.6

Solved Problem 6

2 mins

59.7

Solved Problem 7

2 mins

59.8

Solved Problem 8

2 mins

59.9

Solved Problem 9

4 mins

59.10

Solved Problem 10

2 mins

59.11

Solved Problem 11

4 mins

Trees

60.1

Logical structure & implementation

12 mins

60.2

Terminology & Traversals

18 mins

60.3

Types of Binary Trees

14 mins

60.4

Properties of a Tree: Depth, Nodes, Leafs

12 mins

60.5

Counter Total nodes and Leaf nodes [Python code]

10 mins

60.6

Maximum Depth of Binary Tree [Python code]

13 mins

60.7

Application: Backtracking for Sudoku

35 mins

60.8

Application: Backtracking for Eight Queens

16 mins

60.9

Applications of Trees: Hierarchical information, Websites (DOM)

10 mins

Applications: Expression Evaluation

61.1

Postfix to Expression Tree

13 mins

61.2

Evaluating an expression Tree

10 mins

61.3

Evaluating Expression Tree [Python code]

9 mins

Solved Problems On Trees

62.1

Solved Problem 1

8 mins

62.2

Solved Problem 2

4 mins

62.3

Solved Problem 3

5 mins

62.4

Solved Problem 4

4 mins

62.5

Solved Problem 5

6 mins

62.6

Solved Problem 6

5 mins

Heap Sort

63.1

Heap: What and Why?

14 mins

63.2

Heapify

15 mins

63.3

Build a Heap

9 mins

63.4

Time Complexity of build_max_heap

19 mins

63.5

Build Max Heap [Python code]

16 mins

63.6

Heap Sort

12 mins

63.7

Time and Space complexity of HeapSort

5 mins

63.8

Heap Sort [Python code]

6 mins

63.9

Priority queues: Application of Heaps

13 mins

63.10

Comparison of all sorting methods (time and space complexity)

6 mins

Sample Questions On Heap

64.1

Sample Questions 1

2 mins

64.2

Sample Questions 2

5 mins

64.3

Sample Questions 3

3 mins

64.4

Sample Questions 4

4 mins

64.5

Sample Questions 5

3 mins

64.6

Sample Questions 6

2 mins

64.7

Sample Questions 7

3 mins

64.8

Sample Questions 8

2 mins

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

RRB NTPC GT-01

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

66.1

Solutions for Practice Test-7

60 mins

Balanced Trees: AVL Trees

67.1

AVL Trees: What and Why?

21 mins

67.2

Height of an AVL Tree & Searching

18 mins

67.3

Balancing Tree using Rotations: Single Rotation LL, RR

23 mins

67.4

Double Rotation: RL rotation

15 mins

67.5

Double Rotation: LR Rotation

9 mins

67.6

Insertion with example

41 mins

67.7

AVL Tree: Insertion [Python code]

35 mins

67.8

AVL Tree: Delete

16 mins

67.9

AVL Tree: Delete (Python)

21 mins

Solved Problems on AVL Tree

68.1

Solved Problem 1

3 mins

68.2

Solved Problem 2

2 mins

68.3

Solved Problem 3

5 mins

Hashing

69.1

Hash-Tables: What and Why?

8 mins

69.2

Direct access table

10 mins

69.3

Hash Functions and collisions

8 mins

69.4

Chaining & load factor

16 mins

69.5

Hash Function: Division method (Modulo Hash function)

12 mins

69.6

Multiplication method

11 mins

69.7

Collision Resolution: Open Addressing (Closed Hashing)

13 mins

69.8

Collision Resolution: Linear probing

9 mins

69.9

Collision Resolution: Double Hashing

4 mins

69.10

Collision Resolution: Quadratic Probing

4 mins

69.11

Applications: Sparse Matrix representation.

12 mins

69.12

Applications: Super Fast Search

7 mins

Solved Problems On Hashing

70.1

Solved Problem 1

2 mins

70.2

Solved Problem 2

5 mins

70.3

Solved Problem 3

8 mins

70.4

Solved Problem 4

2 mins

70.5

Solved Problem 5

2 mins

70.6

Solved Problem 6

3 mins

70.7

Solved Problem 7

6 mins

Practice Test - Balanced Trees : AVL Trees , Hashing

71.1

problem 1

7 mins

71.2

Problem 2

4 mins

71.3

Problem 3

4 mins

71.4

Problem 4

9 mins

71.5

Problem 5

5 mins

71.6

Problem 6

8 mins

71.7

Problem 7

1 mins

71.8

Problem 8

1 mins

71.9

Problem 9

2 mins

71.10

Problem 10

4 mins

71.11

Problem 11

6 mins

71.12

Problem 12

4 mins

71.13

Problem 13

5 mins

71.14

Problem 14

6 mins

71.15

Problem 15

3 mins

RRB NPTC GT-02

Graphs-I

72.1

Graphs: Why, What and Basics

32 mins

72.2

Representation of Graphs: Adjacency Matrix

13 mins

72.3

Represenation Graph: Adjacency Matrix [Python code]

11 mins

72.4

Representation of Graphs: Adjacency Lists

12 mins