M tech. computer science
GATE Qualified
UPSC  Aspirant

Love to teach...Let's make Learning easy
Ex-Lecturer S.G.S.I.T.S indore


Poonam Kanungo

My course Describing About Analysis of Algorithm,What is Algorithm.

This course is specially design for GATE ,As per GATE syllabus Algorithm is mostly less attempted part by students.
But By this course , You will definetly Enjoy the subject .

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

Algorithm Analysis: 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

overview of course "Algorithm Analysis"..This lesson contains ,what topics course going to cover for GATE

Overview of Course (in Hindi)

Lesson content: 

Introduction of Algorithm
Time and Space complexity
Auxiliary Space
Algorithm Differences points
Characteristics of Algorithm.

Lesson 1 Algorithm (in Hindi)

Analysis of Algorithms ,Time and Space Complexity ,Worst case Best case and Average case studies.

Lesson 2 Analysis Phenomenon of Algorithm (in Hindi)

Lesson 3 Asymptotic Notations (in Hindi)

Behaviour of Algorithm(Worst,BestNad Average case )

Lesson 4 Worst case,Best case and Average case (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 • 57m

Invalid Date

NaN

Overview of Course (in Hindi)

Invalid Date

NaN

Lesson 1 Algorithm (in Hindi)

Invalid Date

NaN

Lesson 2 Analysis Phenomenon of Algorithm (in Hindi)

Invalid Date

NaN

Lesson 3 Asymptotic Notations (in Hindi)

Invalid Date

NaN

Lesson 4 Worst case,Best case and Average case (in Hindi)