2 Linear and Non-linear Data Structures

2 Linear and Non-linear Data Structures

35 RSA Public Key Cryptosystem

35 RSA Public Key Cryptosystem

34 Modular Exponentiation

34 Modular Exponentiation

33 Chinese Remainder Theorem

33 Chinese Remainder Theorem

32 Solving Modular Linear equation using Extended Euclid's Algorithm

32 Solving Modular Linear equation using Extended Euclid's Algorithm

31 Extended Euclid's Algorithm

31 Extended Euclid's Algorithm

42 1 Memory Function Knapsack Problem

42 1 Memory Function Knapsack Problem

56 Travellig Salesman Problem using Branch & Bound

56 Travellig Salesman Problem using Branch & Bound

55 Knapsack Problem using Branch & Bound

55 Knapsack Problem using Branch & Bound

54 Assignment Problem using Branch & Bound

54 Assignment Problem using Branch & Bound

30 Fibonacci Heap 2 Operations

30 Fibonacci Heap 2 Operations

53 N-Queen's Problem

53 N-Queen's Problem

29 Fibonacci Heap 1 - Introduction & Insertion

29 Fibonacci Heap 1 - Introduction & Insertion

52 C Program to Solve Sum of Subset Problem using Backtracking

52 C Program to Solve Sum of Subset Problem using Backtracking

51 Sum of Subset Problem - Back Tracking

51 Sum of Subset Problem - Back Tracking

28 Binomial Heap 2 Operations

28 Binomial Heap 2 Operations

50 Huffman Coding

50 Huffman Coding

27 Binomial Heap 1 - Introduction & Properties

27 Binomial Heap 1 - Introduction & Properties

49 C Program to implment Dijkstra's Algorithm to find shortest path from a given source vertex

49 C Program to implment Dijkstra's Algorithm to find shortest path from a given source vertex

26 Bipartite Graph and Maximum Matching in Bipartite Graph

26 Bipartite Graph and Maximum Matching in Bipartite Graph

48 Dijkstra's Algorithm Single Source Shortest Path

48 Dijkstra's Algorithm Single Source Shortest Path

47 Kruskal's Algorithm to find Minimum Spanning Tree

47 Kruskal's Algorithm to find Minimum Spanning Tree

25 Max -flow min-cut Theorem

25 Max -flow min-cut Theorem

43 C Program to Solve Knapsack Problem using Dynamic Programming

43 C Program to Solve Knapsack Problem using Dynamic Programming

46 C Program to find Minimum Spanning Tree using Prims Algorithm

46 C Program to find Minimum Spanning Tree using Prims Algorithm

45 Introduction to Greedy Technique & Prims Algorithm to find MST

45 Introduction to Greedy Technique & Prims Algorithm to find MST

24 Ford Fulkerson Algorithm to find max flow in a flow network

24 Ford Fulkerson Algorithm to find max flow in a flow network

23 Introduction to Max Flow & its Terminologies

23 Introduction to Max Flow & its Terminologies

42 0-1 Kanapsack Problem

42 0-1 Kanapsack Problem

41 Warshall's Algorithm

41 Warshall's Algorithm