Classic Computer Science Problems in Swift

0
868
Classic Computer Science Problems in Swift
Classic Computer Science Problems in Swift

Classic Computer Science Problems in Swift Summary

Classic Computer Science Problems in Swift invites readers to invest their energy in some foundational techniques that have been proven to stand the test of time. Along the way, they’ll learn intermediate and advanced features of the Swift programming language, a worthwhile skill in its own right.

Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications.

About the Technology

Don’t just learn another language. Become a better programmer instead. Today’s awesome iOS apps stand on the shoulders of classic algorithms, coding techniques, and engineering principles. Master these core skills in Swift, and you’ll be ready for AI, data-centric programming, machine learning, and the other development challenges that will define the next decade.

About the Book

Classic Computer Science Problems in Swift deepens your Swift language skills by exploring foundational coding techniques and algorithms. As you work through examples in search, clustering, graphs, and more, you’ll remember important things you’ve forgotten and discover classic solutions to your “new” problems. You’ll appreciate author David Kopec’s amazing ability to connect the core disciplines of computer science to the real-world concerns of apps, data, performance, and even nailing your next job interview!

What’s Inside

  • Breadth-first, depth-first, and A* search algorithms
  • Constraint-satisfaction problems
  • Solving problems with graph algorithms
  • Neural networks, genetic algorithms, and more
  • All examples are written in Swift 4.1

About the Reader

For readers comfortable with the basics of Swift.

About the Author

David Kopec is an assistant professor of computer science and innovation at Champlain College in Burlington, Vermont. He is an experienced iOS developer and the author of Dart for Absolute Beginners.

Table of Contents

  1. Small problems
  2. Search problems
  3. Constraint-satisfaction problems
  4. Graph problems
  5. Genetic algorithms
  6. K-means clustering
  7. Fairly simple neural networks
  8. Miscellaneous problems

You can also get this PDF by using our Android Mobile App directly:

LEAVE A REPLY

Please enter your comment!
Please enter your name here

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