Scribd Logo
Upload

Welcome to Scribd!

  • TH C Hành TTUD - 20221 - Sheet1

    Uploaded by

    ahihi
    7 views1 page
    The document outlines a 5-session course covering various algorithms topics. Session 1 introduces data structures and libraries and has exercises on telco data, mazes, range minimum queries, and subrectangles. Session 2 covers backtracking, branch and bound, and assigns exercises on equations, course assignments, and CBUS. Session 3 focuses on divide and conquer and greedy algorithms, assigning exercises on segments, inversions, and subsequences. Session 4 is on dynamic programming, with exercises on subsequences, gold mining, warehouses, and nurses. Session 5 deals with graphs and has exercises on bridges, scheduling, buses, and strongly connected components.

    Original Description:

    Original Title

    Thực Hành TTUD - 20221 - Sheet1

    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 outlines a 5-session course covering various algorithms topics. Session 1 introduces data structures and libraries and has exercises on telco data, mazes, range minimum queries, and subrectangles. Session 2 covers backtracking, branch and bound, and assigns exercises on equations, course assignments, and CBUS. Session 3 focuses on divide and conquer and greedy algorithms, assigning exercises on segments, inversions, and subsequences. Session 4 is on dynamic programming, with exercises on subsequences, gold mining, warehouses, and nurses. Session 5 deals with graphs and has exercises on bridges, scheduling, buses, and strongly connected components.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    TH C Hành TTUD - 20221 - Sheet1

    Uploaded by

    ahihi
    The document outlines a 5-session course covering various algorithms topics. Session 1 introduces data structures and libraries and has exercises on telco data, mazes, range minimum queries, and subrectangles. Session 2 covers backtracking, branch and bound, and assigns exercises on equations, course assignments, and CBUS. Session 3 focuses on divide and conquer and greedy algorithms, assigning exercises on segments, inversions, and subsequences. Session 4 is on dynamic programming, with exercises on subsequences, gold mining, warehouses, and nurses. Session 5 deals with graphs and has exercises on bridges, scheduling, buses, and strongly connected components.

    Copyright:

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

    Buổi Nội dung Bài tập

    Buổi 1 Data structures & Library telco data check & query, MAZE, Range Minimum Query, Largest black subrectangle
    Buổi 2 Backtracking & Branch and Bound Count solution to an integer linear equation, Balanced Courses Assignments, CBUS
    Buổi 3 Divide & Conquer; Greedy Disjoint Segments, Inversion, Max-Distance Sub-Sequence
    Buổi 4 Dynamic Programming Even Subsequence, Gold Mining, Warehouse, Nurse
    Buổi 5 Graph Bridges, Make Span Schedule, Bus Inter-City, Strongly Connected Components,

    You might also like