B/16, First floor, Sant Tukaram Vyapar Sankul

Nigdi, Pune - 411044

8:30 AM - 7:00 PM

Monday to Saturday

Advance CPP

• What are templates,
• Basic syntax,
• Function templates,
• Class templates,
• When to use templates,
• Typical problems when using templates.

• Types of sequential containers
o vector, deque, list and their API,
• Sequential container adapters
o stack, queue and priority queue,
• Dealing with objects as container elements,
• Usage – when to use what.

• Types of associative containers,
• set and multiset – behaviour and API,
• map and multimap – behaviour and API,
• Putting objects into set and map,
• Usage – when to use what.

• Definition of a non-modifying algorithm
• List of non-modifying algorithms:
o for_each,
o find, find_if, find_end, find_first_of, adjacent_find,
o count, count_if,
o mismatch, equal, search, search_n,
• Container compatibility.

• Definition of a modifying algorithm,
• List of modifying algorithms:
o transform, copy, copy_backward,
o swap, swap_ranges, iter_swap,
o replace,
o fill, fill_n, generate, generate_n,
o remove, remove_if,
o unique, unique_copy, reverse, reverse_copy,
o rotate, partition, stable_partition
o Container compatibility.

• List of sorting algorithms:
o random_shuffle, sort, stable_partition,
o lower_bound, upper_bound, equal_range, binary_search,
• Containers compatibility,
• Sorting of objects.

• List of merging algorithms:
o merge, includes, min_element, max_element, inplace_merge,
• STL operations for sets,.

• STL “small” tools,
• List of useful functors,

• Classes which provide the input and output capability,
• Console I/O,
• Formatting,
• File I/O,
• Strings I/O,

Course Enquiry Form





In Which Course you are interested :

Your Name

Your Email

Your Contact No

Tell us more