(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 algo , tree representation and many more. we will also see the previous year question related to every topic asked in gate any year.

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 Algorithms (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

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.

Course Overview

This lesson is all about mark distribution in gate exam. So, we have seen previous 10 year mark distributon for subject Algorithm. As you will see, the average mark for algorithm is 13 marks. And the highest mark asked in gate is 25.

So, you will able to understand how important is this subject in Gate

Mark Distribution (Gate CS and IT)

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 (Gate CS and IT )

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 (Gate CS and IT)

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 (Gate CS snd IT)

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 (Gate CS and IT)

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 (Gate CS and IT)

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.

Tree Representation (Gate CS and IT)

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 Sort and Priority Queue

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 (Gate CS and IT)

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 (Gate CS & IT)

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 sorting techniques (Gate Cs and IT)

Hello friends, 

So we have all the topic that asked in Gate exam. Now, we start from the previous year question asked in Gate . Even, we have solutions too for your help.

It will help you to clearify your doubt and solve differnt variant of various topics.

Previous year question - I

Previous year Question - II

Previous year Question -III

Previous year Question -IV

Previous Year Question - V

Previous year Question - VI

Previous year Question - VII

Previous Year Question - VIII

Previous Year Question -IX

Previous year Question - X

Previous year Question -XI

Previous year Question - XII

Hello friends, 

So we have all the topic that asked in Gate exam. Now, we start from the previous year question asked in Gate . Even, we have solutions too for your help.

It will help you to clearify your doubt and solve different variant of various topics.

Previous year Question: XIII

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

My name is Monika Dubey. M.Tech(CSE).Worked  as Asst. Professor. Currently, working as Research Scholar   

Monika Dubey

This course covers Matrix Chain Multiplication- Concept+Practice Question +GATE Previous Year Questions

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

 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

An algorithm is a step by step procedure to solve a problem.A problem can have multiple algorithms.Every algorithm is analysed for its performance on parameters like space and time and then the best one is selected to solve the problem.

(Hindi) Analysis of Algorithms

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

(Hindi) Greedy Approach : GATE

🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

25 lessons • 3h 39m

Invalid Date

NaN

Course Overview

Invalid Date

NaN

Mark Distribution (Gate CS and IT)

Invalid Date

NaN

Linear Search and Binary Search (Gate CS and IT )

Invalid Date

NaN

Merge Sort (Gate CS and IT)

Invalid Date

NaN

Quick Sort (Gate CS snd IT)

Invalid Date

NaN

Integer Multiplication (Gate CS and IT)

Invalid Date

NaN

Matrix multiplication and Min-Max Algorithm (Gate CS and IT)

Invalid Date

NaN

Tree Representation (Gate CS and IT)

Invalid Date

NaN

Heap Sort and Priority Queue

Invalid Date

NaN

Shell Sort (Gate CS and IT)

+ See all lessons