Quiz 3

BSCS4021

13 Internal Entities Declared
📄
421 - Greedy Algorithms
Access ->
📄
422 - Matroid Theory — Definition, Examples, Greedy Algorithm on Matroids
Access ->
📄
423 - Dynamic Programming
Access ->
📄
424 - Network Flow — Ford-Fulkerson, Max-Flow Min-Cut, Applications
Access ->
📄
425 - Applications of Network Flow
Access ->
📄
426 - String Algorithms — KMP, Rabin-Karp, and Pattern Matching
Access ->
📄
427 - NP-Completeness — P, NP, NP-Hard, Reductions
Access ->
📄
428 - Approximation Algorithms
Access ->
📄
429 - Randomized Algorithms
Access ->
📄
430 - Advanced Data Structures — Segment Trees, Fenwick Trees, Disjoint Sets
Access ->
📄
431 - Exact Algorithms — Branch & Bound, DP for TSP, Local Search
Access ->
📄
432 - Online and Parallel Algorithms
Access ->
📄
433 - Parameterized Algorithms
Access ->
Document outline

Keep your place and jump directly to a heading.

Table of contents

No note selected

Open a chapter to see its outline, backlinks, and sources here.

Open libraryCheckpoint desk