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.

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

Dynamic Programming: 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

This lesson gives the overview of all the lessons in the course.

Overview

This lesson describes about the dynamic programming, different steps in dynamic programming, how it is different from recursion and divide n conquer.It also talks about different problems in dynamic programming.

What is Dynamic Programming?

This lesson describes about the longest common subsequence ( LCS). It talks about what is LCS and why and when to apply LCS algorithm.

Longest Common Subsequence (LCS)

This lesson discusses an example on how to find LCS of the given strings.

How to Find LCS

This lesson describes about the 0-1 knapsack problem and its different approaches.

0-1 Knapsack Problem

This lesson describes the knapsack problen with the help of an example and also analyse the running time of algorithm.

Analysis and Example of Knapsack Problem

(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

Divide and conquer is an algorithm design paradigm based on multi-branched recursion. In this course, the educator will cover all the D & C methods like linear search, Binary search, Merge sort, Quick sort, Matrix multiplication, Integer multiplication, Min-Max Algorithm, set Algorithms, Tree representation, Priority Queue, and Heap.

Divide and Conquer Methods: GATE (CS and IT)

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

6 lessons • 45m

Invalid Date

NaN

Overview

Invalid Date

NaN

What is Dynamic Programming?

Invalid Date

NaN

Longest Common Subsequence (LCS)

Invalid Date

NaN

How to Find LCS

Invalid Date

NaN

0-1 Knapsack Problem

Invalid Date

NaN

Analysis and Example of Knapsack Problem