Currently pursuing  Btech in CSE from GGSIPU. Love coding, teaching and participating in many coding competitions. 

Nipun Vats

Covering the first topic "Asymptomatic Analysis of Algorithms" of the chapter "algorithms"

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) Asymptomatic Analysis of Algorithms for GATE/IES

GATE (Graduate Aptitude Test In Engineering) Preparation

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Introduction about gate, syllabus and exam pattern

GATE Examination (in Hindi)

In this lesson, Nipun has discussed Asymptotic notations.

Algorithms - Asymptotic Notations (in Hindi)

In this lesson, Nipun has discussed Analysis of Algorithms.

Analysis of Algorithms - Part 1 (in Hindi)

Analysis of Algorithms - Part 2 (in Hindi)

In this lesson, Nipun has discussed the Analysis of Algorithms.

Analysis of Algorithms - Part 3 (in Hindi)

In this lesson, Nipun has discussed Comparing of functions.

Comparing Functions to Analyse Time Complexity (in Hindi)

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 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 11m

Invalid Date

NaN

GATE Examination (in Hindi)

Invalid Date

NaN

Algorithms - Asymptotic Notations (in Hindi)

Invalid Date

NaN

Analysis of Algorithms - Part 1 (in Hindi)

Invalid Date

NaN

Analysis of Algorithms - Part 2 (in Hindi)

Invalid Date

NaN

Analysis of Algorithms - Part 3 (in Hindi)

Invalid Date

NaN

Comparing Functions to Analyse Time Complexity (in Hindi)