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
Server Side Programming Articles
Page 1503 of 2109
C++ Program to Find Minimum Value of any Algebraic Expression
The algebraic expression is a combination of numbers, variables (x or y), and arithmetic operators like +, -, *, and /. In this article, we'll write a C++ program to find the minimum value of an expression in the form (x1 + x2 + x3 + . . . + xa) * (y1 + y2 + . . . + yb) where a total of a+b integers are given. Our task is to split these integers into two groups, one with a numbers and the other with b numbers, and calculate the product of their sums. By trying ...
Read MoreC++ Program to Find Maximum Value of any Algebraic Expression
The algebraic expression is a combination of numbers, variables (x or y), and arithmetic operators like +, -, *, and /. In this article, we'll write a C++ program to find the maximum value of an expression in the form (x1 + x2 + x3 + . . . + xa) * (y1 + y2 + . . . + yb) where a total of a+b integers are given. Our task is to split these integers into two groups, one with a numbers and the other with b numbers, and calculate the product of their sums. By ...
Read MoreData Type Ranges and their macros in C++
In some cases, especially in competitive programming, we may need to specify the minimum or maximum value of a specific datatype. In C++, each data type has a different memory range under which we can define and declare the value of that data type. But it becomes difficult to remember all the large ranges of each data type. So, C++ has introduced the macros that are used to represent the minimum and maximum range of some datatype. And some data types do not have macros for minimum values, because they are unsigned (means, hold only positive value). So, as their ...
Read MoreHow To Check Whether a Number Is a Fascinating Number or Not in Java?
What is Fascinating Numbers? A Fascinating number is a number if the result of concatenation of the (original) number with its multiples of 2 and 3 contains all the digits from 1 to 9. For example, we have the number 192. Its product with 2 is 384, and with 3 is 576. Now concatenate (don't add) these with the original number: "192" + "384" + "576" = "192384576", which contains all the digits from 1 to 9 exactly once. Here are some other fascinating numbers, suchas: 192, 1920, 2019, 327, etc. Note: For a number to be a fascinating number, ...
Read MoreHow To Check Whether a Number is a Evil Number or Not in Java?
What is Evil Number? In mathematical terms, an Evil number is a number whose binary representation has exactly an even number of 1's present in it. For example, the binary representation of 3 is 0011. So the number 1's is even the number 3 is an evil number. A binary number is a number expressed in the base-2 numeral system, it is also known as the binary numeral system. It is always represented using two digits: 0 and 1. Each digit (0, 1, 2, 3, ...), character (a, A, b, c, D, ...Z), and symbol (@, #, $, ...) used ...
Read MoreHow To Check Whether a Number Is a Bouncy Number or Not in Java?
What is Bouncy Number? In mathematical terms, a Bouncy number is a positive integer whose digits are neither in increasing nor in decreasing order. For example: 101, 102, 103, 104, 105, 106, 107, 108, 109, and 120 are the bouncy numbers, which digits does not follow any specific order. The bouncy number will always be unsorted, and there are no bouncy numbers between the range of 1 to 100 because numbers less than 100 can have only two digits that will be either increasing or decreasing order. Input & Output Scenarios The following input and output scenarios will implement the mathematical ...
Read MoreC++ Program to Implement Randomized Binary Search Tree
A Randomized Binary Search Tree (RBST) is a variation of a Binary Search Tree (BST) that contains randomization to maintain balance and improve efficiency. One common implementation of an RBST is a Treap, which combines BST properties with heap properties. Why We Use Random Binary Tree Random binary trees are used for analyzing the average-case complexity of data structure based on the binary trees. Features of RBST Following are the features of the randomized binary tree: BST Properties: The left subtree contains smaller value, right subtree contains larger value. Randomization: ...
Read MoreC++ Program to Implement self Balancing Binary Search Tree
Self Balancing Binary Search tree A self-balancing binary search tree (BST) is a height-balanced binary search tree that automatically keeps its height (the maximum number of levels below the root) as small as possible when insertion and deletion operations are performed on the tree. In the self-balancing binary search tree, the height is maintained in the order of O(logn), so that all operations take O(logn) time on average. Common examples of self-balancing binary search trees are: AVL Tree RED Black Tree Splay Tree AVL Tree An ...
Read MoreCan a C++ variable be both const and volatile?
Yes, In C++ both const and volatile keywords can be applied together in a variable. But it is used in situations like a read-only hardware register, or an output of another thread. In C++, they both are type qualifiers, which are used for different purposes in programming. In this article we will see the use of both keywords in C++. const Keyword The const keyword is used to declare the value of a variable as constant, meaning its value cannot be changed or modified later once initialized with const keyword. Example In this example PI value is set as constant ...
Read MoreWhat does the restrict keyword mean in C++?
There's no such keyword in C++. A list of C++ keywords can be found in section 2.11/1 of the C++ language standard. It is a keyword in the C99 version of the C language and not in C++. In C, A restrict qualified pointer (or reference) is basically a promise to the compiler that, within the scope of the pointer, the target of the pointer will only be accessed through that restrict qualified pointer (and pointers copied from it). C++ compilers also support this definition for optimization purposes, but it is not a part of the official language specification. ...
Read More