Hello guys welcome to my profile !
I am currently pursuing B.Tech in computer science and engineering  from KIIT university. HappyLearning!


Roli Verma

This course includes all the essential types of  analysis techniques and algorithms based on divide and conquer concept.It is designed for engineering students and GATE aspirants.

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 & ESE

English

Design and Analysis of Algorithms - GATE(CS and IT)

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

It discusses concepts about asymptotic analysis and notations from the scratch and a few conceptual questions for clarity.

Asymptotic Notations

Growth rate and calculating frequency count for complex loops and non iterative functions and thereby finding time complexity.

Time Complexity (Non Recursive Functions )

Finding the recurrence relation and solving them (by Master's theorem and recurrence tree method) for recursive functions.

Time Complexity of Recursive Functions

Substitution method (including change of variables ) for solving recursive equations of time complexity.

Time Complexity of Recursive Functions - 2

Binary search algorithm (recursive ) using Divide and Conquer technique

Divide and Conquer (Binary Search)

Recursive Mergesort using Divide and Conquer technique.

Divide and Conquer (Merge Sort)

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

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

(Hindi) Artificial Neural Networks in 60 Minutes

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 dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

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

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

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

6 lessons • 1h 9m

Invalid Date

NaN

Asymptotic Notations

Invalid Date

NaN

Time Complexity (Non Recursive Functions )

Invalid Date

NaN

Time Complexity of Recursive Functions

Invalid Date

NaN

Time Complexity of Recursive Functions - 2

Invalid Date

NaN

Divide and Conquer (Binary Search)

Invalid Date

NaN

Divide and Conquer (Merge Sort)