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
Articles by Rudradev Das
Page 3 of 6
Primitive data type vs. Object data type in Java with Examples
In a Java environment, every variable contains with some data types, which specify the value and type of a sorted identifier. There are two categories − Primitive Data type Non-Primitive Data type or Object data type The primitive data types are some predefined data types with some specific size and type. This method has some standard values with the types know as byte, short, int, long, float, double, char and boolean. When we want to run a primitive structure, then it stores the data in a stack and assign a value for the process. On the other hand, ...
Read MoreJava Program to Sort 2D Array Across Columns
In the field of data structure, the vector is a growable class array of a particular object. The vector class falls in the legacy class which is fully compatible with the collections. In java.util package, the List interface can use all the methods listed here. Here is the initial capacity is 10 and the general method is: Vector v = new Vector(); The compare() method accepts two parameters and then compare each other by using Java environment logic. In this article today, we will learn about the sorting process of a 2D array set across the columns. Algorithm to ...
Read MoreGiven two numbers as strings, find if one is a power of other
Assume we have a data set of some numbers as a string and denoted as str[]. Now the task is to multiply the two large numbers which represents a string here. We need to find out from those two numbers as strings, find if one is a power of other. Here is a general example of the process − Input for the process us: a = "374747", b = "52627712618930723" Output : YES THE VALUE IS HERE Explanation of the process: 374747^3 = 52627712618930723 Input for the process is : a = "2", b = "4099" Output : NO ...
Read MorePalindrome by swapping only one character
In a C++ environment, the palindrome is a process where a set or string remains same from the intial stage of the process to termination of that same particular process. Assume, we have a string denoted as the str[]. And the task is to check the string will be paindrome or not after performing the swapping process with only one character for once. Here is a general example of the swapping process − Input : ARBRDD Output : true Explanation: Swap the value A(1st index present in the list) with the R. Input : INDBAN Output : true Explanation: ...
Read MorePrint reverse string after removing vowels
The reverse() is a pre-installed and predefined header file, which is used to define as a template in a process in a C++ environment. The method is able to reverse the elements from last to first manner in a range for any value container. For this process the time complexity is O(n). Lets assume, we have a string or a sentance declared as str[] with some data elements and now the task is to perform reverse process after removing the vowels from that string to get the final outcome. Here is some general examples of the process method − ...
Read MoreProgram to reverse a string (Iterative and Recursive)
The reverse() is a pre-installed and predefined header file, which is used to define as a template in a process in a C++ environment. The method is able to reverse the elements from last to first manner in a range for any value container. For this process the time complexity is O(n). Lets assume, we have a string declared as str[] with some data elements and now the task is to perform reverse process on this string to get the final outcome. Here is a general example of the process − Input string is here : S = "ARBRDD" ...
Read MoreCount palindromic characteristics of a String
In a C++ environment, the palindrome is a characteristics where we get the same value after getting the result. Assume, there is a string denoted as S and the length is N. Now we need to run an operation on that string to find the palindromic characteristic is the number of k-palindromes in a given range. Here is a general example of the process − Input for the process : abba Output by the process : 6 1 0 0 Explanation of the method: "6" 1-palindromes numbers operation = "a", "b", "b", "a", "bb", "abba". "1" 2-palindromes numbers operation ...
Read MoreDifference Between Hashtable and Synchronized Map in Java
A HashTable is a compact abstract data set which converts the keys of a map to the values by computing the indexes into an array of slots to enable faster data access. On the other hand, a synchronized map is a Java collection class which is mainly used to synchronize a particular map to make it a thread safe collection and can be applied on a whole object. The map does not contain any null value. Input [ ARB, RDD, KOL, DHKA ] Output Insertion Order of objects in HashTable : [ ARB, RDD, KOL, DHKA ] Insertion Order of objects in Synchronized Map : [ ...
Read MoreDifference Between IdentityHashMap, WeakHashMap, and EnumMap in Java
The IdentityHashMap is a special type of hash class by which we handle the rare cases related to the reference-equality. This map compares the keys by using a " = = " operator where the normal hashmap uses the " equals " method for this. A Weak HashMap is a type of map interface where the hash table merges its keys with the weak reference type of values. This type of map class can not be used further just because of the lack of reference pointers. An enum map is a special type of map class which contains only the ...
Read MoreDifference and similarities between HashSet , LinkedHashSet and TreeSet in Java
The HashSet, LinkedHashSet and TreeSet are the set interface class mainly used to store the elements. HashSet − A HashSet is a container instance which stores the unique elements only in a non synchronized manner to handle the high-performance operations involving with the set. The set allows the null values which does not follow the order of insertion. LinkedHashSet − The LinkedHashSet is a cloned data structure which have the both facilities of a hashtable and linked list as a set interface. The ordered version of a LinkedHashSet always works as a doubly linked list on over the input elements. TreeSet ...
Read More