Scribd Logo
Upload

Welcome to Scribd!

  • Task 4 PDF

    Uploaded by

    harshimogalapalli
    51 views2 pages
    The document provides study material and practice questions for several graph and tree algorithms including BFS, DFS, Dijkstra's algorithm, Bellman-Ford algorithm, LCS, and matrix chain multiplication. It recommends solving the provided questions to gain experience with these topics and notes that mentors are available for help. The questions cover graphs, trees, and dynamic programming problems from Codeforces and Codechef competitions.

    Original Description:

    Original Title

    TASK 4.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides study material and practice questions for several graph and tree algorithms including BFS, DFS, Dijkstra's algorithm, Bellman-Ford algorithm, LCS, and matrix chain multiplication. It recommends solving the provided questions to gain experience with these topics and notes that mentors are available for help. The questions cover graphs, trees, and dynamic programming problems from Codeforces and Codechef competitions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    51 views2 pages

    Task 4 PDF

    Uploaded by

    harshimogalapalli
    The document provides study material and practice questions for several graph and tree algorithms including BFS, DFS, Dijkstra's algorithm, Bellman-Ford algorithm, LCS, and matrix chain multiplication. It recommends solving the provided questions to gain experience with these topics and notes that mentors are available for help. The questions cover graphs, trees, and dynamic programming problems from Codeforces and Codechef competitions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    TASK 4

    Study Material:

    ● BFS Traversal
    ● DFS Traversal
    ● Djistra’s Algorithm
    ● Bellman Ford Algorithm
    ● LCS
    ● Matrix Chain Multiplication

    The best practice anyone could do is solving question.We have complied few questions. We
    want you to explore each topic and solve these questions while doing so.If you are stuck or
    have any doubts you can always ping your mentor. Happy Coding :)

    Graphs
    https://codeforces.com/problemset/problem/437/C

    https://codeforces.com/contest/723/problem/D

    https://codeforces.com/contest/987/problem/F

    https://codeforces.com/contest/1081/problem/D

    https://codeforces.com/contest/1064/problem/D

    Trees
    https://codeforces.com/contest/1006/problem/E

    https://codeforces.com/problemset/problem/1139/C

    https://www.codechef.com/NOV13/problems/GERALD2

    DP
    https://codeforces.com/problemset/problem/463/D

    https://codeforces.com/contest/67/problem/A

    You might also like