Logical difference among move a to b and compute b = a, Computer Engineering

Assignment Help:

What is the logical difference among Move A TO B and COMPUTE B = A?

Ans) In case of Move A TO B it will move whatever the value of a in to b.

It mean it will move numeric, alphanumeric and alphabetic value.

In case of COMPUTE B = A it will assign the value of a in to b.

But in case of compute only numeric value will be compute.

mov a,b Ans- means whatever the data present on the 'b' it will move into 'a'

 

 


Related Discussions:- Logical difference among move a to b and compute b = a

Explain the t flip flop, Explain the T Flip Flop? The toggle, or T, fli...

Explain the T Flip Flop? The toggle, or T, flip-flop is the bistable device that changes state on command from a common input terminal.   Truth Table

Why pointer variable to a function as an argument, Why pointer variable som...

Why pointer variable sometimes desirable to pass a pointer to a function as an argument? Frequently, a called function needs to make changes to objects declared in the calling

What are rdram, What are RDRAM? RDRAM are Rambus DRAM. Rambus needs spe...

What are RDRAM? RDRAM are Rambus DRAM. Rambus needs specially designed memory chips. These chips use cell arrays based on the standard DRAM technology. Multiple banks of cell a

A full binary tree with ''n'' non-leaf nodes, A full binary tree with 'n' n...

A full binary tree with 'n' non-leaf nodes have  2n+l nodes.

Finite state automaton, Once a finite state automaton (FSA) is designed, it...

Once a finite state automaton (FSA) is designed, its transition diagram can be translated in a straightforward manner into program code. However, this translation process is consid

Analysts in various functional areas, Q. Analysts in various functional are...

Q. Analysts in various functional areas? Today systems analyst's job presents a exciting and fascinating challenge. It provides high management visibility and opportunities for

Demonstration of sorting problem, Q. Demonstration of sorting problem? ...

Q. Demonstration of sorting problem? The term sorting implies organising elements of a provided set of elements in a specific order i.e. descending order / ascending order / al

Determine maximum possible time of 4-bit synchronous counter, A 4-bit synch...

A 4-bit synchronous counter uses flip-flops with propagation delay times of 15 ns each.  The maximum possible time required for change of state will be ? Ans. 15 ns since in sy

C, usability of union

usability of union

Illustrate organisation of dram chip, Q. Illustrate Organisation of DRAM Ch...

Q. Illustrate Organisation of DRAM Chip? The given figure is a typical organisation of 16 mega bit DRAM. It displays a typical organisation of 2048 × 2048 × 4 bit DRAM chip. Me

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