Bøger af Jeremy Kubica

Enter the wonderful world of graph algorithms, where you’ll learn when and how to apply these highly useful data structures to solve a wide range of fascinating (and fantastical) computational problems.Graph Algorithms the Fun Way offers a refreshing approach to complex concepts by blending humor, imaginative examples, and practical Python implementations to reveal the power and versatility of graph based problem-solving in the real world. Through clear diagrams, engaging examples, and Python code, you’ll build a solid foundation for addressing graph problems in your own projects.Explore a rich landscape of cleverly constructed scenarios where:Hedge mazes illuminate depth-first searchUrban explorations demonstrate breadth-first searchIntricate labyrinths reveal bridges and articulation pointsStrategic planning illustrates bipartite matchingFrom fundamental graph structures to advanced topics, you will:Implement powerful algorithms, including Dijkstra’s, A*, and Floyd-WarshallTackle puzzles and optimize pathfinding with newfound confidenceUncover real-world applications in social networks  and transportation systemsDevelop robust intuition for when and why to apply specific graph techniquesDelve into topological sorting, minimum spanning trees, strongly connected components, and random walks. Confront challenges like graph coloring and the traveling salesperson problem.Prepare to view the world through the lens of graphs—where connections reveal insights and algorithms unlock new possibilities.

Have you ever thought that computer science should include more dragons and wizards? Computational Fairy Tales introduces principles of computational thinking, illustrating high-level computer science concepts, the motivation behind them, and their application in a non-computer-fairy tale-domain. The goal of this book is not to provide comprehensive coverage of each topic, but rather to provide a high level overview of the breadth and excitement of computer science. It's a quest that will take you from learning the basics of programming in a blacksmith's forge to fighting curses with recursion.Fifteen seers delivered the same prophecy, without so much as a single minstrel to lighten the mood: an unknown darkness threatens the kingdom. Suddenly, Princess Ann finds herself sent forth alone to save the kingdom. Leaving behind her home, family, and pet turtle Fido, Princess Ann must face goblin attacks, magical curses, arrogant scholars, an unpleasant oracle, and rude Boolean waiters. Along the way she must build a war chest of computational knowledge to survive the coming challenge.

A tale of programming and software best practices from the Computational Fairy Tales universe.In all his years as a wizard, Marcus has never seen a spell cause this much damage. When Hannaldous's sloppy attempt at a shield spell accidentally curses the castle, the walls start crumbling at an alarming rate. Now Marcus and his apprentice Shelly must figure out how to repair the damage before the castle turns to dust. Along the way they will encounter gossiping worms, perfectionist bakers, opportunistic rabbits, and copious amounts of mold.The Best Practices of Spell Design introduces practical aspects of software development that are often learned through painful experience. Through Marcus and Shelly's quest, the story encourages readers to think about how to write readable, well-tested and maintainable programs. Readers will discover the importance of comments in recipes, the value of testing potions, the dangers of poorly named ingredients, the wonders of code reviews in magic libraries, and the perils of premature optimization.

Learn how and when to use the right data structures in any situation, strengthening your computational thinking, problem-solving, and programming skills in the process.This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures — a critical component in any programming endeavor. You’ll learn how to work with more than 15 key data structures, from stacks, queues, and caches to bloom filters, skip lists, and graphs. You’ll also master linked lists by virtually standing in line at a cafe, hash tables by cataloging the history of the summer Olympics, and Quadtrees by neatly organizing your kitchen cabinets, all while becoming familiar with basic computer science concepts, like recursion and running time analysis.

A fantasy whodunit for the digital age that introduces the concepts behind search algorithms and important data structures, through the medium of a mystery novel.