More than 3000 questions in repository. There are more than 900 unanswered questions. Click here and help us by providing the answer. Have a video suggestion. Click Correct / Improve and please let us know.
Ans. Relational Database uses linear search if we don't query using indices. Performance for linear search is O(n). If indices have been used , relational database uses binary search. Performance for binary search is O(Log n).
Casandra uses hash search. Performance for Hash Search is O(1).
Help us improve. Please let us know the company, where you were asked this question :
Ans. Normalization is the process of splitting one Table into multiple so as to avoid Data duplication whereas Denormalization is the process of reducing Tables that creates data duplication but would remove joins in the queries.
Help us improve. Please let us know the company, where you were asked this question :
Ans. We can have 2 entities i.e EMPLOYEE and ADDRESS and can have a relationship Table , EMPLOYEE_ADDRESS having one to may relationship between the two.
Help us improve. Please let us know the company, where you were asked this question :
Q861. Suppose we have a string "Java is object oriented language" and we have to reverse every alternate word in string. How would we do that using Java program.
Ans. public class BinarySearchTree {
//Represent the node of binary tree
public static class Node {
int data;
Node left;
Node right;
public Node(int data) {
//Assign data to the new node, set left and right children to null
this.data = data;
this.left = null;
this.right = null;
}
}
//Represent the root of binary tree
public Node root;
public BinarySearchTree() {
root = null;
}
//factorial() will calculate the factorial of given number
public int factorial(int num) {
int fact = 1;
if (num == 0) return 1;
else {
while (num > 1) {
fact = fact * num;
num--;
}
return fact;
}
}
//numOfBST() will calculate the total number of possible BST by calculating Catalan Number for given key
public int numOfBST(int key) {
int catalanNumber = factorial(2 * key) / (factorial(key 1) * factorial(key));
return catalanNumber;
}
public static void main(String[] args) {
BinarySearchTree bt = new BinarySearchTree();
//Display total number of possible binary search tree with key 5
System.out.println("Total number of possible Binary Search Trees with given key: "
bt.numOfBST(5));
}
}
Help us improve. Please let us know the company, where you were asked this question :
Ans. Dirty Checking is one of the features of hibernate. In dirty checking, hibernate automatically detects whether an object is modified (or) not and need to be updated. As long as the object is in persistent state i.e., bound to a particular Session, Hibernate monitors any changes to the objects and executes sql.
Help us improve. Please let us know the company, where you were asked this question :
Q867. What is read and write optimization in relation to databases ? Which database facilitates read optimization and which facilitates write optimization ?
Ans. Usually Relational Databases are optimized for writing. Some exception being usage of indices where indices needs to be updated after insertion and eventually helps with Log(n) reading time.
Help us improve. Please let us know the company, where you were asked this question :