ICT2101 Lab Tutorials, Test & Report APRIL 2022 (20%)
ICT2101 Lab Tutorials, Test & Report APRIL 2022 (20%)
ICT2101 Lab Tutorials, Test & Report APRIL 2022 (20%)
Module’s Information:
Module ICT2101 COMPUTER ORGANIZATION
Session APRIL 2022
Programme DIPLOMA IN INFORMATION TECHNOLOGY
Mr. Ryan Tee
Lecturer
(Email: ahann.tee@newinti.edu.my ) or via Class FB group
Coursework Type Lab Tutorial(s)/Lab Test (Individual Works)
Percentage 20% out of 60% of Coursework’s
WEEK 2 [Notes: All lab activities being carried out from Week 2 to
Hand-out Date
Week 8]
WEEK 9, Wednesday [Submission of Lab Report is based on specific
Due Date labs compilation. [Time: Softcopy upload at BB latest by Wednesday,
15/6/2022 together with Hardcopy on/before 5 pm at Y Block]
Student’s Declaration:
I declare that:
I understand what is meant by plagiarism.
This assignment is all my own work and I have acknowledged any use of the published or
unpublished works of other people.
I hold a copy of this assignment, which I can produce if the original is lost or damaged.
[Name/ID] ____________________________________________________
[Signature] _______________________ [Date] _____________________
1|Page
PART 2 (Lab Test - Take Home)
Total
(100%)
PENALTY
(20%)
ACTUAL MARKS GIVEN
ONLY ATTACHED THE COVER PAGE / MARKING GUIDE ABOVE AS THE PAGE 1 and 2 OF THE REPORT
2|Page
TASK:
Develop an assembly language program to perform the arithmetic operations below by only using
registers AX and BX.
1510 * (22010 – 18510) + 13510
Show ALL your works step-by-step how you perform this arithmetic operation in MS Word file and
also show all your register content (screen-shots) by referring to the example in Lab Exercise 1, 2
and 3. You might need to add text box on your display/screen shot results and explain your outcome.
(10 marks)
Repeat the program in Question 1 to perform the arithmetic operations, which has been modified as
below. Store the result in another register.
Trace the register AX, carry flag (CF) and overflow flag (OF) for the following sequence of
instructions. You are required to show results for each step in binary form. Use ‘X’ to represent
undefined value.
Calculate the physical address of the memory where the operand is stored and the contents of the
memory locations in each of the addresses shown below:
i. MOV [DI], CL
The FORMAT of the lab tutorials/test should be Font Name/Size: Times New Roman, 12pt;
Line spacing of 1.5; Justified (Alignment); Page Number should be typed. You are allow to add in text
box to explain/show your answers clearer.
4|Page