Explain in brief about the insert operation, Computer Engineering

Assignment Help:

INSERT OPERATION

The insert operation inserts a new value into a set of bits. This is done by first masking bits and then O ring them with required value. For illustration, suppose that an A register have eight bits, 0110 1010 to replace the four leftmost bits by value 1001 we first four unwanted bits:-

 0110 1010 A before

 0000 1111 B (mask)

 0000 1010 A after masking

And then insert new value:-

 0000 1010 A before

 1001 0000 B (insert)

 1001 1010 A after insertion

mask  operation  is  an  AND  microoperation  and insert  operation  is  an  OR microoperation.

 


Related Discussions:- Explain in brief about the insert operation

What does not use by FTP, FTP does not use ? FTP doesn't use User Datag...

FTP does not use ? FTP doesn't use User Datagram Protocol.

Why cyclomatic complexity is important, Why cyclomatic complexity is import...

Why cyclomatic complexity is important? Cyclomatic complexity is computed using a graph that verifies the control flow of the program. The nodes of the graph correspond to the

Explain a public key encryption system, Explain a public key encryption sys...

Explain a public key encryption system? A public key encryption system permits only the correct receiver to decode the data.

What does "wire_read: unexpected eof" mean in gimp, This error message shou...

This error message should say something like "the plug-in (or the major GIMP app) I was talking to has existed before returning any results, so I suppose that it has crashed."

# real life business subsystem, Is production, marketing, personal, materia...

Is production, marketing, personal, material, finance are the real life business subsystems? if yes, then how?

Search-based tools in parallel computers, The search-based tools initially ...

The search-based tools initially recognize problem and afterwards suitably give advice on how to correct it.  AT Expert from Cray Research is one of the tools being employed for

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

What is gustafsons law, Q. What is Gustafsons Law? Amdahl's law is app...

Q. What is Gustafsons Law? Amdahl's law is appropriate for applications where response time is significant. On the other hand there are numerous applications that necessitate

What will exactly the hide statement do, What will exactly the hide stateme...

What will exactly the hide statement do? For displaying the details on secondary lists needs that you have previously stored the contents of the selected line from within the

Problem solving in parallel-, Problem Solving In Parallel Introduction ...

Problem Solving In Parallel Introduction to Parallel Computing This section examines how a particular task can be broken into minor subtasks and how subtasks can be answer i

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