BTech IIIT Bhubaneswar, Qualified JEE Mains 2014,2015, Indian Engineering Olympiad AIR 37, GATE Qualified in 2018 (98.54 Percentile)

Subham Mishra

This will be a comprehensive course on algorithms for GATE and PSU exams. This is part of a series of courses. In this course, Subham will be covering Algorithms, Asymptotic Analysis from basic. Also, previous year questions from GATE, PSU, ISRO exam will be solved.

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

Asymptotic Analysis of Algorithms for GATE - Practice Questions and PYQs

Past Year Question Papers

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

In this lesson, Subham has covered one practice question and one previous year GATE questions asked in 1993.

Practice and Previous Year Questions - Part 1

In this lesson, Subham has discussed two more questions on Asymptotic Notation.

Practice and Previous Year Questions - Part 2

In this lesson, Subham has discussed two previous year questions papers.

Practice and Previous Year Questions - Part 3

In this lesson, has discussed previous year GATE 1994 questions.

Practice and Previous Year Questions - Part 4

In this lesson, Subham has discussed two more practices questions on increasing order of Asymptotic complexity.

Practice and Previous Year Questions - Part 5

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

5 lessons • 48m

Invalid Date

NaN

Practice and Previous Year Questions - Part 1

Invalid Date

NaN

Practice and Previous Year Questions - Part 2

Invalid Date

NaN

Practice and Previous Year Questions - Part 3

Invalid Date

NaN

Practice and Previous Year Questions - Part 4

Invalid Date

NaN

Practice and Previous Year Questions - Part 5