Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Explain carry save addition (CSA) process. Ans: Instead of allowing the carries ripple along the rows, they can be saved and then introduced into the next roe at the right wei
Q. Binary floating-point number range? Smallest Negative number Maximum mantissa and maximum exponent = - (1 -2 -24 ) × 2 127 Largest negative number
Vector-Scalar Instructions In this category, when combination of vector and scalar are fetched and stored in vector register. These instructions are referred with the subsequen
The number of flip flops contained in IC 7490 is ? Ans. 2 flip flops contained in IC 7490.
De Morgan's Laws Continuing with the relationship between ∧ and ∨ , we can also use De Morgan's Law to rearrange sentences involving negation in conjunction with these conne
Explain Sequential Sharing In this sharing method, a file can be shared by just one program at a time, i.e. file accesses by P1 and P2 are spaced out over time. A lock field ca
What is the advantage of using interrupt initiated data transfer over transfer under program control without interrupt? In the interrupt initiated data transfer, the processor
Define Grammar of a language. A formal language grammar is a set of formation rules which describe that strings formed from the alphabet of a formal language are syntactically
Proof by Contradiction - Artificial intelligence So, both backward chaining andforward chaining have drawbacks. Another approach is to think regarding proving theorems by contr
Q. What is the impact of overflow for binary numbers? An overflow is said to have happened when sum of two n digits number takes n+ 1 digits. This definition is perfectly appli
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd