Bachelors of Technology in Software
SRM University
Educator on Unacademy
I am a passionate programmer :)

Shivam Malani

Fundamentals of algorithm
Algorithm design techniques
Designing an algorithm and its Analysis
Asymptotic Notations

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 Algorithm Design: GATE

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

About the course and about the instructor

Overview

Algorithm Design Techniques

Algorithm Analysis

Asymptotic Notation
Thetha notation
Omega notation
Big O notation

Asymptotic Notations

Linear and Binary Search

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 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

5 lessons • 34m

Invalid Date

NaN

Overview

Invalid Date

NaN

Algorithm Design Techniques

Invalid Date

NaN

Algorithm Analysis

Invalid Date

NaN

Asymptotic Notations

Invalid Date

NaN

Linear and Binary Search