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

Explain the working of hundred-line exchange, In a hundred-line exchange 24...

In a hundred-line exchange 24 two-motion selectors are used. Draw the schematic you suggest for this exchange and explain its working. How many simultaneous calls can be made durin

Why cmos circuits are extensively used for On-chip computers, CMOS circuits...

CMOS circuits are extensively used for ON-chip computers mainly because of their extremely ? Ans. Since CMOS circuits have large packing density, so these are extensively use

Illustrate about the three state table buffers, Three state table buffers ...

Three state table buffers Three state table buffers: A bus system can be constructed with the help of three state gates instead of multiplexers. A three states gate is digital

Logic programs, Logic Programs: A subset of first order logic is "Logi...

Logic Programs: A subset of first order logic is "Logic programs". However logic program having a set of Horn clauses that are implication conjectures when there is a conjunct

What start bit and stop bit, What start bit and stop bit The first bit ...

What start bit and stop bit The first bit known as the Start bit is always a zero and it is used to show the beginning of the character The last bit is known as the stop bit

Ring, Ring This is a easy linear array where the end nodes are connecte...

Ring This is a easy linear array where the end nodes are connected.  It is equivalent to a engage with wrap around connections. The data transmit in a ring is normally one dire

Delete the leaves of a binary tree, Write a recursive algorithm to delete t...

Write a recursive algorithm to delete the leaves of a binary tree. Programming Requirements You must use the binary search tree code provided.  Each algorithm must be impleme

Give the truth table of S-R and D-flipflops, Give the truth table of S-R an...

Give the truth table of S-R and D-flipflops. Ans: The Truth Table for S-R Flip-Flop is illustrated in Fig.(a) and truth table of D Flip-Flop is illustrated in Fig.(b)

Determine about the three-state gate, Determine about the three-state gate ...

Determine about the three-state gate A three-state gate is a digital circuit which shows three states. Two of them are equivalent to logic 1 and 0.  The third one is a high im

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