Advanced C++ Programming Training Course

Leverage virtual functions to enable runtime polymorphism and correct behavior for base and derived objects. See how a vector of employee pointers calls the right pay function, highlighting dynamic dispatch.

Demonstrate polymorphism by creating an abstract animal class with a pure virtual talk function implemented by dog and cat classes. The compiler calls the correct talk method for each object.

Explore generic programming in c++, showing how templates enable a single display function for arrays of different types, avoiding duplicate code and enabling runtime data type flexibility.

Learn to implement generic functions with templates, using a type placeholder T to handle any data type with a single display or max function.

This exercise demonstrates exception handling with file input/output by showing what happens when opening a non-existent file and how a try-catch block gracefully handles the error.

Explore the varied C++ stream I/O types, define streams as byte sequences, and learn to work with cout, cerr, ifstream, and ofstream across libraries.

Master console input in c++ using cin and getline to handle single-word and multiword input, then explore character input with get and eof handling.

Explore string streams in c++ to concatenate strings with numeric data using a stringstream object, convert to a string, and format a person’s name and age.

Explore using the C++ list container to add, remove, and display values with a custom display function and iterators, including push_front, pop_front, pop_back, size, clear, and empty checks.

Explore the deck, a double-ended queue, and its push front and push back operations. Practice removing with pop front and pop back, accessing by index, and looping to display size.

Implement a void function insertMax for a list of integers that inserts only if the value exceeds the current max, using sorting and a test program with input and display.

Explore the map associative container by storing a phone number list with names as keys and numbers as values, then add, retrieve, erase, and check size of key value pairs.

Master using maps in C++, finding a grade by key with iterators, checking for end, and iterating from begin to end to compute the average grade.

Learn how the set container stores unique keys, prevents duplicates, and sorts items automatically; use insert and an iterator to display words entered by the user.

Explore how multimap handles duplicate keys alongside maps, learn to insert pairs, and retrieve all occurrences using find, upper_bound, and iterators with example Jones entries.

This exercise implements a set-based prime generator that iterates from 2 to your upper bound, erases multiples to leave primes, and prints them in readable lines.

Explore read write algorithms that modify containers: use fill to set a range to a value and replace to swap one value for another, demonstrated on number and string vectors.

Explore generic algorithms by filling a 10-element vector with random numbers using generate, then compute the sum with accumulate. Using this approach makes code shorter, clearer, and less error-prone.

Implement a queue class in C++ by tracking front and back, supporting in and out operations, with a shift helper and a show method for testing.

Build a linked list class with a head pointer and a node class with set next, enabling appending new nodes at the end and deleting nodes by data.

The exercise demonstrates converting a base 10 number to base 2 using a stack, pushing, popping, peeking, and clearing integers to form the binary result.

Utilize two queues in c++ to simulate a square dance by pairing the first available man and woman from a data file, reporting partners and remaining waiters.

Learn how to implement selection sort in C++ by locating the smallest element, swapping it into place, and displaying the array during the process.

Learn to sort data with merge sort in C++, splitting an array, sorting halves, and merging with a temporary array. Explore the recursive merge sort function and its merge phase.