Manoj Debnath

In C++, sequence containers are a group of template classes used to store data elements. Because they are template classes, they can be used to store any data elements, including custom classes. The data structure they implement enables sequential access. There are five sequence containers offered by the C++ Standard Template Library. They are: array, […]

Introduction Multiple inheritance basically means a class derived from more than one base classes. This is an efficient class design to reuse the properties of multiple classes into a single composite class. The syntax in implementing one in the hierarchy of inheritance is quite simple. But, there are ambiguities and strange situations that may occur […]

Overview RTTI stands for Runtime type identification. It is a mechanism to find the type of an object dynamically from an available pointer or reference to the base type. This is particularly useful in a situation where we do not want to rely on the type identification by the virtual function mechanism. Most class libraries […]

The iostream classes are the first library classes we encounter when we begin with C++. The primary services that we deal with these classes is solving general I/O problems. After all, this is what the name apparently means. But the beauty is that it represents standard I/O, files, and even blocks of memory and they […]

Overview A string, at its core, simply means an array or characters terminated by a binary zero or null character as the final element in the array. The C-style of dealing with strings means every bit of it and therein lies the problem. Programmers need to be extra careful in dealing with character arrays for […]

Function Call Binding Binding a function necessarily means connecting the point of function invocation to its body. This binding can happen two ways: statically or dynamically. When the binding is done before the program actually executes, it is said to be early/statically bounded. This type of binding is done during compilation by the compiler and […]

Overview Serialization is a mechanism to convert an object into a sequence of bytes so that it can be stored in memory. The byte stream, once created, also can be streamed across a communication link to a remote receiving end. The reverse of serialization is called deserialization, where the data in the byte stream is […]

Overview The C++ Standard Library offers a host of implementations on common data structures and algorithms. The collection of container classes provides a set of data structure to store a list of objects as its element. The container classes are templatized to make it generic in the sense that it can store objects of any […]

Associative containers are those that provide direct access to its elements for storage and retrieval purposes. The elements are accessed via keys, also known as search keys. There are four ordered and four unordered associative containers in C++ such as multiset, set, multimap, map and unordered_multiset, unordered_set, unordered_multimap, and unordered_map, respectively. This article focuses on […]

The Standard C++ library offers a host of powerful, template-based components that implements data structure for common containers and iterators. It is vital for C++ programmers to know and use them for many reasons: one being they are time tested and part of the Standard Library and secondly because they are ready-made and can be […]

Overview A pointer is nothing but a variable that can hold an address of a memory location. The type of pointer is determined by the type of content it holds. This means that a pointer that is supposed to hold the address of an integer type variable must be declared as an integer type of […]

Overview In C++, dynamic memory allocation is done by using the new and delete operators. There is a similar feature in C using malloc(), calloc(), and deallocation using the free() functions. Note that these are functions. This means that they are supported by an external library. C++, however, imbibed the idea of dynamic memory allocation […]