This mbrtowc() function is used to convert multibyte sequence to wide character string. This returns the length of the multibyte characters in byte. The syntax is like below. , The arguments are − wc is the pointer which points where the resulting wide character will be stored.s is the pointer to multibyte character string as inputmax is the maximum number of bytes in s, that can be e.....

In C or C++, we face different kinds of errors. These errors can be categorized into five different types. These are like below − Syntax ErrorRun-Time ErrorLinker ErrorLogical ErrorSemantic ErrorLet us see these errors one by one − This kind of errors are occurred, when it violates the rule of C++ writing techniques or syntaxes. This kind of errors are generally indicated by the.....

Here we shall discuss a C++ Program to find number of ways to Partition a word in such a way that each word is a Palindrome. , , ,

Kadane’s algorithm is used to find out the maximum subarray sum from an array of integers. Here we shall discuss a C++ program to implement this algorithm. , , ,

Based on linear algebra Hill cipher is a polygraphic substitution cipher in cryptography. To encrypt message: The key string and message string are represented as matrix form. They are multiplied then, against modulo 26. The key matrix should have inverse to decrypt the message. To decrypt message: The encrypted message is multiplied by inverse key matrix used for encryption against modulo .....

In this scheme, pairs of letters are encrypted, instead of single letters as in the case of simple substitution cipher. In playfair cipher, initially a key table is created. The key table is a 5×5 grid of alphabets that acts as the key for encrypting the plaintext. Each of the 25 alphabets must be unique and one letter of the alphabet (usually J) is omitted from the table as we need o.....

This is a C++ program to perform finite state automaton based search. An automaton with a finite number of states is called a Finite Automaton. Here, a text is given text[0 … t-1] and a pattern p[0 ... p-1] is also given. We have to find the pattern in the text and print its all occurrences at the respective indices. , , ,

This is a C++ program to check if a given set of three points lie on a single line or not. Three points lie on a single line if the area of the triangle formed by this points is equal to zero. The area of the triangle is − , , , ,

In this section, we shall consider a C++ program to find all forward edges in a graph. , , ,

It is a program to check possibility of construction of a graph in a given degree sequence. It takes the no of edges and vertexes. It shows the random values of a created graph. , , ,