🌟YouTube👉Make It easy #padhai
⭐Currently Educator at Knowledge Gate

Vinay Mishra

In this course, the educator is discussing 
the concept of Data Structures & Algorithm where I'll tell you how to analyze and solve questions of Gate exams using the logic & we'll also learn the tricks & skills to solve any questions in quick time.Hope you'll like it!

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

Hindi

(Hindi) Complete Crash Course on Data Structure & Algorithm with GATE PYQs!

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson you'll get to know how to convert postfix to infix expression then infix to tree and tree traversal with the questions asked in Gate-2016

Previous Year Gate 2016 Question-1 (in Hindi)

In this lesson you'll get to know the concept of grapf and Minimum Spanning tree with questions asked in Gate 2016 & 2015.

Previous Year Gate 2015 & 2016 Question-2,3 (in Hindi)

In this lesson you'll get to know concept of tree traversal & get to know the shortcut to calculate the maximum value of expression tree.

Previous Year Gate 2014 Question-4,5 (in Hindi)

In this Lesson you'll get some chintu mintu questions asked in Gate 2019,2007,2004,2006.

Previous Year Gate 2019,2007,2006 &2004 Question-7,8,9,10 (in Hindi)

In this lesson you'll get to know some gate exam question on tree.

Previous Year Gate 2007,2015,2016 &2003 Question-11,12,13,14 (in Hindi)

In this lesson you'll get to know about the concept of tree traversal with some previous years question from Gate-16 & Gate-18

Previous Year Gate 2016 & 2018 Question No-5,6 (in Hindi)

In this lesson you'll get to learn some tricks and skills to solve question of tree data structures.

Previous Year Gate 2004,2017,2005 &2004 Question-15,16,17,18,19 (in Hindi)

In this lesson you'll get some very important shortcut tricks to solve previous years questions.

Previous Year Gate 2005,2007,2015 2015,2015 Question-20,21,22,23,24 (in Hindi)

In this lesson you'll get to know some very important shortcut tricks to solve question asked in quick time.

Previous Year Gate 2015,2006,2014, 2011 Question-25,26,27,28 (in Hindi)

In this lesson you'll get to learn some Shortcuts to solve question in quick time.

Previous Year Gate 2002,2016,2017, 2015 Question-29,30,31,32,33 (in Hindi)

In this lesson you'll get to learn the concept of Graph & some shortcut tricks to solve Gate questions in quick time.

Previous Year Gate 2015,2014,2017, 2014 Question-34,35,36,37,38 (in Hindi)

In this lesson you'll get to know about the concept of Graph and its previous years question with shortcut tricks.

Previous Year Gate 2014,2015,2015, 2014 Question-39,40,41(in Hindi)

In this lesson you'll get to know some great shortcut tricks to learn the concept of Graph and solve questions with shortcuts.

Previous Year Gate 2013,2014,2015 Question-42,43,44(in Hindi)

In this lesson you'll get to learn some very good concept of DFS & BFS tree with analysis of question to solve it in quick time.

Previous Year Gate 2015,2018,2014 Question-45,46,47(in Hindi)

in this lesson you'll get an awesome trick to solve question for gate exam on Forest and tree.

Previous Year Gate 2014 Question-47(in Hindi)

In this lesson you'll get to know how you can use your logic to solve such gate question in easiest possible ways.

Previous Year Gate 2014 Question-48* (Tough ques but know how to solve it using logic) (in Hindi)

In this lesson you'll get to learn about tge topological order and will get to know the trick to solve it in quick time.

Previous Year Gate 2016 Question-49 (in Hindi)

In this lesson you'll get to know about the upper bound and question asked about the time complexity of any bst.

Previous Year Gate 2016 Question-50 (in Hindi)

In this lesson you'll get to know the concept of tree and recursion tree,this lesson will help you know how you can calculate time complexity of any tree using Recurrence tree method.

Previous Year Gate 2014 Question-51 & Concept of Recursion tree (in Hindi)

In this lesson you'll get to learn the concept of heap tree and some shortcut formula for binary trees.

Previous Year Gate 2014 Question-52 & Revision of Shortcut formula for binary tree (in Hindi)

In this lesson you'll get to learn about the concept of Graph Isomorphism with a question asked in Gate-2012

