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

Sourav Newatia

Divide and conquer is an algorithm design paradigm based on multi-branched recursion. In this course, the educator will cover all the D & C methods like linear search, Binary search, Merge sort, Quick sort, Matrix multiplication, Integer multiplication, Min-Max Algorithm, set Algorithms, Tree representation, Priority Queue, and Heap.

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

Divide and Conquer Methods: GATE (CS and IT)

Greedy Techniques

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Linear search is a method for finding a target value within a list. It sequencially checks each elements of the list. We have cover the algorithm , Coding behaviour as well as the Example..

Binary search is a search algorithm that finds the position of a target value within a sorted array. So, we have seen it in depth , where time complexity is discussed in brief.

Linear Search and Binary Search

Merge Sort is an efficient , general purpose , comparison based sorting algorithm. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Merge Sort

Quick sort is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Quick Sort

We have given two binary number and we have to find the product of two number. To find this, we have different type of methods. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Integer Multiplication

Matrix multiplication is an algorithm named as strassen algorithm. It is faster than the standard matrix multiplication algorithm and is used in practice for large matrices. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Matrix Multiplication and Min-Max Algorithm

Trees is a widely used abstract data types or data structure to implement this ADT that simulates a heirarchical tree structure with a root value or subtrees. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Trees Representation

A heap is specialized tree-based data structure that satisfy the heap property : if P is a parent node of C, then the key (the value ) of P is either greater than or equal to the ley of C .  In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Heap and Priority Queue

Radix sort is a non comparison based interger sorting that sorts data with integer keys by grouping keys by the individual digits which share the sign significant position and value . In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Radix Sort

Shell sort is a variation of insertion sort. In Insertion sort , we move element only one position ahead. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Shell Sort

In this chapter, we compare two types of sorting algorithm i.e comparison based sorting techniques and non- comparison based sorting. In this chapter , we have cover the Introduction , Algorithm , coding behaviour , Time complexity , Examples of previous year gate question.

Analysis of different type of Algorithm

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 discuss Graph Algorithms in detail with concepts first and then previous year questions on this topic. So, this is a complete course in Graph Algorithms that have a Weightage of 2 marks.

(Hindi) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

This course will cover Shortest Path Algorithms like Djikstra, Bellman-Ford and Floyd Warshall Algorithm. The course will be beneficial for GATE Aspirants.

(Hindi) Shortest Path Algorithms Practice Questions: GATE (CS and IT)

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

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

Working Professional | Computer Science Engineer | Developer | Programmer | Cleared GATE Examination

Jaspreet Kaur

This course is about Dynamic programming. It introduce you to what the dynamic programming is, its uses, its various problems and their analysis.

Dynamic Programming: GATE

 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses searching algorithms and hashing and its different collision resolution techniques with previous year gate questions

Searching and Hashing for GATE

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

Lessons

10 lessons • 1h 43m

Invalid Date

NaN

Linear Search and Binary Search

Invalid Date

NaN

Merge Sort

Invalid Date

NaN

Quick Sort

Invalid Date

NaN

Integer Multiplication

Invalid Date

NaN

Matrix Multiplication and Min-Max Algorithm

Invalid Date

NaN

Trees Representation

Invalid Date

NaN

Heap and Priority Queue

Invalid Date

NaN

Radix Sort

Invalid Date

NaN

Shell Sort

Invalid Date

NaN

Analysis of different type of Algorithm