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

Akansha Aggarwal

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.

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) Analysis of Algorithms

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

There are two different types of algorithm analysis:dependent and independent analysis.

Introduction (in Hindi)

Best,average and worst case time analysis and their properties are discussed

Asymptotic Analysis (in Hindi)

This lesson discusses problems on asymptotic notations.

Problems on Asymptotic Notations (in Hindi)

Problems on calculating time complexity in a loop are discussed in this lesson

Loop Analysis (in Hindi)

This lesson mentions the various methods of solving recurrences and discusses the problems on substitution method

Solving Recurrences (in Hindi)

Recurrence tree method creates a recursion tree where each node of tree has a cost.These costs at levels of recursion tree are summed up to calculate the total time complexity.

Recurrence Tree Method (in Hindi)

Master's theoren and it's three cases along with the examples are discussed in this lesson

Master's Theorem - 1 (in Hindi)

This lesson discusses problems on Master's Theorem

Master's Theorem - 2 (in Hindi)

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

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)

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

Searching and Hashing for GATE

Greedy Algorithms is not an algorithm but an algorithmic paradigm where we are greedy about the current best and hope that current best will lead to global best.This course discusses greedy algorithms as an algorithmic paradigm and some problems that are solved using greedy algorithms

(Hindi) Greedy 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

8 lessons • 1h 35m

Invalid Date

NaN

Introduction (in Hindi)

Invalid Date

NaN

Asymptotic Analysis (in Hindi)

Invalid Date

NaN

Problems on Asymptotic Notations (in Hindi)

Invalid Date

NaN

Loop Analysis (in Hindi)

Invalid Date

NaN

Solving Recurrences (in Hindi)

Invalid Date

NaN

Recurrence Tree Method (in Hindi)

Invalid Date

NaN

Master's Theorem - 1 (in Hindi)

Invalid Date

NaN

Master's Theorem - 2 (in Hindi)