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

Branch and bound algorithm, Suppose we have a set of N agents and a set of ... Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

File organization, Define File organization''s and it''s types Define File organization''s and it''s types

Add the special form let to the metacircular interpreter, (1)  (i) Add the ... (1)  (i) Add the special form let to the metacircular interpreter Hint: remember let is just syntactic sugar for a lambda expression and so a rewrite to the lambda form is all t

Binary codes, what is alphanumerical code what is alphanumerical code

Structure of an avl tree, Given is the structure of an AVL tree: struct ... Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord

Algorithm for stack using array, write an algorithm for stack using array p... write an algorithm for stack using array performing the operations as insertion ,deletion , display,isempty,isfull.

Visual Basic Assignment, When writing a code for a program that basically a... When writing a code for a program that basically answers Relative Velocity questions how do you go at it? How many conditions should you go through?

Graph & optimal scheduling, You are given an undirected graph G = (V, E) in... You are given an undirected graph G = (V, E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1,2,...,W}, where W

Space and time complexity, why the space increase in less time programs why the space increase in less time programs

Objectives of lists, After going through this unit, you will be able to: ... After going through this unit, you will be able to: • define and declare Lists; • understand the terminology of Singly linked lists; • understand the terminology of Doubly