🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

This course consists of intro to Asymptotic notations and finding time and space complexity of iterative and recursive 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 & ESE

English

Asymptotic Analysis - Finding Time and Space complexity of Algorithms

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson provides details of algorithm course along with marks distribution. It algo covers what is an algorithm and types of Asymptotic Notations

Introduction to Algorithms

Understanding all the three Asymptotic Notations - Big Oh, Big Omega and big theta in detail. Also, providing the practical significance of these Notations.

Introduction to Asymptotic Notations

Examples to find out running time of Iterative programs

Time Complexity analysis of Iterative Programs

More examples on finding time complexity of iterative programs

Examples on finding TC of Iterative Programs -2

Previous year GATE questions on finding time complexity of iterative programs

PYQ's on finding TC of Iterative Programs

Master Theorem for Divide and Conquer Recurrences and examples on the same

Master Theorem for Divide and Conquer Recurrences

Back Substitution method to solve Recurrences with example and PYQs

Back Substitution method for solving Recurrences

Recursion Tree method to find TC of Recurrences

Finding Time Complexity by Comparing Functions

Finding TC by Comparing Functions

GATE Questions on finding TC by Comparing Functions

What is Space Complexity and how to calculate space Complexity of Iterative programs

Space Complexity of Iterative algorithms

Finding Space Complexity of Recursive programs

Space Complexity of Recursive algorithms

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

12 lessons • 1h 59m