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!
Q. Write an assembly function which hides the cursor?
Write an assembly function which hides the cursor. Call it from a C program.
. PUBLIC CUROFF
. MODEL small, C
. CODE
CUROFF PROC
MOV AH, 3 ; get the current cursor position
XOR BX, BX ; empty BX register
INT 10h ; use int 10hto do above
OR CH, 20h ; force to OFF condition
MOV AH, 01 ; set the new cursor values
INT 10h
RET
CUROFF ENDP
END
The C program to test this routine is as follows:
# include < stdio.h
void curoff(void);
void main()
{
printf("%s\n, "The cursor is now turning off);
curoff();
}
You can write another procedure in assembly language program to put cursor on. This can be done by replacing OR CH, 20h instruction by AND CH, 1Fh. You can call this new function from C program to put cursor on after curoff.
Details about nanoprogram
DATA DICTIONARY ON ONLINE QUIZ SYSTEM
Explain the working of a 2-bit digital comparator with the help of Truth Table. Ans. Digital comparator is a combinational circuit which compares two numbers, A and B; and
Intranets are mainly "small" Internets. They use same network facilities that Internet does, though access is restricted to a limited sphere. For example, a company can set up an i
Does swapping increase the Operating Systems' overheads? Justify your answer. A process can be swapped out temporarily of memory to a backing store and after that brought back
Take a CPU that shows two parallel fetch-implement pipelines for superscalar processing. Determine the performance improvement over scalar pipeline processing and no-pipeline proce
Q. What is Master slave kernel? Master slave kernel: In this model just one of processors is assigned as Master. The master is in charge for subsequent activities: i)
Define Rules For Evaluating the Boolean Expression? Generally, the following rules must always be followed when evaluating the Boolean expression: Primary, perform all in
Functions in first-order logic sentences - artificial intelligence: Functions may be thought of as special predicates, where we think of all but 1 of the arguments as input and
Applications of recursion theorem? 1. ATM is undecidble. 2. Fixed point theorem. 3. MINTM is not Turing recognisable
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