Classic Computer Science Problems in Python

This is a pragmatic useful book on python, authored by David Kopec, the topics touched on through the problems are listed below, and the source code is on github: https://github.com/davecom/ClassicComputerScienceProblemsInPython

  • Essential Techniques
    • Recursion
    • Memorization
    • Bit Manipulation
    • Dynamic Programming
    • Permutation Generation
  • Search Algorithms
    • Binary Search
    • Breadth-First Search
    • Depth-First Search
    • A*
  • Constraint Satisfaction Problems
  • Solving Graph Problems
    • Representing Graphs using Hybrid Adjacency Lists
    • Search in Graphs
    • Finding shortest paths with Dijkstra’s Algorithm
    • Finding the minimum-spanning tree with Jarnik’s Algorithm (Prim’s Algorithm)
  • Genetic Algorithms
  • K-means Clustering
  • Neural Networks
  • Adversarial Search
    • Minimax
    • Alpha beta pruning (Python book only)

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.