Define null values. 

In some cases a particular entity might not have an applicable value for an attribute or if we do not know the value of an attribute for a particular entity. In these cases null value is used.

 

Posted Date: 7/27/2013 6:48:32 AM | Location : United States

Ask an Expert

Related Discussions:- Define null values, Assignment Help, Ask Question on Define null values, Get Answer, Expert's Help, Define null values Discussions

Write discussion on Define null values
Your posts are moderated

Write your message here..

Related Questions

Polynomials - represented by using arrays, /* the program accepts two polyn... /* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

Frequency count, i:=1 while(i { x:=x+1; i:=i+1; } i:=1 while(i { x:=x+1; i:=i+1; }

Complete trees, This is a k-ary position tree wherein all levels are filled... This is a k-ary position tree wherein all levels are filled from left to right. There are a number of specialized trees. They are binary trees, AVL-trees, binary search trees, 2

How to measure the algorithm efficiency, How to measure the algorithm's eff... How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Prims algorithm, Prim's algorithm employs the concept of sets. Rather than ... Prim's algorithm employs the concept of sets. Rather than processing the graph by sorted order of edges, this algorithm processes the edges within the graph randomly by building up

Rotations in binary tree, H o w can you r ot a t e a B i n a r y... H o w can you r ot a t e a B i n a r y Tr e e? E x pl a i n r i g h t a n d l eft r ot a tion s by taking an e x a mpl e.   If after

Explain time complexity, Time Complexity, Big O notation The amount of ... Time Complexity, Big O notation The amount of time needed by an algorithm to run to its completion is referred as time complexity. The asymptotic running time of an algorithm i

What is an algorithm, What is an algorithm?  What are the characteristics o... What is an algorithm?  What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many

Logic circuits, the voltage wave forms are applied at the inputs of an EX-O... the voltage wave forms are applied at the inputs of an EX-OR gate. determine the output wave form

Convert graph into tree, How can we convert a graph into a tree ? Do we hav... How can we convert a graph into a tree ? Do we have any standardized algorithm for doing this?