Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
In the domain of machine learning or artificial intelligence models, data stands as the backbone. The way this data gets handled shapes the holistic performance of the model. This includes the indispensable task of segregating the dataset into learning and verification sets. While sklearn's train_test_split() is a frequently employed method, there could be instances when a Python aficionado might not have it at their disposal or is curious to grasp how to manually attain a similar outcome. This discourse delves into how one can segregate data into learning and verification sets without leaning on sklearn. We will bank on Python's ... Read More
It is sometimes necessary to insert a line break in Excel to show the entire string inside the cell because the texts are too long to fit inside a cell without spilling out the ends, which looks messy and unattractive. Representing the contents of the particular in various lines instead of one long line is known as "wrapping text". With the help of wrapping text, the users would be capable to eliminate the "truncated column" impact and enhance the readability of the text and printing compatibility. It also assures the users in managing a column that have constant value in ... Read More
Cell formatting is wonderful feature of Microsoft excel where cell value or text font size, type, color, background color may be formatted based on different criteria. In this, methods for format cell value font color based on a given condition have discussed. Here, a default color of cell value is changed in red color when value is negative and green color when cell value is positive. Further section presents, methods of cell value color formatting with suitable examples. Format cell value red if it is negative or green ... Read More
In this article, we are going to find the different ways to find the frequency of numbers present in an array []. These methods are very useful in doing competitive programming for different problems for different cases. Sometimes, calculating the frequency of elements whether it is numbers or alphabets presented in the array is a complicated task. Various algorithms like Searching, array, divide and conquer can be used to find the repeated elements defined in the array. Note- Take an integer array. Let's explore the article, to know how it can be solved by using Java programming ... Read More
The problem statement includes using Vantieghems theorem for primality test i.e. we will check for a positive number N which will be user input and print if the number is a prime number or not using the Vantieghems theorem. Vantieghem’s Theorem The Vantieghems theorem for primality states that a positive number, N is a prime number if the product of $\mathrm{2^{i}−1}$ where the value of i ranges from 1 to N−1 is congruent to N modulo $\mathrm{2^{N}−1}$ If both the values are congruent then the number N is a prime number else it is not a prime number. Congruent ... Read More
The problem statement includes finding the sum of range in a series of first odd numbers then even natural numbers up to N. The sequence consists of all the odd natural numbers from 1 to N and then all the even natural numbers from 2 to N, including N. The sequence will be of size N. We will be provided with a range in the problem for which we need to find out the sum of the sequence within that range, a and b i.e. [a, b]. Here a and b are included in the range. For example, we are ... Read More
The problem statement includes printing the sum of product of consecutive binomial coefficients for any positive number, N which will be the user input. The positive coefficients in the binomial expansion of any term are called binomial coefficients. These binomial coefficients can be found out using Pascal's triangle or a direct formula. The formula to calculate the binomial coefficient: $$\mathrm{^nC_{r}=\frac{n!}{(n-r)!r!}}$$ where, n and r can be any positive numbers and r should never be greater than n. Note : The value of 0! is always equal to 1. In this problem, we will be given a positive number N and ... Read More
The problem statement includes printing the sum of digits of N, which will be the user input, when written in different bases from 2 to N−1. In this problem, we will be provided any positive integer N and we need to represent that number in a different base numeral system from 2 to N−1 and find the sum of the digit of each different base numeral system. In the base−n numeral system, every digit of the representation of any number in that numeral system from right represents the number of times power of n from 0 to 31. For example, ... Read More
The problem statement includes printing the sum of bitwise OR of all possible subsets of a given set. A set is a collection of data of similar type. A subset of any set is a set containing few elements of the set or all the elements of the given set. The number of subsets of any set is given by $\mathrm{2^{n}−1}$, where n is the number of elements in the given set. For example, a={1, 2, 3, 4, 5} is the given set. {1}. {2, 3}, {1, 2, 3, 4} and so on are called subsets of a, as they ... Read More
The problem statement includes printing the sum of the series whose Nth term is given. The value of N will be given in the input. We need to find the sum of the sequence up to N where the Nth term of the sequence is given by: $$\mathrm{N^{2}−(N−1)^{2}}$$ Let’s understand the problem with the below examples: Input N=5 Output 25 Explanation − The value of N given is 5.The first 5 terms of the sequence are: $\mathrm{N=1, 1^{2}−(1−1)^{2}=1}$ $\mathrm{N=2, 2^{2}−(2−1)^{2}=3}$ $\mathrm{N=3, 3^{2}−(3−1)^{2}=5}$ $\mathrm{N=4, 4^{2}−(4−1)^{2}=7}$ $\mathrm{N=5, 5^{2}−(5−1)^{2}=9}$ The sum of the terms of the sequence until 5th ... Read More