An Algorithm is a sequence of steps to solve a problem. **Design and Analysis of Algorithm** is very important for **designing algorithm** to solve different types of problems in the branch of computer science and information technology.

Why is **design and analysis of algorithm** important to **study**? **Designing algorithm** is necessary before writing the program code as it (**algorithm**) explains the logic even before the code is developed. … So **we design algorithms** and analyse them for Time complexity, Space complexity, efficiency etc.

No | Topic | Link |
---|---|---|

1. | Introduction | DAA 00 |

2. | Analysis Technique | DAA 02 |

3. | Brute Force | |

4. | Transform and Conquer | |

5. | Divide and Conquer | |

6. | Greedy | |

7. | Dynamic Programming | |

8. | Dynamic Programming (cont’d) | |

9. | Back Tracking | |

10. | Graph | |

11. | Branch and Bound | |

12. | Shortest Path | |

13. | Spanning Trees | |

14. | ||

15. | ||

16. | Referensi dan RPS |