Kirti Choudhary

This course includes the basic concepts like solving time complexity, asymptotic notations, and sorting and searching techniques. The course will be beneficial for GATE (CS and IT).

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

Introduction to Design and Analysis of Algorithms

Greedy Techniques

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 we learn about algorithm word and then we start to calculate time complexity in simpler ways

Algorithms and Time Complexity

In this lesson we calculate time complexity of loops and nested loops. Also we see how a time complexity calculated is generalised

Time Complexity of Loops and Nested Loops

In this lesson we learn how an insertion sort works and how to implement it

Insertion Sort Algorithm

In this lesson, we analyse the Insertion Sort algorithm , calculating its running time from the best case to the worst case.

Analysing Insertion Sort

In this lesson, we learn three asymptotic notations, theta, big O and big omega

Asymptotic Notations (part 1)

In this lesson, we are solving some basic questions related to asymptotic notations.

Asymptotic Notations (part 2)

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 discuss Graph Algorithms in detail with concepts first and then previous year questions on this topic. So, this is a complete course in Graph Algorithms that have a Weightage of 2 marks.

(Hindi) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

This course will cover Shortest Path Algorithms like Djikstra, Bellman-Ford and Floyd Warshall Algorithm. The course will be beneficial for GATE Aspirants.

(Hindi) Shortest Path Algorithms Practice Questions: GATE (CS and IT)

This course will cover Algorithm Designing Approaches With Problems and thier Solutions.

(Hindi) Greedy Algorithm Designing Approaches - GATE (CS & IT)

Working Professional | Computer Science Engineer | Developer | Programmer | Cleared GATE Examination

Jaspreet Kaur

This course is about Dynamic programming. It introduce you to what the dynamic programming is, its uses, its various problems and their analysis.

Dynamic Programming: GATE

 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses searching algorithms and hashing and its different collision resolution techniques with previous year gate questions

Searching and Hashing for GATE

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

Lessons

6 lessons • 1h 25m

Invalid Date

NaN

Algorithms and Time Complexity

Invalid Date

NaN

Time Complexity of Loops and Nested Loops

Invalid Date

NaN

Insertion Sort Algorithm

Invalid Date

NaN

Analysing Insertion Sort

Invalid Date

NaN

Asymptotic Notations (part 1)

Invalid Date

NaN

Asymptotic Notations (part 2)