Previous Year Gate 2012 Question-53 (in Hindi)

In this lesson you'll get to learn some very good question on graph isomorphism and we'll solve couple of good questions on this which are asked in Gate-13 and Gate-15

Previous Year Gate 2013 & 2015 Question-54,55 (in Hindi)

In this lesson you'll get to learn how to solve some reasoning type questions in quick time and the analysis of the question.

Previous Year Gate 2012 Question-56 (in Hindi)

In this lesson you'll get to learn a very good question asked in Gate 2016 based on Stack and Queue.

Previous Year Gate 2016 Question-57 (in Hindi)

In this lesson you'll get to learn the concept of Havel Hakimi theorem important for Gate exam.

Previous Year Gate 2014 Question-58 (in Hindi)

In this lesson you'll get to learn the concept of Adjacency list and Adjacency Matrix and it's time complexity.

Previous Year Gate 2016,2014 Question-59,60 (in Hindi)

In this lesson you'll get to learn about some chintu mintu concept of data structure asked in ISRO and Gate exams.

Previous Year Gate-ISRO 2017,2008,2004,2017 Question-61,62,63,64 (in Hindi)

In this lesson you'll get to learn some chintu mintu concept questions asked in some previous year paper.

Previous Year Gate-ISRO 2017,2008,2013,2017 Question-65,66,67,68,69,70 (in Hindi)

In this lesson you'll get to learn about the Question based on Linked list and we'll solve that ques analysing the Question asked in Gate-2008

Previous Year Gate-2008 Question (in Hindi)

In this lesson you'll get to learn some question asked in Gate,UGC-NET,ISRO.

Previous Years Questions Gate,ISRO,UGC-NET 72,73,74,75,76,77 (in Hindi)

In this lesson you'll get to know about the questions asked in Gate-2020 on Linked list and AVL tree .

Gate-2020 Questions on linked list and AVL tree (in Hindi)

In this lesson you'll get to learn the concept of Bubble Sort,its algorithm,complete analysis and previous years Gate Questions.

Bubble Sort and it's analysis with Previously Years Gate Question(in Hindi)

In this lesson you'll get to learn the concept of quick sort with it's complete analysis along with previous years Gate question.

Quick Sort Complete Analysis with Previous Year Gate Question (in Hindi)

In this lesson you'll get to learn how to solve questions on quick sort asked in Gate.

Previous years questions on Quick Sort (in Hindi)

In this lesson you'll get to learn the concept of Selection Sort along with it's analysis and we'll solve some previous Year Gate Question.

Selection Sort and it's analysis with previous Year Gate Question(in Hindi)

In this lesson you'll get to learn the concept of insertion sort along with previous Year Gate Question.

Insertion Sort and it's analysis with previous Year Gate Question (in Hindi)

In this lesson you'll get to learn the concept of Merge Sort with it's complete analysis with previous Year Gate Question.

Merge Sort & its analysis with previous Year gate Question (in Hindi)

In thid lesson you'll get to learn the concept of heap sort and it's analysis with previous Year Gate Question.

Heap Sort and it's analysis with previous Year Gate Question (in Hindi)

In this lesson you'll get to learn the concept of Radix Sort and it's analysis with previous years gate question.

Radix Sort & it's analysis with previous years gate question (in Hindi)

In this lesson you'll get to learn how to solve some very good question asked in gate on time complexity.

Previous Years Gate-2006 & 2008 (in Hindi)

In this lesson you'll get to learn some very good Question asked in Gate based on asymptomatic analysis.

Previous Years Gate Questions on asymptomatic notation (in Hindi)

In this lesson you'll get to learn a new topic Algorithm Complete analysis of the syllabus and complete concept of Asymptomatic Notations.

Algorithm Syllabus and Asymptomatic Notations: Big Oh,Big Omega,Theeta,Small Oh and small Omega

In this lesson you'll get to learn some very good questions asked in Gate on Asymptomatic Notation.

Practice Problem on Asymptomatic Notation & Previous Years Gate Questions (in Hindi)

In this lesson you'll get to learn the concept of Recurrence Tree Method and we'll solve some previous years gate questions on this.

Recurrence Tree Method and Previous Years Gate Questions (in Hindi)

