Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Programming Articles - Page 2382 of 3366
4K+ Views
Given a string and with mixed case, i.e with both uppercase and lower case, the task is to covert the first character to uppercase rest in lowercase if it’s in upper case.Let’s understand it in depth with the help of a simple example.Like we are given a string “hElLo world”, we have to convert the first character ‘h’ which is in lowercase to uppercase ‘H’ and rest all letters before the space or end of the string to lowercase.Moreover when we encounter first character after a space we have to convert it to uppercase.ExampleInput: str[] = {“heLlO wORLD”} Output: Hello ... Read More
4K+ Views
Given date in format date, month and year in integer. The task is to find whether the date is possible on not.Valid date should range from 1/1/1800 – 31/12/9999 the dates beyond these are invalid.These dates would not only contains range of year but also all the constraints related to a calendar date.Constraints are −Date can’t be less than 1 and more than 31Month can’t be less than 1 and more than 12Year can’t be less than 1800 and more than 9999When the months are April, June, September, November the date can’t be more than 30.When the month is February ... Read More
7K+ Views
Given a number ‘n’ we have to check whether the number given is Strong Number or not.Strong number is a number whose sum of all digits’ factorial is equal to the number ‘n’. Factorial implies when we find the product of all the numbers below that number including that number and is denoted by ! (Exclamation sign), For example: 4! = 4x3x2x1 = 24.So, to find a number whether its strong number, we have to pick every digit of the number like the number is 145 then we have to pick 1, 4 and 5 now we will find factorial ... Read More
1K+ Views
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.Singular matrix is a matrix whose determinant is zero and 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. Determinant of a matrix 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 - f*g) + c(d*h - e*g)ExampleInput-: mat[3][3]= { 4, 10, ... Read More
541 Views
Given with the value of n as an input and the task is to compute the value of Log n through a function and display it.Logarithm or Log is the inverse function to exponentiation which means to calculate log the raised power must be calculated as a base.IF $$\log_b x\;\:=\: y\:than\:b^{y}=x$$Like $$\log_2 64\;\:=\: 6\:than\:2^{6}=64$$ExampleInput-: Log 20 Output-: 4 Input-: Log 64 Output-: 6AlgorithmStart In function unsigned int log2n(unsigned int num) Step 1-> Return (num > 1) ? 1 + log2n(num / 2) : 0 In function int main() Step 1-> Declare and assign num = 20 Print log2n(num) ... Read More
627 Views
Given with array, L, R, P as an input and the task is to find the ranges between L and R with the product under modulo as output and display itAs given in the figure we have array of elements and L which is a Left value as 2 and R which is the Right value as 2. Now the program must find the products of ranges between them.ExampleInput-: A[] = { 1, 2, 3, 4, 5, 6 } P = 29 L = 2 R = 6 Output-: 24 Input-: A[] = {1, 2, 3, 4, 5, 6}, ... Read More
311 Views
Given with the number and the task is to generate the diamond pattern with the given n different layers and display it.ExampleInput: n = 3Output:Approach used in the below program is as follows −Input the number of rowsAnd in this pattern there are ((2 * n) + 1) rowsNumber of spaces from 0 – n is (2 * (n – i))And the number of spaces from n+1 till end are ((i – n) * 2)AlgorithmStart Step 1-> declare a function to print a pattern void print_pattern(int n) declare variables as int i, j Loop For i = 1 i
3K+ Views
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 terms is that their denominator must be ... Read More
2K+ Views
The Jackson @JsonInclude annotation can be used to exclude the properties or fields of a class under certain conditions and it can be defined using the JsonInclude.Include enum. The JsonInclude.Include enum contains few constants like "ALWAYS", "NON_DEFAULT", "NON_EMPTY" and "NON_NULL" to determine whether to exclude the property(field) or not.Syntaxpublic static enum JsonInclude.Include extends EnumExampleimport com.fasterxml.jackson.annotation.*; import com.fasterxml.jackson.databind.*; import java.io.*; public class JsonIncludeTest { public static void main(String args[]) throws IOException { ObjectMapper objectMapper = new ObjectMapper(); Employee emp = new Employee(); String jsonString = objectMapper.writerWithDefaultPrettyPrinter().writeValueAsString(emp); System.out.println(jsonString); } } // Employee class ... Read More
4K+ Views
Given with ‘a’(first term), ‘d’(common difference) and ‘n’ (number of values in a string) and the task is to generate the series and thereby calculating their sum.What is an Arithmetic seriesArithmetic series is the sequence of numbers with common difference where the first term of a series is fixed which is ‘a’ and the common difference between them is ‘d’.It is represented as −a, a + d, a + 2d, a + 3d, . . .ExampleInput-: a = 1.5, d = 0.5, n=10 Output-: sum of series A.P is : 37.5 Input : a = 2.5, d = 1.5, n ... Read More