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
Articles by Rudradev Das
Page 5 of 6
Java vs C#
Java is a dynamic, secured and class based high level object oriented programming language developed by Oracle Corporation. On the other hand; C# is a .Net Framework object oriented programming language developed by Microsoft. Java and C# both are the general purpose programming paradigm or basically known as the imperative environment for coding. And these two languages are capable to provide some high level results as output. In a broad view there are many differences between these two OOPs − Java Runtime Environment designed to run a Java code where C# runs on CLR Environment (Common Language Runtime). Java ...
Read MoreJava Program to search ArrayList Element using Binary Search
Searching is a sorting process to find a particular information from a set of random elements. In a Linear Data structure, there are two types of searching process - Linear Search Binary Search Linear search is a simple searching method by which we can find an element from a data source in a sequential manner. For this searching process the best execution time is 1 and worse is always considered as n. Binary search is a searching process of a particular key element from a stock of multiple elements which follows divide and conquer approach. In this search ...
Read MoreDifference Between Homozygous and Heterozygous
Homozygous and heterozygous are terms used to describe the genetic makeup of an organism, specifically the alleles present in its genes. An allele is a version of a gene that controls a particular characteristic. For example, the gene for eye color has different alleles for blue, brown, green, and hazel eyes. What is Homozygous? When two identical alleles (recessive or dominant) of the same gene are present, the condition is called homozygous. Because there is no dominant allele to inhibit the expression of the gene in a homozygote person, the recessive features are phenotypically expressed in this case, providing Mendelian ...
Read MorePHP program to Count Inversions of size three in a given array
Inversion count is a step counting method by which we can calculate the number of sorting steps taken by a particular array. It is also capable to count the operation time span for an array. But, if we want to sort an array in a reverse manner, the count will be maximum number present in that array. Array: { 5, 4, 3, 2, 1} // for the reverse manner Pairs: {5, 4}, {5, 3} , {3, 2}, {3, 1}, {2, 1}, {4, 3}, {4, 2}, {4, 1}, }, {5, 2}, {5, 1} Output: 10 Array: {1, 2, 3, 4, ...
Read MoreLongest Subarray with GCD Greater than 1
An array is a collection of similar data sets which stored at adjacent memory locations in a continuous manner. It makes the process easier to evaluate the particular position of each and every element by defining an offset value to the particular base value of a database. The base value of that particular index is zero and an offset is a value of the difference of two particular indexes. A subarray is a section of a particular array which can be defined as a set of variables collectively with a label of multiple values. The longest subarray means in which ...
Read MoreJava Program to Find the GCDs of given index ranges in an array
In the field of data structure, a range query is a pre-processing method to operate on some input data in an efficient manner. A range query is responsible to answer any query of the particular input on any data subset. If we want to copy some data columns from a table we need to maintain an index for that particular dataset. An index is a direct link or a key, which is designed to provide an efficient searching process in a data set. It is mainly used to speed up the data retrieving from a lost data source. In mathematics, ...
Read MoreC++ Program to Find the GCDs of given index ranges in an array
In the field of data structure, a range query is a pre-processing method to operate on some input data in an efficient manner. A range query is responsible to answer any query of the particular input on any data subset. If we want to copy some data columns from a table we need to maintain an index for that particular dataset. An index is a direct link or a key, which is designed to provide an efficient searching process in a data set. It is mainly used to speed up the data retrieving from a lost data source. In mathematics, ...
Read MoreC++ Program to count of array elements greater than all elements on its left and at least K elements on its right
A string is an object, which represents a sequence of data characters. The strings are the data container which always represented as a text format. It also used to concept, compare, split, join, replace, trim, length, intern, equals, comparison, substring operation. K largest(or smallest) elements in an array using Quick Sort partitioning algorithm. Here is an array R[] with N number of distinct integers. The task is to find that particular element which are strictly greater than all the elements preceding it and strictly greater than at least K elements on its right. The problem states that an array ...
Read MoreApplications, Advantages and Disadvantages of Deque
Deque or double ended queue is a sequential linear collection data queue that provides the function like a double-ended queue. In this data structure the method does not follow the First In First Out (FIFO) rule for data treatment. This data structure is also known as double-ended queue because the elements are inserted to the end of the queue and removed from the front. For a deque we can add and remove data only from both ends. The time complexity of the deque operation is O(1). There are two types of deque − Input Restricted Restriction at a ...
Read MoreMaximize value of coins from adjacent row and columns cannot to be collected
Dynamic programming is an optimization algorithmic technique to solve the particular problems by splitting them into some simple sub problems. It is a procedure by which we can combine the quality, condition, or fact of a complete search for a greedy algorithm being exact and accurate. But this method is an oxymoron itself because it comes with a great advantage and that is also its biggest disadvantage and limitation too. We can divide a problem into some sub problem but we can't divide the sub problems again. They should be solvable by its own. The concept of the sub problems ...
Read More