Quantity amounts (data type quan), Computer Engineering

Assignment Help:

A field containing quantity amounts (data type QUAN) must be assigned to a reference table and a reference field. Explain?

As a reference table, a system table having all the valid quantity units is assigned or any other table, which have a field with the format or quantity units (data type UNIT).  This field is known as reference field.

The assignment of the field having quantity amounts to the reference field is made at runtime.  The value in the reference field verifies the quantity unit of the amount.

 


Related Discussions:- Quantity amounts (data type quan)

Show block diagram of sequential circuits, Q. Show block Diagram of sequent...

Q. Show block Diagram of sequential circuits? A sequential circuit is an interconnection of storage elements and combinational circuits. The storage elements known as flip-flop

Approach to reasoning - first-order logic, Approach to reasoning - first-or...

Approach to reasoning - first-order logic: The formal approach to reasoning has bigger return and disadvantages. In generally we notice, if a computer program has proved somet

Explain cgi standard, Explain CGI standard. The CGI Standard: Techno...

Explain CGI standard. The CGI Standard: Technology utilized for building dynamic web documents is termed as Common Gateway Interface (CGI). The CGI standard gives how a serv

Explain switching system of a finite state machine model, Show how finite s...

Show how finite state machine model helps in designing a switching system and give a typical example. Switching system fundamentally belongs to the class of finite state machi

How reassembling of ip fragments is advantageous, Reassembling of IP fragme...

Reassembling of IP fragments at the ultimate destination is advantageous. Give reasons. Needing the ultimate destination to reassemble the fragments has two major advantages. F

Network message transfer, Consider a network message transfer among a sourc...

Consider a network message transfer among a source S and a destination D by 3 routers R1, R2 and R3 as given below:-               S -------- R1 --------- R2 --------- R3 ---

Define variants of turing machine, Define variants of Turing Machine?  ...

Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

Learning weights in perceptrons, Learning Weights in Perceptrons - Artifici...

Learning Weights in Perceptrons - Artificial neural network In detail we will look at the learning method for weights in multi-layer networks next chapter. The following descri

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd