Bachelors of Technology in Software
SRM University
Educator on Unacademy
I am a passionate programmer and Coding is life for me :)

Shivam Malani

OBJECTIVES:-
To know about the importance of algorithm designs
To know about various design techniques and approaches
To get the idea of asymptotic notations
To go through fundamentals of algorithm
To take a test of our own knowledge

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

Hindi

(Hindi) Introduction to Algorithm Design

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 me(Your Instructor) and about the course

Overview (in Hindi)

Introduction to algorithm
Characteristics of an Algorithm
Algorithm Design Techniques
Brute force
Divide and Conquer
Greedy Algorithms
Backtracking
Branch and Bound

Algorithm Design Techniques (in Hindi)

Algorithm Analysis
Estimation of time Complexity
Line count and Operation Count method
Space and time complexity

Algorithm Analysis (in Hindi)

Asymptotic Notations
theta notation
Big O notation
Omega notation

Asymptotic Notations (in Hindi)

Linear and Binary Search
Pseudo Code
Complexity Analysis

Linear and Binary Search (in Hindi)

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

5 lessons • 33m

Invalid Date

NaN

Overview (in Hindi)

Invalid Date

NaN

Algorithm Design Techniques (in Hindi)

Invalid Date

NaN

Algorithm Analysis (in Hindi)

Invalid Date

NaN

Asymptotic Notations (in Hindi)

Invalid Date

NaN

Linear and Binary Search (in Hindi)