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 945 of 2109
C Program to convert first character uppercase in a sentence
Given a string with mixed case letters, the task is to convert the first character of each word to uppercase and the rest to lowercase. This creates a proper title case format where each word begins with a capital letter. For example, given the string "hElLo world", we need to convert the first character 'h' to uppercase 'H' and make all other characters lowercase except for the first character after spaces, which should also be uppercase. Syntax void convertToTitleCase(char str[], int n); Example Input and Output Input: str[] = {"heLlO wORLD"} Output: ...
Read MoreC Program to check if a date is valid or not
In C programming, validating a date requires checking multiple constraints including day, month, year ranges, leap years, and month-specific day limits. A valid date should range from 1/1/1800 to 31/12/9999. Syntax int datevalid(int day, int month, int year); int isleap(int year); Date Validation Constraints Date must be between 1 and 31 Month must be between 1 and 12 Year must be between 1800 and 9999 April, June, September, November have maximum 30 days February has 29 days in leap years, 28 days otherwise Example: Complete Date Validation This program implements ...
Read MoreC Program to check Strong Number
A Strong Number is a number whose sum of the factorials of its digits equals the original number. For example, 145 is a strong number because 1! + 4! + 5! = 1 + 24 + 120 = 145. Syntax int factorial(int digit); int isStrongNumber(int number); Algorithm Extract each digit from the number starting from the unit place Calculate the factorial of each digit Sum all the factorials Compare the sum with the original number Example Let's implement a C program to check if a number is a Strong Number ...
Read MoreC Program to check if matrix is singular or not
Given a matrix as mat[row][column], our task is to check whether the given matrix is singular or not through a function and display the result. A singular matrix is a matrix whose determinant is zero. If the determinant is not zero then the matrix is non-singular. So to find whether the matrix is singular or non-singular we need to calculate determinant first. For a 3x3 matrix, the determinant can be calculated as − $$M1[3][3]\:=\:\begin{bmatrix}a & b & c \d & e & f \g & h & i \end{bmatrix}$$ |m1| = a(e*i - f*h) - b(d*i ...
Read MoreProgram to compute Log n in C
In C programming, computing the logarithm base 2 of a number n can be achieved using recursive or iterative approaches. The logarithm function determines the power to which a base must be raised to obtain a given number. The mathematical relationship is: if logb x = y, then by = x For example: log2 64 = 6, because 26 = 64 Syntax unsigned int log2n(unsigned int num); Method 1: Using Recursive Approach This method uses recursion to divide the number by 2 until it becomes 1 or less − #include ...
Read MoreProducts of ranges in an array in C
The product of ranges in an array problem involves calculating the product of elements between given left (L) and right (R) indices under modulo P. This is useful in competitive programming to handle large products efficiently. Syntax int calculateProduct(int A[], int L, int R, int P); Parameters A[] − The input array of integers L − Left index (1-based) R − Right index (1-based) P − Prime modulo value Algorithm Step 1: Convert 1-based indices to 0-based (L-1, R-1) Step 2: Initialize result as 1 Step 3: ...
Read MoreC Program for diamond pattern with different layers
A diamond pattern in C is a symmetric arrangement of numbers that forms a diamond shape. The pattern starts with a single digit at the top, expands to show increasing sequences in the middle, and then contracts back to a single digit at the bottom. Syntax void print_pattern(int n); Approach The algorithm for creating a diamond pattern with n layers follows these steps − The pattern has (2 * n + 1) total rows First and last rows contain only "0" with proper spacing For rows 1 to n-1: numbers increase from ...
Read MoreC Program to add two fractions
Given with the input as fraction i.e. a/b and c/d where a, b, c and d can be any integer values other than 0 and the task is to add these two fraction to generate their final sum. Fractions are represented by − a / b, where a is known as numerator and b is known as denominator. a and b can have any numeric values but b can have any numeric value other than 0. Sum of two fractions is represented as a / b + c / d, and the rule for adding the two ...
Read MoreC program to calculate distance between two points
Given two points with coordinates, we need to calculate the distance between them. In a two-dimensional plane, if we have points A and B with coordinates (x1, y1) and (x2, y2) respectively, we can find the distance using the Euclidean distance formula. Syntax distance = sqrt((x2 - x1)² + (y2 - y1)²) Distance Formula The distance between two points is calculated using the formula − ...
Read MoreC program to calculate distance between three points in 3D
In C programming, calculating the distance between two points in 3D space is a common geometric problem. The distance between two points in three-dimensional space can be calculated using the Euclidean distance formula. Syntax distance = sqrt(pow(x2-x1, 2) + pow(y2-y1, 2) + pow(z2-z1, 2)); Where (x1, y1, z1) and (x2, y2, z2) are the coordinates of the two points in 3D space. Formula The mathematical formula for calculating distance between two points in 3D space is − Distance = √[(x2-x1)² + (y2-y1)² + (z2-z1)²] ...
Read More