(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

This course is the combition of all the chapter which is rarely asked in the gate exam. The first one is Dynammic programming , second is sorting ( Bubble , Insertion and Selection ) , Graph traversal ( BFS and BFS ) and Tree traversal ( Inorder , preorder and postoeder).

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Dynamic Programming , Sorting , Graph traversal , and Tree Traversal: GATE

Divide and Conquer

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This course is all about Dynamic programming , Sorting , Tree traversal amd graph traversal . It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Course Overview

Breadth first search is general techniques for traversing a graph. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Breadth First Search

Depth first search is general techniques for traversing a graph. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Depth First Search

Bubble sort is one of the sorting algorithm in which one value is exchanged on each pass through the array. We cover the algorithm , code of bubble sort , examples and previous question asked in gate.

Bubble Sort

Insertion sort is an in-place comparison based algorithm. Here , a sublist is maintained which is always sorted. We cover the algorithm , code of bubble sort , examples and previous question asked in gate. We cover the algorithm , code of insertion sort , examples and previous question asked in gate.

Insertion Sort

Selection sort is a simle sorting algorithm. This sorting algorithm is an in-place comparison based algorithm in which list is divided into two parts, the sorted at the left and unsorted at the right. We cover the algorithm , code of selection sort , examples and previous question asked in gate.

Selection Sort

Dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems. In this lessons , we have seen matric chain problem in detail. We cover the algorithm , code of matrix chain algo, examples and previous question asked in gate. We have also seen the comparsion in dp vs greedy method and dp vs brute force.

Dynamic programming - Part I

In this lesson we discove our second important algorithm i.e. longest common subsequence. It is a subsequence . Given two sequence of integer , and find the longest common subsequence and print it as a line of space seperated integers. We cover the algorithm , code of LCS, examples and previous question asked in gate.

Dynamic Programming - Part II

In this lesson we have discover our last inportant algo i.e fibonacci numbers . Fibonacci number is a series of number in which each number is the sum of two preceding numbers. We cover the algorithm , code of fibonacci number, examples and previous question asked in gate.

Dynamic Programming -III

Heres our last lesson i.e tree traversal. Tree traversal is a form of graph traversal and the process of visiting each node in a tree data structure.There are four types of tree raversal i.e inorder, preorder , postorder and level order. We cover the algorithm , code of each types of tree traversal, examples and previous question asked in gate.

Tree Traversal

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will cover Algorithm Designing Approaches With Problems and thier Solutions.

(Hindi) Greedy Algorithm Designing Approaches - GATE (CS & IT)

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

(Hindi) 100 Short Tricks to Learn Complexities of Algorithms - GATE (CS and IT)

IT Graduate | NITan. Teaching is my hobby and also a way to gain command over the subject by sharing knowledge with others.

Bhushan Mandal

In this course, the educator discusses the questions that were asked from the sorting section in gate previous years question paper.

(Punjabi) Sorting Algorithms - Previous Year Questions: GATE

In this course I am discussing previous years gate questions from sorting algorithms. This Course is beneficial for GATE (CS and IT) aspirants.

(Hindi) Sorting Algorithms Previous Years Questions : GATE (CS and IT)

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

Lessons

10 lessons • 1h 35m

Invalid Date

NaN

Course Overview

Invalid Date

NaN

Breadth First Search

Invalid Date

NaN

Depth First Search

Invalid Date

NaN

Bubble Sort

Invalid Date

NaN

Insertion Sort

Invalid Date

NaN

Selection Sort

Invalid Date

NaN

Dynamic programming - Part I

Invalid Date

NaN

Dynamic Programming - Part II

Invalid Date

NaN

Dynamic Programming -III

Invalid Date

NaN

Tree Traversal