Where can I get solutions to the following problems in the book
'Assembly Language Programming and Organization of the IBM PC', by
Ytha Yu and Charles Marut (ISBN 0-07-072692-2).
<<<<< I need these very soon >>>>
Prob #10 (page 115), Prob #10 (page 136), Prob #10 (page 160),
Prob #7 (page 226), Prob #4 (page 308), Prob #5 (page 330).
---------------------------------------------------------
Prob1-write a program that will prompt the user to enter a hex digit
character ("0" ... "9" or "A" ... "F"), display it on the next like in
decimal, and ask the user if he or she wants to do it again. If the
user types "y" or "Y", the program repeats; if the user types anything
else, the program terminates. If the user enters an illegal character,
prompt the user to try again.
------------------------------------------------------
Prob2-write a program that prompts the user to type a hex number of
four hex digits or less, and outputs it in binary on the next line. If
the user enters an illegal character, he or she should be prompted to
begin again. Accept only uppercase letters.
-----------------------------------------------------------
Prob3-The following method can be used to generate random numbers in
the range 1 to 32767.
Start with any number in this range.
Shift left once.
Replace bit 0 by the OR of bits 14 and 15.
Clear bit 15.
-----------------------------------------------------------
Prob4-Suppose the following string has been declared:
STRING1 DB 'T H I S I S A T E S T'
STRING2 DB 11 DUP (?)
write some code that will cause STRING1 to be copied into STRING2 with
the blank characters removed.
---------------------------------------------------------------
Prob5-The position of a substring within a string is the number of
bytes from the beginning of the string to the start of the substring.
Write a seprately assembled NEAR procedure FIND_SUBST that receives
the offset addresses of the first string in SI and the second string
in DI and determins whether the second string is a substring of the
first; if so, FIND_SUBST returns its positiuon in AX. If the second
string is not a substring of the first string, the procedure returns a
negative number in AX.
Write a program to test FIND_SUBST; the testing program reads the
strings, calls FIND_SUBST, and displayes the result.
-------------------------------------------------------
Prob6- Write a program that will output the message "Hello" once
every half a second to the screen. |
