Search In
The mysqli_num_fields() function is used to display the number of fields in a result set. In other words, you can say that it returns the number of columns that is coming from a select query.
Syntax:
mysqli_num_fields(result);
In above syntax, th
TO_BASE64('string')
TO_BASE64 function in mysql is used for encode any string with the string encode rule BASE64. This function returns a encoded string.
This function is added with the mysql version 5.6.1
In mysql there is different base-64 encodi
Below is the code to read a text file from SD card.
First, we have to define path of the text file to a File.
Second step is to use BufferedReader class to read line by line.
File sdcard = Environment.getExternalStorageDirectory();
File readFile
CREATING VIEWS:
Views are virtual tables which are created from other tables .It is beneficial for those situation when we want to show limited columns to users. It can be created from one or more tables.
Syntax:
CREATE VIEW viewname AS SELECT col
Case Statement:
Case Statement is used to provide IF-ELSE functionality in a SQL query to fetch result. We provide multiple conditions and according to condition matches the value will change for that that column value.
Syntax:
SELECT CASE (colu
If we have two sorted linked list and we want to merge both in a new list without creating new node space then we can use recursive approach for this . This approach takes O(max(m,n)) time complexity for merging.
Like we have a linked list named : l
A linked list is type of data structure that contains items in linear order. Deleting an item from linked list performs O(n) time complexity. you can perform two type of deletion from linked list either you can delete first item of list or in any giv
There are two way to reverse a linked list that are using recursion or using iteration.
This operation takes O(n) time complexity during iteration method.
Here is the code to reverse linked list using iterator :
public void reverseLinkedList(Node
Deletion of item from double linked list st known position takes O(1) complexity while deletion at some specified position takes O(n) time complexity.
In deletion we basically removes the pointer of that item. First of all check the reference node v
Traverse and reverse a linked list takes time complexity of O(n).
Traverse a double linked list requires only node next reference until it reach to trail or null value :
public void traverseLinkedList(){
Node<T> tempNode = start;
w