In this lesson you'll get to learn the concept of Master's Theorem,Extended Master's Theorem and other version of Master's Theorem with Previous Years Gate Questions.

Master's Theorem,Extended Master's theorem and Practice Problems (in Hindi)

In this lesson you'll get to learn the concept of greedy algorithm and huffman's coding along with previous years gate questions.

Greedy Algorithm:Huffman's Algorithms and previous Years Gate questions (in Hindi)

In this lesson you'll get to learn the concept of job sequencing with previous years gate questions.

Greedy Algorithm:Job Sequencing with previous years Gate Questions (in Hindi)

In this lesson you'll get to learn the knapsack problem and how to apply greedy approach to questions and we'll discuss optimal merge pattern with previous years gate questions.

Greedy Algorithm:Knapsack Problem & Optimal Merge Pattern with previous years gate questions

In this lesson you'll get to learn the concept of dynamic programming in easiest way and we'll solve some problems to know how to solve problems using dynamic approach and we'll also learn the concept of longest common subsequence.

Introduction to Dynamic Programming & Longest Common Subsequence (in Hindi)

In this lesson you'll get to learn the concept of longest Common subsequence with previous years gate question.

Longest Common Subsequence with Gate-2014 question (in Hindi)

In this lesson you'll get to learn some good Questions on longest common subsequence.

Previous Years Gate Questions on LCS (in Hindi)

In this lesson you'll get to learn about the concept of matrix chain multiplication with complete analysis and problems.

Dynamic Programming: Matrix Chain Multiplication (in Hindi)

In this lesson you'll get to learn the concept of matrix chain multiplication with its complete analysis.

Matrix Chain Multiplication with problem (in Hindi)

In this lesson you'll get to learn some questions of gate exam based on matrix chain multiplication.

Previous Years Gate Questions on Matrix Chain Multiplication (in Hindi)

In this lesson you'll get to learn about the concept of 0/1 Knapsack Problem using dynamic programming.

Dynamic Programming: 0/1 Knapsack Problem (in Hindi)

In this lesson you'll get to learn the simplified version for knapsack Problem which will help you to solve Questions quickly.

0/1 Knapsack Problem Simplified version (in Hindi)

In this lesson you'll get to learn the concept of subset sum problem using dynamic approach with previous years gate questions.

Dynamic Programming: Subset Sum Problem with Gate questions (in Hindi)

In this lesson you'll get to learn how to solve travelling Salesman problem using dynamic approach.

Dynamic Programming: Travelling Salesman Problem (in Hindi)

In this lesson you'll get to learn the concept of Floydd Warshall's Algorithm using dynamic Programming paradigm.

Dynamic Programming: Flyodd Warshall Algorithm with PYQ (in Hindi)

In this lesson you'll get to learn about the optimal Binary search tree.

Dynamic Programming: Optimal Binary Search Tree (in Hindi)

In this lesson you'll get to learn the concept of hashing and hash function with the idea to implement it and also we'll discuss about the problems of it such as collision & we'll try to resolve it using some techniques known as collision resolution techniques.

Hashing Concepts (in Hindi)

In this lesson you'll get to learn the concept of collision resolution techniques like linear probing,quadratic probing,double hashing and chaining.

Collision Resolution Techniques: Linear Probing,Quadratic Probing,Double Hashing & Chaining

In this lesson you'll get to learn how to solve questions based on hashing & collision resolution asked in gate exam.

Previous Years Gate Questions on Hashing & Collision Resolution (in Hindi)

In this lesson you'll get to learn the concept of Graph Traversal:BFS & DFS and also we'll discuss about their applications.

Graph Traversal: B.F.S & D.F.S (in Hindi)

In this lesson you'll get to learn how to solve questions on BFS & DFS.

Previous years Gate Question on BFS & DFS (in Hindi)

In this lesson you'll get to learn the concept of dijkstra algorithm with previous years gate question.

Dijkstra Algorithm with previous year gate question (in Hindi)

In this lesson you'll be get to learn how to solve questions based on dijkstra algorithm.

Previous years gate question on Dijkstra Algorithm (in Hindi)

In this lesson you'll get to learn the concept of Bellman Ford Algorithm with previous years gate question.

Bellman Ford Algorithm with previous years gate question (in Hindi)

