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
Programming Articles
Page 2513 of 2547
What are the main features of JDBC?
Following are the new features of JDBC:Makes JDBC calls: While using JDBC Java applications can make JDBC calls these calls submit SQL statements to the driver which in turn accesses the data from the database.Portability: JDBC provides wide level portability.Using JDBC you can request any type of queries from the database.You can use JDBC with different Java applications such like Java Applets, Java Servlets, Java Server Pages (JSPs). Enterprise JavaBeans (EJBs). To communicate with database.JDBC provides support for advanced datatypes such as BLOB, CLOB etc.Using JDBC you can set save points for database and layer you can rollback to desired ...
Read MoreC++ Program to Implement Disjoint Set Data Structure
Disjoint set is basically as group of sets where no item can be in more than one set. It supports union and find operation on subsets.Find(): It is used to find in which subset a particular element is in and returns the representative of that particular set.Union(): It merges two different subsets into a single subset and representative of one set becomes representative of other.Functions and pseudocodesBegin Assume k is the element makeset(k): k.parent = k. Find(x): If k.parent == k return k. else return Find(k.parent) Union ...
Read MoreC++ Program to Implement Coppersmith Freivald's Algorithm
Freivalds' algorithm determines whether the matrices are equal for a chosen k value with a probability of failure less than 2^-k in O(kn^2).It is used to verify matrix multiplication.AlgorithmBegin Take matrix1(n*n), matrix2(n*n), matrix3(n*n) as input. // According to the algorithm we have to verify: // matrix1 × matrix2 = matrix3. 1) Choose vector a[n][1] randomly and uniformly in which component will be 0 or 1. 2) Compute matrix2 * a, matrix3 * a and then matrix1 * (matrix2 * a) for evaluating the expression, matrix1 * (matrix2 * a) - matrix3 * a. 3) ...
Read MoreHow to connect to Derby database using a JDBC program?
Apache Derby is a Relational Database Management System which is fully based on (written/implemented in) Java programming language. It is an open source database developed by Apache Software Foundation.Installing derby:Follow the steps given below to install derby:Visit the home page of Apache Derby home page https://db.apache.org/derby/. Click the Download tab.Select and click on the link of the latest version of Apache Derby.On clicking the selected link, you will be redirected to the Distributions page of apache derby. If you observe here, derby provides distributions namely, db-derby-bin, db-derbylib.zip, db-derby-lib-debug.zip, and db-derby-src.zip.Download the db-derby-bin folder. Copy its contents to a separate folder ...
Read MoreC++ Program to Implement Gauss Jordan Elimination
This is a C++ Program to Implement Gauss Jordan Elimination. It is used to analyze linear system of simultaneous equations. It is mainly focused on reducing the system of equations to a diagonal matrix form by row operations such that the solution is obtained directly.AlgorithmBegin n = size of the input matrix To find the elements of the diagonal matrix: Make nested for loops j = 0 to n and i = 0 to n The element in the first row and the first column is made 1 and then the ...
Read MoreC++ Program to Implement Gauss Seidel Method
Gauss Seidel method is used to solve linear system of equations in iterative method. This is a C++ Program to Implement Gauss Seidel Method.AlgorithmBegin Take the dimensions of the matrix p and its elements as input. Take the initials values of x and no of iteration q as input. While q>0 Make a for loop i = 0 to p-1 initialize n[i] = (b[i] / a[i][i]). Make a for loop i = 0 to p-1 If (j == ...
Read MoreAdd a value to Unit Tuple in Java
The addAtX() method is used to add value to the Tuple. The index can be set here with the X i.e. the place where the value gets added.Let us first see what we need to work with JavaTuples. To work with the Unit class in JavaTuples, you need to import the following package −import org.javatuples.Unit;Here, we have also used the Pair class, therefore import the following package also −import org.javatuples.Pair;Note − Steps to download and run JavaTuples program If you are using Eclipse IDE to run Unit Class in Java Tuples, then Right Click Project → Properties → Java Build ...
Read MoreExplain the architecture of JDBC?
If you want to develop a Java application that communicates with a database, you should use JDBC API. A driver is the implementation of the said API; various vendors provide various drivers, you need to use a suitable driver with respect to the database you need to communicate with. The driver manager loads the driver and manages the driver.Following are the components of JDBC:JDBC DriverManager: The DriverManager class of the java.sql package manages different types of JDBC drivers. This class loads the driver classes. In addition to this whenever a new connection establishes it chooses and loads the suitable driver ...
Read MoreC++ Program to Represent Linear Equations in Matrix Form
This is a C++ program to represent Linear Equations in matrix form.AlgorithmBegin 1) Take the no of variables n and the coefficients of each variable as input. 2) Declare a matrix[n][n] and constant[n][1]. 3) Make for loops i = 0 to n-1 and j = 0 to n-1 to take the coefficients of each variable as the elements of the matrix. 4) Display the matrix by using nested for loops. EndExample#include using namespace std; int main(void) { char variable[] = { 'x', 'y', 'z', 'd' }; cout > n; cout > matrix[i][j]; } cin >> constant[i][0]; } cout
Read MoreC++ Program to Print the Kind of Rotation the AVL Tree is Undergoing When you Add an Element or Delete an Element
AVL tree is a self-balancing Binary Search Tree where the difference between heights of left and right subtrees cannot be more than one for all nodesTree rotation is an operation that changes the structure without interfering with the order of the elements on an AVL tree. It moves one node up in the tree and one node down. It is used to change the shape of the tree, and to decrease its height by moving smaller subtrees down and larger subtrees up, resulting in improved performance of many tree operations. The direction of a rotation depends on the side which ...
Read More