YSC2229: Introductory Data Structures and Algorithms
  • 1. Software Prerequisites
  • 2. OCaml Style Guide
  • 3. Policies
  • 4. Midterm Project: Memory Allocation and Reclamation
  • 5. Final Project: Vroomba Programming
  • 1. Chapter 01: Introduction
  • 2. Chapter 02: Working with Arrays
  • 3. Chapter 03: Complexity of Algorithms and Order Notation
  • 4. Chapter 04: Divide-and-Conquer Algorithms
  • 5. Chapter 05: Binary Heaps and Priority Queues
  • 6. Chapter 06: Abstract Data Types
  • 7. Chapter 07: Hashing-Based Data Structures
  • 8. Chapter 08: Searching in Strings
  • 9. Chapter 09: Backtracking and Dynamic Programming
    • 9.1. Constraint Solving via Backtracking
    • 9.2. Optimisation Problems and Dynamic Programming
  • 10. Chapter 10: Data Encoding and Compression
  • 11. Chapter 11: Binary Search Trees
  • 12. Chapter 12: Graph Algorithms
  • 13. Chapter 13: Elements of Computational Geometry
YSC2229: Introductory Data Structures and Algorithms
  • »
  • 9. Chapter 09: Backtracking and Dynamic Programming

9. Chapter 09: Backtracking and Dynamic Programming

  • 9.1. Constraint Solving via Backtracking
    • 9.1.1. Constraint Solving by Backtracking
    • 9.1.2. Computing Solutions with Backtracking
    • 9.1.3. Examples of CSP solved by Backtracking
    • 9.1.4. N-Queens problem
  • 9.2. Optimisation Problems and Dynamic Programming
    • 9.2.1. Implementing Fibonacci numbers
    • 9.2.2. Knapsack Problem
    • 9.2.3. Determining the Maximal Price
    • 9.2.4. Solving Knapsack Problem via Dynamic Programming
    • 9.2.5. Restoring the Optimal List of Items
Previous Next

© Copyright 2021, Ilya Sergey.

Built with Sphinx using a theme provided by Read the Docs.