Articles on Trending Technologies

Technical articles with clear explanations and examples

How to change/increase the heap size of the Java Virtual Machine in Java?

Alshifa Hasnain
Alshifa Hasnain
Updated on 24-Apr-2025 2K+ Views

A Java program can execute in the Java Virtual Machine (JVM) and uses the heap memory to manage the data. If our Java program requires more memory, there is a possibility that the Java Virtual Machine(JVM) will begin to throw OutOfMemoryError instances when attempting to instantiate an object in Java. How to change/increase the JVM Heap Size? In Java, it is possible to increase the heap size allocated by the JVM: -Xms: Set an initial Java heap size JVM automatically manages the heap memory but we can ...

Read More

Can we change method signature in overriding in Java?

Maruthi Krishna
Maruthi Krishna
Updated on 24-Apr-2025 2K+ Views

No, you cannot change the method signature while overriding. Changing the method signature becomes method overloading, not overriding. Now, let's understand why - Method Signature In Java, a method signature consists of - Method name: It is used to call the method. Parameter list: It includes the number, type, and order of parameters. Note: The method signature does not include return type, ...

Read More

Difference between constants and final variables in Java?

Maruthi Krishna
Maruthi Krishna
Updated on 24-Apr-2025 13K+ Views

In Java, both constants and final variables are used to define variables that cannot be changed after initialization. But they have some differences. In this article, we will learn how they are different. Final Variable A final variable in Java means you cannot reassign it after it has been initialized. Whether it is a local variable, instance variable, or static variable, once it's assigned, the value cannot be changed. If you try to do so, a compile-time error will be generated. public class FinalExample { public static void main(String args[]) { ...

Read More

Kth largest Element in a 2D matrix where each row and column is sorted in C++

C++
AYUSH MISHRA
AYUSH MISHRA
Updated on 24-Apr-2025 948 Views

Finding the Kth largest element in a 2D matrix where each row and column is sorted is a common problem in computer science. This problem has many real-life applications, such as a ranking system, where we need to find the Kth highest score in a sorted dataset. In this article, we are going to discuss how we can find the Kth largest element in a 2D matrix e where each row and column is in sorted order in the C++ language. What is the Kth Largest Element? The Kth largest element refers to an element that is placed at ...

Read More

Remove Trailing Zeros from string in C++

Farhan Muhamed
Farhan Muhamed
Updated on 23-Apr-2025 4K+ Views

Trailing zeros are the zero occuring at the end of a string. In this article, we will discuss different approaches to remove trailing zeros from a string. The below section explains the problem statement. The input of this problem is a non-empty string containing characters and numbers. Our task is to remove all the zero's appering after the last non-zero character in the string. For example: // Input string "012424000" // Output String "012424" Remove Trailing Zeros From String Here is the list of approaches to remove all the trailing zeros from a string ...

Read More

Remove spaces from std::string in C++

Farhan Muhamed
Farhan Muhamed
Updated on 23-Apr-2025 18K+ Views

In this article, we will learn all the different approaches to remove the whitespaces from a standard string in C/C++. First of all, let's understand our problem statement. The input of this problem is a non-empty string containing multiple characters and whitespaces between those characters. Our task is to print the string by ignoring all the whitespaces into the output console. For example: // Input String "This is a string" // Output String "Thisisastring" Remove Whitespaces from a String in C++ Here is the list of approaches to remove all the whitespaces from a string using ...

Read More

Parsing a comma-delimited std::string in C++

Farhan Muhamed
Farhan Muhamed
Updated on 23-Apr-2025 9K+ Views

In this article, we will discuss all the approaches to parse a string delimited by comma using a C/C++ program. First of all, let's understand the problem statement. The input of this problem is a string containing multiple words that are seperated by commas. Our task is to print each word space seperated to the output console. For example: // Input String "Hello, World, From, 2025" // Output "Hello" "World" "From" "2025" Parse Comma Delimited String Here is the list of approaches to parse comma delimited string to words using c++ program, which we ...

Read More

Is Swing thread-safe in Java?

Alshifa Hasnain
Alshifa Hasnain
Updated on 23-Apr-2025 2K+ Views

No, Java Swing components are not thread-safe in Java. This means that whenever Swing components should be accessed or changed, it is done mostly by using a single thread, the EDT. Why Swing Components are not thread-safe One of the main reasons Java Swing is not thread-safe is to simplify the task of extending its components. Another reason for that Java Swing is not thread-safe due to the overhead involved in obtaining and releasing locks and restoring the state. Below are some methods given by Swing for safe operation with its UI: SwingUtilities.invokeLater(): In ...

Read More

C++ Program to Implement Euler Theorem

Ravi Ranjan
Ravi Ranjan
Updated on 23-Apr-2025 853 Views

Euler's theorem states that if two numbers (a and n), are co-prime i.e. gcd(a, n)=1, then 'a' raised to the power of Euler's totient function of n (a^φ(n)) is congruent to 1 modulo n i.e. a^φ(n) ≡ 1 (mod n). The Euler's Totient Function is denoted as φ(n) and represents the count of integers from 1 to n that are relatively co-prime to n. In this article, we have two co-prime integers. Our task is to implement the Euler Theorem in C++ using given co-prime numbers. Here is an example to verify the Euler Theorem for two co-prime numbers: ...

Read More

C++ Program to Implement Fermat’s Little Theorem

Ravi Ranjan
Ravi Ranjan
Updated on 23-Apr-2025 1K+ Views

Fermat's Little Theorem states that if p is a prime number and a is an integer not divisible by p, then a^(p-1) is congruent to 1 modulo p. It can be represented as a(p-1) ≡ 1 (mod p). It can also be said that if any integer a is raised to the (p-1) where p is a prime and gcd(a, p) =1, then a^(p-1)-1 is divisible by p. In this article, we have two integers i.e. 'a' and a prime number 'p' such that a is not divisible by p. Our task is to implement Fermat's Little theorem using these ...

Read More
Showing 31051–31060 of 61,297 articles
Advertisements