Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
To enjoy the facilities of Google Drive all you need is to have an email account with Google or have a Gmail account. Google Drive can also be accessed online through your Google account or simply set up a new account by using the Create Account link on the sign-in page. Given below are the best features offered by Google Drive that are too hard to miss.These are as followsBackup anything: The cloud storage service lets you store all your irreplaceable photos, files, and documents. In fact attachments from Gmail can be directly saved to the drive. One can backup up ... Read More
A new ShortBuffer with the content as a shared subsequence of the original ShortBuffer can be created using the method slice() in the class java.nio.ShortBuffer. This method returns the new ShortBuffer that is read-only if the original buffer is read-only and direct if the original buffer is direct.A program that demonstrates this is given as follows −Example Live Demoimport java.nio.*; import java.util.*; public class Demo { public static void main(String[] args) { int n = 5; try { ShortBuffer buffer1 = ShortBuffer.allocate(n); buffer1.put((short)25); ... Read More
We use a logic controller and it is used in industry for the process of control done by the software. Multiple inputs are typically accepted which performs a total complete sequence of operations carried out both arithmetic and logically. The outputs generated are used for the maintenance of the process within the specified desired limits. Visual display is provided by the state of process at any instant of time. The logic controller which interfaces and thus provides a buffered output of 12 lines and which is fed to the buffer inputs of 12 lines only specified for the user. The ... Read More
To create Quintet Tuple from an Array, use the fromArray() method.Let us first see what we need to work with JavaTuples. To work with Quintet class in JavaTuples, you need to import the following package −import org.javatuples.Quintet;Note − Steps to download and run JavaTuples program. If you are using Eclipse IDE to run Quintet Class in JavaTuples, then Right Click Project ->Properties ->Java Build Path ->Add External Jars and upload the downloaded JavaTuples jar file.The following is an example −Exampleimport org.javatuples.Quintet; public class Demo { public static void main(String[] args) { String[] strArr = { ... Read More
JDBC stands for Java Database Connectivity. It is a Java library/specification released by sun microsystems. It enables Java applications to communicate with databases.A JDBC driver is an implementation of the above-mentioned specification i.e. it contains the classes and interfaces to communicate with the database. Using JDBC driver and JDBC API you can write Java applications which will send a request to the database and retrieve the results.I.e. you can connect to the database, create SQL statements, Execute the SQL statements, access and modify the resultant tables using this library.Fundamentally, JDBC is a specification that provides a complete set of interfaces ... Read More
An immutable copy of a LocalDateTime with the month altered as required is done using the method withMonth() in the LocalDateTime class in Java. This method requires a single parameter i.e. the month that is to be set in the LocalDateTime and it returns the LocalDateTime with the month altered as required.A program that demonstrates this is given as follows −Example Live Demoimport java.time.*; public class Main { public static void main(String[] args) { LocalDateTime ldt1 = LocalDateTime.parse("2019-02-18T23:15:30"); System.out.println("The LocalDateTime is: " + ldt1); LocalDateTime ldt2 = ldt1.withMonth(7); ... Read More
The take() method of the ArrayBlockingQueue class fetch and removes the head of this queue, waiting if necessary until an element becomes available.The syntax is as followspublic E take() throws InterruptedExceptionTo work with ArrayBlockingQueue class, you need to import the following packageimport java.util.concurrent.ArrayBlockingQueue;The following is an example to implement take() method of Java ArrayBlockingQueue classExample Live Demoimport java.util.concurrent.ArrayBlockingQueue; public class Demo { public static void main(String[] args) throws InterruptedException { ArrayBlockingQueue q = new ArrayBlockingQueue(10); q.add(200); q.add(310); q.add(400); q.add(450); q.add(500); ... Read More
Before getting into the example, we should know what LinkedBlockingDeque is. It is implemented by Collection interface and the AbstractQueue class. It provides optional boundaries based on linked nodes. It going to pass memory size to a constructor and helps to provide memory wastage in android.This example demonstrates about How to use size() in android LinkedBlockingDequeStep 1 − Create a new project in Android Studio, go to File ⇒ New Project and fill all required details to create a new project.Step 2 − Add the following code to res/layout/activity_main.xml. In the above code, we have taken a ... Read More
To insert current date to the database, you can use NOW(). Following is the syntax −INSERT INTO yourTableName(yourDateColumnName) VALUES(NOW());If your column has datatype date then NOW() function inserts only current date, not time and MySQL will give a warning. To remove the warning, you can use CURDATE().Let us first create a table −mysql> create table insertcurrentdate -> ( -> Id int NOT NULL AUTO_INCREMENT PRIMARY KEY, -> currentDate date -> ); Query OK, 0 rows affected (1.09 sec)Following is the query to insert some records in the table using insert command. We have used both NOW() ... Read More
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 nodes.This is a C++ program to check if a given Binary Tree is an AVL Tree or not.AlgorithmBegin function AVL() returns true if the given tree is AVL otherwise false. if(root == NULL) return 1 leftheight = height(root->left) rightheight = height(root->right) if(abs(leftheight-rightheight) left) && AVL(root->right)) return 1 return 0 EndExample#include using namespace std; class nod { //node declaration public: int data; ... Read More