Please Login To Continue

Knapsack Problem (in Hindi)

Lesson 3 of 11 • 12 upvotes • 8:52mins

Avatar

Monika Dubey

Knapsack Problem with Example

Continue on app
1

Concept of Greedy Approach (in Hindi)

8:55mins

2

Job Sequence Problem with Deadlines (in Hindi)

10:45mins

3

Knapsack Problem (in Hindi)

8:52mins

4

Shortest Path Algorithm (in Hindi)

12:46mins

5

Kruskal's Algorithms (in Hindi)

9:13mins

6

Prim's Algorithm (in Hindi)

8:09mins

7

Difference - Kruskal's Algorithms and Prim's Algorithms (in Hindi)

10:05mins

8

Dijkstra's Algorithm with Example (in Hindi)

9:09mins

9

Bellman-Ford Algorithms (in Hindi)

11:32mins

10

Haffman Coding (in Hindi)

9:59mins

11

Humming Code Algorithm with Example (in Hindi)

8:30mins

Crack GATE - Iconic Pro with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

More from Monika Dubey

thumbnail
EnglishCS & IT

Powerful Tricks to Solve Problems on Planar Graph

Monika Dubey

Similar Plus Courses

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app