What are stored and derived attributes, Data Structure & Algorithms

What are stored and derived attributes? 

Stored attributes: The attributes kept in a data base are called stored attributes. 

Derived attributes: The attributes that are derived from the kept attributes are known as derived attributes.  

 

Posted Date: 7/27/2013 6:47:03 AM | Location : United States







Related Discussions:- What are stored and derived attributes, Assignment Help, Ask Question on What are stored and derived attributes, Get Answer, Expert's Help, What are stored and derived attributes Discussions

Write discussion on What are stored and derived attributes
Your posts are moderated
Related Questions
Question 1 Explain the use of algorithms in computing Question 2 Explain time complexity and space complexity of an algorithm Question 3 Explain how you can analyz

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

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

Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.

What values are automatically assigned to those array elements which are not explicitly initialized? Garbage values are automatically assigned to those array elements that

What are the conditions under which sequential search of a list is preferred over binary search? Sequential Search is a preferred over binary search when the list is unordered

Merging two sequence using CREW merge

write an algorithm to insert an element at the beginning of a circular linked list?

What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

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