Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles on Trending Technologies
Technical articles with clear explanations and examples
What is the full form of ITES?
What is ITES? ITES stands for Information Technology Enabled Services. There are different types of services that IT provides to different types of businesses and organizations. Some of these services include data processing, consulting, technical support, and many more. ITES can be used to fulfill different kinds of demands of an organization. here we will discuss some of the services provided by ITES. ITES Examples ITES has different types of examples and some of them are discussed here. BPO BPO stands for Business Process Outsourcing. The main job of BPOs is the outsourcing of different processes like customer service, accounts ...
Read MoreWhat is the full form of CPU?
What is CPU? CPU stands for Central Processing Unit. It is the most important part of a computer as it acts as a brain. CPU is a device in which all data processing is done in different parts. Communication can be established between input and output devices with the help of CPU. Besides data processing, the CPU also handles the tasks of input, output, and data storage. Installation of the CPU is done on sockets which are located on the motherboard. History of CPU Vacuum tubes were used in the earliest computers called ENIAC and UNIVAC. Vacuum tubes processed data ...
Read MoreWhat is the full form of CDFS?
What is CDFS? CDFS stands for Compact Disc File System. When CDFS was not introduced, there was no medium to store memories. Users were not able to store compressed large files CDFS was introduced in 1999 and has the following features − It is a file system which is used for read-only and write-once CD ROMs Boot images and all tracks can be easily stored on a CD In the write-once media, users can replace, delete, and rename files CD-ROM cache is controlled by the VCACHE driver and this will help users to play their playlists easily History ...
Read MoreWhat is the full form of VAT?
What is VAT? The full form of VAT is Value Added Tax. The tax is levied on goods and services that are related to each stage of the supply chain. Here the value is added from the point the production of a product is started to the point where the product is sold. VAT has to be paid on the basis of the cost of the product minus the cost of materials used to manufacture the product. VAT is paid on the basis of consumption of a product and not the income. VAT is being used in 160 countries and ...
Read MoreC++ code to count local extrema of given array
Extrema are such numbers which are either minima or maxima. In other words, it is a number or element which is either greater than or less than both of its adjacent values. Suppose we have an array A with n elements. An element of this array A[i] is called a local minimum if and only if it is strictly less than both of its neighbours. Also if it is strictly greater than its neighbours it will be local maximum. For A[0] and A[n-1] as there are only one neighbour they are not maxima or minima. We have to find the ...
Read MoreNumber of palindromic subsequences of length k where k <= 3
Palindromes are series of letters, numbers or characters which have same starting and ending point. Also, they are same when read from left to right and right to left. A subsequence of a string is a new string which is made by removing some of the characters from the original string without changing the relative order of the characters which are remaining. Suppose you are given a string of length N. You want to find palindromic subsequences of length K from the string. Note that value of K can be less than or equal to 3. In this article, we ...
Read MoreNumber of palindromic paths in a matrix
Palindromic pathways are very useful in solving various problems involving patterns and sequences. It can be used in finding correct path in a maze without reversing, palindromes in a sequence of letters, etc., It can also be used to identify symmetric patterns and structures. In this article, we will discuss about palindromic paths and ways to find such paths in a matrix using C++. Palindromes are series of letters, numbers or characters which have same starting and ending point. Also, they are same when read from left to right and right to left. A path in a matrix is a ...
Read MoreNumber of palindromic permutations
Permutations are possible in strings as well as numbers. A string can have permutations equal to the factorial of its number of characters. These permutations can be palindromic under certain circumstances. In this article, we will discuss about how palindromic permutations occur in a string. We will also find the number of palindromic permutations possible in a string using C++. Permutation is a mathematical process of rearranging the letters or characters from a specified string or words. In other words, it is rearrangement of objects or elements in an order. A palindrome is a set of character which are same ...
Read MoreNumber of ordered pairs such that Ai & Aj = 0
Suppose you are given an array and you have to find the total count of ordered pairs formed such that Ai & Aj = 0. You are given an array A[A1, A2, A3, …An]. You have to find ordered pairs of Ai and Aj such that their bitwise AND operation will give the result equal to 0. In other words, you have to count the pairs of elements (i, j) whose bitwise AND operation is zero. For example, we have an array [3, 4, 2]. The binary representation of each element are as follows − A1 = 3 = ...
Read MoreNumber of n digit stepping numbers - space optimized solution
In this article, we will learn about stepping numbers. We will find the possible number of n digit numbers which are also stepping numbers using several C++ techniques. We will also discuss about the most space optimized solution. Let’s first discuss about stepping numbers. These are such numbers which have adjacent digits in such a way that they all have a difference of 1. For example, 321- each of the adjacent digits (3, 2, 1) have a difference of 1 consecutively. Here, we will be given the value of N and then we have to find the count of all ...
Read More