Pursuing B.E. in University Visvesvaraya College of Engineering, Bangalore.

Kruthi Shankar Hegde

This course covers basics of Algorithms and algorithm design. It goes through in detail fundamental of algorithms and different categories of Algorithm design techniques

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

Design Analysis of Algorithms for GATE (CS and IT)

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

Design and Analysis of algorithms.
Categories of Algorithm, Algorithm designing techniques.

Overview

Introduction to Algorithm.
Details about algorithm, categories of algorithm and important characteristics of an algorithm.

Introduction to Algorithm

Algorithm designing.
Details about steps in designing and analysis of an algorithm and different designing techniques

Algorithm Designing Techniques

Analysis of algorithm. Time complexity and space complexity in detail.

Algorithm Analysis

Estimation of Time complexity. Solving Gate exam problems in detail.

How to find Time Complexity

Details on asymptotic notations. Big Oh, Big theta, Big Omega.

Asymptotic Notations

Detailed explanation on Brute Force. Linear Search and Selection Sort.

Brute Force : Linear Search, Selection Sort

Divide and Conquer techniques. Explanation about Merge Sort in detail.

Divide and Conquer : Merge Sort

Decrease and conquer detailed explanation. Binary Search Implementation and analysis. Linear search versus Binary search.

Decrease and Conquer : Binary Search

Greedy Technique : Prim's Algorithm

Kruskal's Algorithm for a connected graph

Greedy Algorithm : Kruskal's Algorithm

Detailed explanation on problems on Merge Sort

Problem solving for GATE

Master's Theorem and Problems on Master's Theorem

Master's Theorem

Explanation on Master's Theorem and problem solving on Master's Theorem

Master's theorem : Problem solving

Dijkstra Algorithm

Problem solving : Dijkstra Algorithm

Warshall algorithm

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

My name is Monika Dubey. M.Tech(CSE).Worked  as Asst. Professor. Currently, working as Research Scholar   

Monika Dubey

This course covers Matrix Chain Multiplication- Concept+Practice Question +GATE Previous Year Questions

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

 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

An algorithm is a step by step procedure to solve a problem.A problem can have multiple algorithms.Every algorithm is analysed for its performance on parameters like space and time and then the best one is selected to solve the problem.

(Hindi) Analysis of Algorithms

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

(Hindi) Greedy Approach : GATE

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

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

17 lessons • 2h 43m

Invalid Date

NaN

Overview

Invalid Date

NaN

Introduction to Algorithm

Invalid Date

NaN

Algorithm Designing Techniques

Invalid Date

NaN

Algorithm Analysis

Invalid Date

NaN

How to find Time Complexity

Invalid Date

NaN

Asymptotic Notations

Invalid Date

NaN

Brute Force : Linear Search, Selection Sort

Invalid Date

NaN

Divide and Conquer : Merge Sort

Invalid Date

NaN

Decrease and Conquer : Binary Search

Invalid Date

NaN

Greedy Technique : Prim's Algorithm

+ See all lessons