What are program-invisible registers, Computer Engineering

Assignment Help:

What are program-invisible registers?

Ans: the local and global descriptor tables are found in the memory system. To access and specify the address of these tables, program invisible registers used. Program invisible registers aren't directly addressed by software so they are given a name. GDTR (global descriptor table register) and IDTR (interrupt descriptor table register) comprises the base addresses of descriptor table and its limit. Limit of each descriptor table is 16 bits as maximum table length is 64 Kbytes. When protected mode operation is desired, address of the global descriptor table and its limit are loaded into GDTR.

 


Related Discussions:- What are program-invisible registers

Describe the term- macros, Describe the term- Macros A macro is a key o...

Describe the term- Macros A macro is a key or name which signifies a series of commands or key strokes. Many applications allow single nominated key or single word on a keyboar

#dbms., #example of cascading rollback#

#example of cascading rollback#

Describe the contents of a process control block, Describe the contents of ...

Describe the contents of a Process Control Block (PCB). Process Control Block (PCB): All processes are represented in the operating system by a task control block or a proces

Define memory utilization factor, Memory utilization factor shall be comput...

Memory utilization factor shall be computed as? Ans. memory in use/total memory connected.

What is hard drive interface, Q. What is Hard Drive Interface? Secondar...

Q. What is Hard Drive Interface? Secondary storage devices need a controller to proceed as an intermediary between device and rest of the computer system. On some computers the

Calculus, i want an assignment on application of integraton and my topc of ...

i want an assignment on application of integraton and my topc of assifment is area under the curve includin solved examples

Padovan string , A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

Opengl, scan line seed fill algorithm program using opengl

scan line seed fill algorithm program using opengl

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