In this lesson you'll get to learn the concept of Connected Components, Articulation Point and Biconnected Components.

Connected Components, Articulation Point & Biconnected Components (in Hindi)

In this video you'll get to learn the concept of Kruskal's and prims algorithm.

Kruskal's and Prim's Algorithm with previous year gate question (in Hindi)

In this lesson you'll get to learn the concept of Topological sorting with previous years Gate questions.

Topological Sorting with Previous years Gate questions (in Hindi)

In this lesson you'll get to learn how to solve questions based on graph algorithm.

Previou Years Questions on Graph Algorithm (in Hindi)

In this lesson you'll get to learn the concept of Searching algorithm: Sequential Search and Binary Search with previous years gate questions.

Sequential Search & Binary Search with previous years Gate questions (in Hindi)

In this lesson you'll get to learn some very good questions on sorting algorithm.

6 Previous Years Questions on Sorting algorithm (in Hindi)

In this lesson you'll get to learn the concept of insertion at begin in singly linked list.

Full Concept of Insertion in Singly Linked List (begin,last,end,middle,any position)Part-1(in Hindi)

In this lesson you'll get to learn the concept to add node at the last of the linked list.

Full Concept of Insertion in Singly Linked List (begin,last,end,middle,any position)Part-2(in Hindi)

In this lesson you'll get to learn the concept of insertion at middle and insertion at any position.

Full Concept of Insertion in Singly Linked List (begin,last,end,middle,any position)Part-3(in Hindi)

In this lesson you'll get to learn the concept of printing elements of linked list.

Printing the elements of linked list (in Hindi)

In this lesson you'll get to learn the concept of deletion and searching in linked list.

Deletion and Searching operation in singly linked list (in Hindi)

In this lesson you'll learn the concept to solve problems on linked list.

Previous Years Gate Questions on Singly Linked list (in Hindi)

In this lesson you'll learn the concept of circular and doubly linked list.

Full Concept of Circular & Doubly Linked list (in Hindi)

In this lesson you'll get to learn the concept of to solve previous years questions on linked list.

Previous Years Gate Questions on Linked List (in Hindi)

In this lesson you'll get to learn the concept of stack implemented using array!

Full concept of Stack Part-1 (in Hindi)

In this lesson you'll get to learn the concept of stack implementation using linked list.

Full concept of Stack Part-2 (in Hindi)

In this lesson you'll get to learn about the gate questions on stack and it's skills to solve it easily.

Gate questions on stack Part-1 (in Hindi)

In this lesson you'll get to learn the concept of stack with some previous Years questions and some practice problems.

Gate questions on stack part-2 (in Hindi)

In this lesson you'll learn the concept of queue using array and linked list.

Full Concept of Queue Part-1 (in Hindi)

In this lesson you'll learn the concept of circular queue.

Full Concept of Circular Queue Part-2 Queue concept (in Hindi)

In this lesson you'll get to learn the concept of queue how to implement it using 2 stack.

Implementation of Queue using Stack with Gate Question (in Hindi)

In this lesson you'll learn the concept of deque and it's implementation using circular array.

Double Ended Queue (Deque) (in Hindi)

In this lesson you'll learn the concept of Priority Queue.

Full Concept of Priority Queue with PYQ (in Hindi)

In this lesson you'll learn how to solve questions on queues.

Previous Years Gate Questions on Queue (in Hindi)

In this lesson you'll learn the concept of Binary Tree and it's types.

Full Concept of Binary Tree Part-1 (in Hindi)

In this lesson you'll learn the concept to implement Binary tree.

Lessons

107 lessons • 19h 46m

Invalid Date

NaN

Previous Year Gate 2016 Question-1 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2015 & 2016 Question-2,3 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2014 Question-4,5 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2019,2007,2006 &2004 Question-7,8,9,10 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2007,2015,2016 &2003 Question-11,12,13,14 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2016 & 2018 Question No-5,6 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2004,2017,2005 &2004 Question-15,16,17,18,19 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2005,2007,2015 2015,2015 Question-20,21,22,23,24 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2015,2006,2014, 2011 Question-25,26,27,28 (in Hindi)

Invalid Date

NaN

Previous Year Gate 2002,2016,2017, 2015 Question-29,30,31,32,33 (in Hindi)

+ See all lessons