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
Object Oriented Programming Articles
Page 273 of 588
Check if a Matrix is Identity Matrix or not in Java?
Matrices are nothing but it’s more than a collection of data elements arranged in a rectangular layout that is two-dimensional. In Java, an array with two dimensions can be considered as a matrix. Identity matrix is a square matrix which has all 1s as its principal diagonal elements and rest are 0s. As per the problem statement we have to0 check if the given matrix is Identity matrix or not. Let’s deep dive into this article, to know how it can be done by using Java programming language. To show you some instances Instance-1 Suppose we have a matrix ...
Read MoreFind Two Array Elements Having Maximum Sum in Java?
Two elements giving the maximum sum in an array means, we have to find two largest array elements which will eventually give the maximum sum possible. In this article we will see how we can find the maximum sum of two elements in Java. To show you some instances Instance-1 Suppose we have the below array [10, 2, 3, -5, 99, 12, 0, -1] In this array the largest element is 99 and second largest is 12. Max sum = 99 + 12 Hence the maximum sum of two elements in this array is 111. Instance-2 Suppose we have the ...
Read MoreFind Two Array Elements Having Maximum Product in Java?
Two elements giving the maximum product in an array means, we have to find two largest array elements which will eventually give the maximum product possible. In this article we will see how we can find the maximum product of two elements in Java. To show you some instances Instance-1 Suppose we have the below array [10, 2, 3, -5, 99, 12, 0, -1] In this array the largest element is 99 and second largest is 12. Max product = 99 * 12 Hence the maximum product of two elements in this array is 1188. Instance-2 Suppose we have the ...
Read MoreFind Scalar Multiplication of a Matrix in Java?
In Java, Array is an object. It is a non-primitive data type which stores values of similar data type. The matrix in java is nothing but a multi-dimensional array which represents multiple rows and columns. Scalar multiplication is nothing but multiplication between a matrix and a real number. The result of this multiplication is in matrix format. As per the problem statement, we have to find the scalar multiplication of a matrix. Let’s deep dive into this article, to know how it can be done by using Java programming language. To show you some instances Instance-1 Suppose the original matrix ...
Read MoreFind index of 0 or Any Negative Integer Element Present in Array in Java
As per the problem statement, we have given an array with some random integer values and we have to find out and print the index which contains any zero or negative values. Note - Take an integer array Let’s deep dive into this article, to know how it can be done by using Java programming language. To show you some instances Instance-1 Given Array= [1, 2, -3, -4, 0, 5] The index contains Zero and negative values = 2, 3, 4 Instance-2 Given Array= [-1, 0, 4, 6, 8, -5] The index contains Zero and negative values = 0, 1, ...
Read MoreFind Array Elements Which are Greater than its Left Elements in Java?
An array is a linear data structure in which elements are stored in contiguous memory locations. As per the problem statement, we have given an array with some random integer values and we have to find out the numbers which are greater than its all left elements by using Java programming language. Let’s start! To show you some instances Instance-1 Given Array= [1, 2, -3, -4, 0, 5]. The numbers which are greater than its all left elements = 2, 5 Instance-2 Given Array= [-1, 0, 4, 6, 8, -5]. The numbers which are greater than its all left ...
Read MoreFind Array Elements Which are Greater Than Its Immediate Left Element?
As per the problem statement, we have an array with some random integer values and we need to find out the numbers which are greater than its immediate left element. Note - Take an integer array. Let’s deep dive into this article, to know how it can be done by using Java programming language. To show you some instances Instance-1 Given Array= [1, 2, -3, -4, 0, 5]. The numbers which are greater than its left element = 2, 0, 5 Instance-2 Given Array= [-1, 0, 4, 6, 8, -5]. The numbers which are greater than its left element = ...
Read MoreFind All Possible Coordinates of a Parallelogram in Java?
A parallelogram refers to the quadrilateral which has two pairs of parallel sides where opposite sides are equal in length, and the opposite angles are equal in measure. In this article we are going to find all possible coordinates of a Parallelogram. Basically, we will find all the possible coordinates from the given three coordinates to make a parallelogram of a non-zero area. Here the three given coordinates are not fixed points and can change. Therefore, if three coordinates are given, we may claim that there are only three coordinates from which we can build a parallelogram. As per ...
Read MoreConvert All Lowercase Text of a File into Uppercase in Java?
In this article we are going to change all lower-case text to upper-case text in a file in java. Suppose the text file contains the following data − “Merry and Jack are studying.” Then after updating the text file with specific value the result will be − “MERRY AND JACK ARE STUDYING.” This modification is done with the help of toUpperCase() Method. It belongs to the String class in java. Let’s deep dive into this article, to know how it can be done by using Java programming language. To show you some instances Instance-1 Suppose the original content of the ...
Read MoreWhy can’t a Priority Queue wrap around like an ordinary Queue?
Introduction A queue is an abstract Data type that inserts elements from the Rear end and removes them from the Front end. There are three types of queues: Simple Queue, Priority Queue, and Circular Queue. In this tutorial, we understand why we cannot wrap around a Priority queue and the reasons for it. Priority Queue It is a unique queue that is not based on the FIFO principle for Queue operations. What makes it unique? It is the priority of its elements for removing or deQueue. Each element of the priority queue has some priority and they are removed based ...
Read More