Understanding algorithms and data structures is fundamental to creating efficient software. In this course, Algorithms and Data Structures - Part 2, you’ll learn many algorithms and data structures used in software development. First, you’ll explore sorting and searching algorithms. Next, you’ll discover advanced data structures such as sets, heaps, balanced binary trees, B-Trees, and priority queues. Finally, you’ll learn how to safely use these algorithms and data structures in multi-threaded or concurrent programming environments. When you’re finished with this course, you’ll have the skills and knowledge of algorithms and data structures needed to successfully apply them in your own software development projects.
Robert spent nearly 10 years at Microsoft creating software that made it easier for everyone else to write software. Most recently Robert worked on Team Foundation Server on the Administration and Version Control teams. Currently Robert can be found working in the utilities sector on Smart Grid technologies.
Course Overview Hi everyone. My name is Robert Horvick, and welcome to my course, Algorithms and Data Structures ‑ Part 2. I'm a principal software engineer at Devlightful Software. This course is an overview of some of the common algorithms and data structures which are used in everything from video games to databases. Some of the major topics that we'll cover include sorting and searching algorithms, balanced binary search tree and the B‑tree data structure, heaps and priority queues, sets and set algorithms, concurrency‑safe collections. By the end of this course, you'll know what these algorithms and data structures are, how they work, and how they can be used in your applications. Before beginning this course, you should be familiar with the C# programming language or one with a similar syntax. I hope you'll join me on this journey to learn about these computer science fundamentals with the Algorithms and Data Structures ‑ Part 2 course, at Pluralsight.