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
Binary search tree. A binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following conditions: - All keys (if an

Hear is given a set of input representing the nodes of a binary tree, write a non recursive algorithm that must be able to give the output in three traversal orders. Write down an

Explain State Space Tree If it is convenient to execute backtracking by constructing a tree of choices being made, the tree is known as a state space tree. Its root indicates a

Q. Assume that we have separated n elements in to m sorted lists. Explain how to generate a single sorted list of all n elements in time O (n log m )?


#question.show that the following inequality is correct or incorrect. n!=O(n^n)

State the example of pre- and post-conditions Suppose that function f(x) should have a non-zero argument and return a positive value. We can document these pre- and post-condit

Demonstration of Polynomial using Linked List # include # include Struct link { Char sign; intcoef; int expo; struct link *next; }; Typedefstruct link

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 Qu

What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.