Home » B.Tech / MCA » DAA Tutorial
Category:

# DAA Tutorial

• ## DAA Algorithm

DAA Algorithm The word algorithm has been derived from the Persian author’s name, Abu Ja ‘far Mohammed ibn Musa al Khowarizmi (c.…

• ## Traveling Salesperson problem using branch and bound

Traveling Salesperson problem using branch and bound Given the vertices, the problem here is that we have to travel each vertex exactly…

• ## DAA | Kruskal Algorithm

Kruskal Algorithm The Kruskal Algorithm is used to find the minimum cost of a spanning tree. A spanning tree is a connected…

• ## DAA Recurrence Relation

Recurrence Relation A recurrence is an equation or inequality that describes a function in terms of its values on smaller inputs. To…

• ## How to solve a dynamic programming problem

How to solve a dynamic programming problem? What is dynamic programming? Dynamic programming is an optimization technique developed by Richard Bellman in…

• ## DAA Red Black Tree

Red Black Tree A Red Black Tree is a category of the self-balancing binary search tree. It was created in 1972 by…

• ## Longest Increasing Subsequence

Longest Increasing Subsequence In this topic, we will learn how to find the longest increasing subsequence in an array using dynamic programming.…

• ## DAA | Johnson’s Algorithm

Johnson’s Algorithm The problem is to find the shortest path between every pair of vertices in a given weighted directed graph and…

• ## DAA Selection Sort

Selection Sort The selection sort enhances the bubble sort by making only a single swap for each pass through the rundown. In…

• ## Longest Repeated Subsequence

Longest Repeated Subsequence The longest repeated subsequence states that in a given string; the length of the longest repeated subsequence should be…