Book Image

The C++ Workshop

By : Dale Green, Kurt Guntheroth, Shaun Ross Mitchell
Book Image

The C++ Workshop

By: Dale Green, Kurt Guntheroth, Shaun Ross Mitchell

Overview of this book

C++ is the backbone of many games, GUI-based applications, and operating systems. Learning C++ effectively is more than a matter of simply reading through theory, as the real challenge is understanding the fundamentals in depth and being able to use them in the real world. If you're looking to learn C++ programming efficiently, this Workshop is a comprehensive guide that covers all the core features of C++ and how to apply them. It will help you take the next big step toward writing efficient, reliable C++ programs. The C++ Workshop begins by explaining the basic structure of a C++ application, showing you how to write and run your first program to understand data types, operators, variables and the flow of control structures. You'll also see how to make smarter decisions when it comes to using storage space by declaring dynamic variables during program runtime. Moving ahead, you'll use object-oriented programming (OOP) techniques such as inheritance, polymorphism, and class hierarchies to make your code structure organized and efficient. Finally, you'll use the C++ standard library?s built-in functions and templates to speed up different programming tasks. By the end of this C++ book, you will have the knowledge and skills to confidently tackle your own ambitious projects and advance your career as a C++ developer.
Table of Contents (15 chapters)


Queues are a type of container with a first-in-first-out behavior. Conversely, a stack is a container with a last-in-first-out behavior. When adding elements to a queue, they are added to the end of the queue, and elements will be popped or peeked from the front. When adding elements to a stack, we can think of them as being added to the top, and then elements will also be popped or peeked from the top. This is the difference between first-in-first-out and last-in-first-out. Both of these containers are very useful when elements need to be retrieved and removed in a particular order; the end-of-chapter activity will utilize a queue to handle going through elements in a defined order.


When constructing a queue, we can also decide what the underlying container for that queue will be. The same applies to a stack. If we do not choose a container type for ourselves then, by default, std::deque will be used.

The template declaration of a queue and...