KANIMOZHIK

DS-UNIT V

  UNIT IV   INTRODUCTION TO ALGORITHMS: Definition   of   Algorithms-   Overview   and   importance   of   algorithms-   pseudocode conventions, Asymptotic notations, practical complexities. Graph   Applications:   Breadth   first   traversal   –   Depth   first   traversal-   -Single   source shortest path – Minimal spanning trees – prim’s and kruskal’s algorithms   INTRODUCTION TO ALGORITHMS   4.1)Definition   of   Algorithms   ●       An algorithm is a well-defined, step-by-step procedure or set of rules used to solve a particular problem or perform a specific task. ●       Algorithms are widely applied in various fields like mathematics, computer science, and data processing. 4.2)Overview   and   importance   of   algorithms ●       In data...