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 1527 of 2109
What is memory-mapped file in Java?
Memory mapping is a technique in Java that gives direct access to files through memory (RAM). A memory-mapped file connects disk content straight to RAM, which lets Java applications handle files as memory segments. This makes files to be treated as a large array and is much faster than regular file operations like read() or write(). This requires fewer system calls and makes file operations faster even for very large files. The java.nio package helps us to implement memory-mapped file operations. This package contains the MappedByteBuffer class, which enables efficient file reading and writing from memory. Use cases of memory-mapped ...
Read MoreXylem and Phloem Number in Java
A number is a Xylem number if the sum of extreme digits (first and last) equals the sum of its mean digits (all digits except first and last). If the sum of the extreme digits does not match the sum of the mean digits, then it is a Phloem number. We can understand it with the help of examples − Example 1 Take the number 12326: Sum of its extremes is 1+6=7. The sum of its mean digits is 2+3+2=7. Sum of extremes = Sum of mean digits, so it is a xylem number. Example 2 The number is ...
Read MorePrint the season name of the year based on the month number in java
In this article, we will explore different methods to find the season name from the month number in Java. When the user inputs the month number, the output should be the season by the name associated with the month. If the user enters 1 as the month number, the month is January, so the output will be Winter. Given below is the season classification by months Winter: December (12), January (1), February (2) Spring: March (3), April (4), May (5) Summer: June (6), July (7), August (8) Autumn: September (9), October (10), November (11) We can achieve this using several ...
Read MoreGiuga Number in Java
In this article, we will learn about Giuga Numbers and how to write a code to check if a number is a Giuga Number or not in Java. A Giuga number is a composite number N such that for each prime factor p of N, (N/p)-1 is divisible by p. The first Giuga numbers are 30, 858, 1722, 66198, 2214408306, 24423128562, and 432749205173838. Example Lets take N=30. 30 is a composite number, and its prime factors are 2, 3, and 5. ● For p=2: (N/p)-1 to be divisible by p. N is 30, and p here is 2. (30/2)-1=14, ...
Read MoreDuodecimal in java
The duodecimal number system is also known as the base-12 number system. The decimal system (base-12) uses digits 0-9, while the duodecimal system uses digits 0-9 along with two additional symbols, A and B. In duodecimal, 10 represents 12 , which means 12 in the decimal number system is 10 in the duodecimal system. We often encounter duodecimal in daily life; for example, we have 12 months in a year, 12 zodiac signs, 12 inches in a foot, 12 musical notes in an octave, and we call a group of 12 items a dozen. Representation of duodecimal numbers The duodecimal ...
Read MoreDifference Between JDK and BlueJ
JDK (Java Development Kit) is a software development kit that contains all the necessary tools and components that are essential to develop a Java application. Whereas BlueJ is an IDE that will make the process of developing a Java application a lot easier. BlueJ requires JDK installed on the system to work with Java applications. Java Development Kit (JDK) The Java Development Kit (JDK) contains all the essential libraries, tools, and all other important things to work with Java. You can’t do programming in Java without JDK. The modern IDEs, like "IntelliJ IDEA" will already be equipped with Java essential ...
Read MoreChecking if Two Words Are Present in a String in Java
In this article, we will learn how to check if two given words are present in a string. This is useful when you need to check for multiple words in the text for different purposes, like searching, filtering, or text analysis. We will explore different approaches on how to implement it in Java, starting from the simple method to more advanced techniques. Example Scenario Consider this string: "Java provides powerful libraries for developers." We want to check if both "java" and "libraries" appear in the text. In this case, the output will be true. 1.Using contains() The contains() method checks ...
Read MoreWhat is the difference between re.match(), re.search() and re.findall() methods in Python?
Python's re module is useful while working with Regular Expressions, allowing us to search, match and manipulate strings by following specific patterns. re.match(): Checks if a given pattern matches at the beginning of a string. If a match is found, it returns a match object. re.search(): Scans the entire string for the first occurrence of the specified pattern. If it finds a match, it returns a match object. re.findall(): Finds all occurrences of a pattern within the string and returns them as a list. The re.match() ...
Read MoreJava Program to Find Two Elements Whose Sum is Closest to Zero
In this article we will learn how to find the two elements in an array whose sum is closest to zero. The array can contain both positive and negative values as well. Let's understand with the help of an example. Example Let's take an array with the following elements − arr = {3, -56, -76, -32, 45, 77, -14, 13, 92, 37} Here, two elements whose sum is closest to zero are 77 and -76, and their sum is 1. Note: In this example we have 77 and -76, which will give the sum as 1, and also ...
Read MoreLength of the longest consecutive zeroes in the binary representation of a number in java
You are given a number (N); you need to find the length of the longest consecutive zeroes in the binary representation of the number using different approaches. Example Input N = 529 The binary form of 529 is 1000010001. Output The longest chain of zeroes in the binary form is 0000 with a length of 4. Hence, the answer is 4. Approach 1: Using Division and Modulus In this approach we use division and modulus operations to convert decimal to binary and then count the maximum zeroes in the binary number. Steps for implementation The following steps explain ...
Read More