Book Image

The Modern C++ Challenger

By : Brent Arnold, Kristian Secor
Book Image

The Modern C++ Challenger

By: Brent Arnold, Kristian Secor

Overview of this book

C++ is one of the most widely-used programming languages and has applications in a variety of fields, such as gaming, GUI programming, and operating systems, to name a few. Through the years, C++ has evolved into one of the top choices for software developers worldwide. You’ll begin your challenge with various math problems, including Armstrong numbers. As you progress through the course, the complexity of the challenges will increase. You’ll write a class template that represents a two-dimensional array container. You’ll also write a program to find files in a directory that match a regular expression. While tackling algorithms and data structures, you’ll create buffers and print histograms. Things will get tougher when you’ll write code to implement a general-purpose parallel algorithm using asynchronous functions. Whether it is creating an EAN-13 barcode generator or encrypting and decrypting files, this course will put your skills to test and in turn teach you several new features of C++.

Related Content you might be interested in

Current Title:

Small book image
The Modern C++ Challenger
Brent Arnold | Kristian Secor
Mar, 2019 | 1 hours 53 minutes
No titles found
Table of Contents (10 chapters)
Free Chapter
1
Math Problems
Introduction
Level 1 - Problem 1
Level 1 - Problem 2
Level 1 - Problem 3
Level 1 - Problem 4
Level 1 - Problem 5
Conclusion
2
Language Features
Introduction
Level 2 - Problem 1
Level 2 - Problem 2
Level 2 - Problem 3
Level 2 - Problem 4
Level 2 - Problem 5
Conclusion
3
Streams and Filesystems
Introduction
Level 3 - Problem 1
Level 3 - Problem 2
Level 3 - Problem 3
Level 3 - Problem 4
Level 3 - Problem 5
Conclusion
4
Algorithms and Data Structures
Introduction
Level 4 - Problem 1
Level 4 - Problem 2
Level 4 - Problem 3
Level 4 - Problem 4
Level 4 - Problem 5
Conclusion
5
Concurrency
Introduction
Level 5 - Problem 1
Level 5 - Problem 2
Level 5 - Problem 3
Level 5 - Problem 4
Level 5 - Problem 5
Conclusion
6
Design Patterns
Introduction
Level 6 - Problem 1
Level 6 - Problem 2
Level 6 - Problem 3
Level 6 - Problem 4
Level 6 - Problem 5
Conclusion
7
Data Serialization
Introduction
Level 7 - Problem 1
Level 7 - Problem 2
Level 7 - Problem 3
Level 7 - Problem 4
Level 7 - Problem 5
Conclusion
8
Archives, Images & Databases
Introduction
Level 8 - Problem 1
Level 8 - Problem 2
Level 8 - Problem 3
Level 8 - Problem 4
Level 8 - Problem 5
Conclusion
9
Cryptography
Introduction
Level 9 - Problem 1
Level 9 - Problem 2
Level 9 - Problem 3
Level 9 - Problem 4
Level 9 - Problem 5
Conclusion
10
Networking and Cloud Services
Introduction
Level 10 - Problem 1
Level 10 - Problem 2
Level 10 - Problem 3
Level 10 - Problem 4
Level 10 - Problem 5
Conclusion
Chapter 4
Algorithms and Data Structures
Content Locked
Section 2
Level 4 - Problem 1
Write a data structure that represents a priority queue that provides constant time lookup for the largest element, but has logarithmic time complexity for adding and removing elements. A queue inserts new elements at the end and removes elements from the top. By default, the queue should use operator< to compare elements, but it should be possible for the user to provide a comparison function object that returns true if the first argument is less than the second. The implementation must provide at least the following operations: - push() to add a new element - pop() to remove the top element - top() to provide access to the top element - size() to indicate the number of elements in the queue - empty() to indicate whether the queue is empty
Previous Section
End of Section 2
Next Section