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
Preorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; };   preorder(struct N

How can a lock object be called in the transaction? By calling Enqueue and Dequeue in the transaction.

Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Exact analysis of insertion sort: Let us assume the following pseudocode to analyse the exact runtime complexity of insertion sort. T j   is the time taken to execute the s

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 algorithm depends upon following cons

What are the properties of an algorithsm?


Using Assertions When writing code, programmer must state pre- and subtle post conditions for public operations, state class invariants and insert unreachable code assertions a

Q. Write down an algorithm to delete the specific node from binary search tree. Trace the algorithm to delete a node (10) from the following given tree. Ans. Algor