(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

This course states about different types of algorithm , Analysis of algorithm , Recurrence relations with example . We will also see the asymptotic notation ( Big-oh , thera and Omega ) with lots of example. All question covered related to GATE.

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

Asymptomatic Analysis: GATE

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Course Overview

Introduction of Algorithm

Time complexity of Loop’s

Recurrence Relation and Recursive Algorithms

Asymptotic Notations - Part I

Asymptotic Notation - Part II

Asymptotic Notation - Part III

Asymptotic Notation - Part IV

Master’s theorem - I

Master’s theorem - II

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

10 lessons • 1h 56m

Invalid Date

NaN

Course Overview

Invalid Date

NaN

Introduction of Algorithm

Invalid Date

NaN

Time complexity of Loop’s

Invalid Date

NaN

Recurrence Relation and Recursive Algorithms

Invalid Date

NaN

Asymptotic Notations - Part I

Invalid Date

NaN

Asymptotic Notation - Part II

Invalid Date

NaN

Asymptotic Notation - Part III

Invalid Date

NaN

Asymptotic Notation - Part IV

Invalid Date

NaN

Master’s theorem - I

Invalid Date

NaN

Master’s theorem - II