Classic Computer Science Problems in Swift
id: 492233 not VIP
Open in MaM
By David Kopec
Language: English
Category: Ebook - Computer/Internet
Categories: Computer/Internet
Uploader: SuperManny
Uploaded At: 2019-02-08 19:32:50
[Request] Computers & Technology, Computer Science, Programming, Languages & Tools, Apple, Swift, Textbooks, Algorithms | 2018: Essential Techniques for Practicing Programmers
Description
Print Length: 224 pages
Publisher: Manning Publications; 1st edition
Publication Date: April 22, 2018
ISBN-13: 978-1617294891
ISBN-10: 1617294896
Request #1546867459.1578
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.
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.
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 written in Swift 4.1
Table of Contents
- Small problems
- Search problems
- Constraint-satisfaction problems
- Graph problems
- Genetic algorithms
- K-means clustering
- Fairly simple neural networks
- Miscellaneous problems