GATE & ESE - ME & CH

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

The course is related to different types of sorting with examples.

Course on Sorting for GATE Exams

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

In this course, Akanksha shall be discussing all sorting algorithms in detail. The course is narrated in Hindi and useful for GATE (CS and IT ) aspirants

(Hindi) Sorting Algorithms for GATE

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

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

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 Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

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

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

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

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

In this course, Vatsala has discussed Analysis and Designing of Algorithms. She has also covered Huffman Coding, Optimal Merge Pattern, Minimum Spanning Tree, Prim's algorithm, Kruskal's Algorithm and their examples.

(Hindi) Analysis and Designing of Algorithms (ADA)

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

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)

English

All questions

Greedy Techniques

Algorithms

Divide and Conquer

Graph Based Algorithm

P-NP Completeness

Applications of Greedy Techniques

Single Source Shortest Path

CS & IT

GATE - CSIT, DSAI & Placements

Recurrence Relations

Dynamic Programming

Searching

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

Akansha Aggarwal

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

Hello !myself shubham vijay kogade, studying  computer engineering at sinhgad institute pune, Educator in Unacademy..

Shubham Kogade

 Hey! I am unlike a common Indian teenager who is pursuing BE in IT, loves coding & have a lot of dreams..
 Welcome to my retina of learning

SELF STUDY

Algorithms

Algorithms

Divide and Conquer

Greedy Techniques

Algorithms

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

4.5

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

4.6

(Hindi) Dynamic Programming : MCM & LCS

4.3

(Hindi) Artificial Neural Networks in 60 Minutes

4.7

Divide and Conquer

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

4.6

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

4.7

(Hindi) Sorting Algorithms for GATE

4.9

Course on Sorting for GATE Exams

4.3

Greedy Techniques

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

4.7

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

4.6

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

4.8

(Hindi) Analysis and Designing of Algorithms (ADA)

4.6