Define null values, Data Structure & Algorithms

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







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
Related Questions
Complexity of an Algorithm An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorith

Merge sort is also one of the 'divide & conquer' classes of algorithms. The fundamental idea in it is to split the list in a number of sublists, sort each of these sublists & merge

Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

Explain about the String Abstract data type operations Symbol ADT has no concatenation operations, but presuming we have a full-featured String ADT, symbols can be concatenated

what is circular doubly link list?write down the algorithm for insertion of elements in circular doubly link list

Various graph traversal schemes Graph Traversal Scheme. In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do no

Determine the importance of array Arrays are significant since they allow many values to be stored in a single data structure whereas providing very fast access to each value.

lower triangular matrix and upper triangular matrix

Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Question

Assume a complete binary tree T with n nodes where each node has an item (value). Label the nodes of the complete binary tree T from top to bottom & from left to right 0, 1, ..., n