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

Jaspreet Kaur

This course is about the recurrences in the different algorithm and discussed different methods to solve them.

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

Recurrences In Algorithms: GATE

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

This contains the overview of the course, target audience, objective of the course and lessons in the course

Overview

This lesson describes the iteration method, one of the method to solve recurrences in algorithm.

Iteration Method

This lesson describes the master method to solve the recurrences in algorithm. It is used when we have recurrence in some specific form.

Master Method

This lesson describes the Substitution Method, one of the method to solve the recurrences in algorithms.

Substitution Method

This lesson gives the introduction of what are recurrences and when they arise. It also includes some example of recurrences in commonly used algorithms.

What are Recurrences?

This lesson describes the recursion tree method to solve the recurrences in algorithm.

Recursion Tree Method

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)

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

Divide and Conquer Methods: GATE (CS and IT)

 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

6 lessons • 47m

Invalid Date

NaN

Overview

Invalid Date

NaN

Iteration Method

Invalid Date

NaN

Master Method

Invalid Date

NaN

Substitution Method

Invalid Date

NaN

What are Recurrences?

Invalid Date

NaN

Recursion Tree Method