Data Structures and Advanced Algorithms

When inexperienced programmers look for resources to learn more about programming, they often become overwhelmed by the complicated computer science jargon thrown at them from books, articles, blogs, etc. This can be frustrating for someone who is just a beginner because in order to learn something new, they are often expected to somehow understand the jargon. This is why high school students Shivana Anand, Emily Beck, Hang Cao, Joshua Culmer, and Emma Wood decided to write “Data Structures and Advanced Algorithms,” a guide to the principles of object-oriented programming, data structures, and advanced algorithms. Written using language that anyone – even inexperienced programmers – can understand, the book breaks down difficult computer science topics with diagrams and pictures.

“Data Structures and Advanced Algorithms” consists of 7 chapters: Object-Oriented Programming, Recursion, Data Structures (Arrays, Linked Lists, Stack, Queue, Priority Queue), Sorting (Bubble Sort, Quick Sort), Searching (Linear Search, Binary Search), Real-Time Operating Systems (Earliest Deadline First, First Come First Serve, Round Robin), and Artificial Intelligence (Shortest Path, Minimax, Minimax with Alpha-Beta Pruning). The book is written so that it is entirely beginner-friendly, but it contains material that benefits even the most advanced programmers because it delves deeper into topics that advanced programmers might already be familiar with. For demonstrative purposes, the book provides samples of code written in Java.