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 1493 of 2109
How To Find Volume of Dodecahedron in Java?
A dodecahedron is a three-dimensional shape that has twelve flat faces. It is derived from two Greek words, i.e., 'dodeka', which means 12, and 'hedra', which means face. In other words, a dodecahedron is a special type of polyhedron that has 12 faces. To make a dodecahedron, you can use the 12 pyramids and the base as a pentagon. Following diagram will provide a better understanding of its shape and edges: Where a is the length of the edge. Volume of Dodecahedron A dodecahedron volume refers to the amount of space occupied by this 3D shape, which has 12 faces. ...
Read MoreHow To Check Whether a Number is a Goldbach Number or Not in Java?
What is Goldbach Number? A number is said to be a Goldbach number if the number can be expressed as the addition of two odd prime number pairs. For example, let's consider the number 98 and find the pairs of prime numbers (19, 79). If you calculate the sum of 19 + 79, you get 98, so 98 is a Goldbach number. If we follow the above condition, then we can find that every even number larger than 4 is a Goldbach number because it must have any pair of odd prime number pairs. But the odd numbers are not satisfying because we know ...
Read MoreHow to Check Whether a Number is a Triangular Number or Not in Java?
A Triangular number of a natural number n, which is defined as the sum of all natural numbers starting from 1 to n. It is called triangular as we can represent it in the form of an equilateral triangular grid by using the total number of points where the row number equals the point number, which means in the 1st row 1 point, in the 2nd row 2 points, in the 3rd row 3 points, and so on. Examples of triangular numbers are 1, 3, 6, 10, 21, 55, etc. In simple terms, we can say a number is a ...
Read MoreHow To Check if a Given Point Lies Inside a Rectangle in Java?
A Rectangle is a closed two-dimensional shape that has 4 sides and 4 corners. The opposite sides are of the same length and parallel to each other. All 4 interior angles are equal, angles measure 90 degrees. It is a four-sided polygon. Following is the diagram of the Rectangle: Checking Points Inside Rectangle A point is said to lie inside a rectangle if its x and y coordinates are between the x and y coordinates of the opposite corners of the rectangle. To determine whether the point lies within the rectangle, we will use the following approaches: ...
Read MorePrint leading zeros with C++ output operator
Here we will see how to print leading zeros as output in C++. We know that if we directly put some zeros before some numeric values, then all zeros are discarded, and only exact numbers are printed.Printing Leading Zeros with C++ Output Operator We can manipulate the output sequence in C++ by utilizing the iomanip header. In this header, we have two manipulators, setw() and setfill(). The setw() function is used to create space between the previous text and the current text, and then we use setfill(char) to add characters to that field. Example of Printing Leading Zeros In this ...
Read MoreC++ Program to print the diamond shape
In this article, we will learn how to print a diamond shape with 2n rows and n columns for a given size n using C++. For example, if n = 4, the diamond shape will look like this: Algorithm to Print Diamond Shape To print the diamond shape, we can follow these steps: Take an integer input n from the user. To print upper half of the diamond, use a loop that runs from i = 1 to i
Read MoreC++ Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence
We are given an array of integers containing the degree of each vertex in a graph. Our task is to check if it is possible to construct a graph with the given degree sequence. Example: int degrees[] = {3, 2, 2, 0} Output: Not Possible Explanation: The first vertex has degree 3, which means it must be connected to three other vertices. But the last vertex has degree 0, meaning it cannot be connected to any other vertex. Hence, it is impossible to construct a graph with this degree sequence. To implement this in C++, we can ...
Read MoreMinimum removals to make array sum even in C++
In this article, we have an array arr[] of N integers. Our task is to write a program to find the minimum number of elements needed to be removed from the given array so that the sum of the remaining elements is even. Example The following example demonstrates the minimum number of elements we need to remove from the array for the sum to be even: Input: arr = {12, 23, 40, 53, 17} Output: 1 Input: arr = {20, 11, 13, 40, 24} Output: 0 The explanation of ...
Read MoreMinimum removals to make array sum odd in C++
In this article, we have an array arr[] of N integers. Our task is to write a program to find the minimum number of elements needed to be removed from the given array so that the sum of the remaining elements is odd. Example The following example demonstrates the minimum number of elements we need to remove from the array for the sum to be odd: Input: arr = {12, 23, 40, 53, 17} Output: 0 Input: arr = {20, 11, 13, 40, 24} Output: 1 The explanation of the above example is ...
Read MoreCount elements smaller than or equal to x in a sorted matrix in C++
In this article, we are given a matrix of size m x n and an integer variable X. The row elements and the first column of the matrix are sorted in increasing order. Our task is to count the number of elements that are equal to or less than the given X value. Counting Elements Smaller Than X in a Sorted MatrixHere are the approaches for counting elements smaller than X in a sorted matrix: Using Linear Search Using Staircase Search Using Linear ...
Read More