TA: | Jade Cheng 成玉 (yucheng@hawaii.edu) | |
Instructor: | David Pager (pager@hawaii.edu) | |
Course: | Machine-Level and Systems Programming | |
TA Office: | POST Building Room 303-3 (cubicle 3) | |
TA Hours: | Tuesday 11:00 to 12:00 | |
Thursday 11:00 to 12:00 |
TBD
If you do not complete homework assignments sufficently, you would automatically fail the course. Otherwise, homework does not affect your grades. Homework submissions will be recorded and posted on this site using the student codes provided by the TA.
Please submit your homework assignments by 11:59 pm on the posted due date. Homework received on time will receive 10 points. One point will be deducted for late submissions. After one week homework will not be accepted.
To facilitate the grading process, please try to follow the following guidelines when submitting assignments.
Assignments should be submitted via email using your UH UNIX email account. The TA will not accept any other form of submissions.
Assignments should be submitted to yucheng@hawaii.edu. Please do not send the assignments to the professor.
Please cc the email to youself. That way, if the TA doesn’t get your email for some reason, you have proof that it was sent.
Please use the following pattern for the subject of your email.
[312] homework number
For example: [312] homework 1
Please copy and paste the contents of the homework in the email body. That way, the TA will receive your work even if the attachment is rejected.
Plain text files are preferred. PDF, JPG, and PNG files are also accepted. Please do not send Microsoft Office documents.
You may submit an assignment more than one time. Only the most recent assignment submitted will be evaluated.
The grades for homework assignments, programming projects, in-class quizzes, and the exams will be posted using the student codes provided by the TA. If you lose or forget your code, please contact the TA.
Click your student ID to view your grades.
The solutions of some of the homework assignments and the in-class quizzes will be posted in this section. Since late submmisions are allowed, the solutions will not be available until a couple of weeks after the due date.
;; Ex. 17.1 (b) on p.504. Look for the index of the first entry of 123 in B ;; array, and set di to this index. include pcmac.inc .model small .stack 100h .data B dw 1, 2, 3, 4, 5, 6, 123, 8, 9, 10 .code prog proc extrn putdec : near ; compile with util.lib. extrn getdec : near mov ax, @data mov ds, ax mov es, ax ; initialize es cld ; set df = 0 lea di, B ; destination mov cx, 10 ; loop the lenght of the string, here is 10. again: mov ax, 123 ; look for 123 repne scasw ; scan until found or the end of cx jne not_found ; if scanning reaches the end, then not found mov ax, 10 ; ax = 10 sub ax, cx ; ax = 10 - current iteration = index mov di, ax ; set di = index jmp done ; once found, jump end not_found: mov di, -1 ; if not found, set di to -1 done: mov ax, di ; prints out the content of di. call putdec mov ah, 4ch ; return code into ah int 21h ; function code for exit to os prog endp end prog
The course textbook — William Jones’ Assembly Language Programming for the IBM PC Family, 3rd Edition