Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

CS501 Advance Computer Architecture Assignment No 02 Fall 2020 Solution / Discussion

Views: 806

Replies to This Discussion

Share the Assignment Questions & Discuss Here.... 

CS501_Assignment_No_02_Solution_Fall_2020

Click on the below link to download the file

CS501_Assignment_No_02_Solution_Fall_2020

CS501 Assignment No.2 solution falll 2020

 

 

Question No. 01                                                                                                            10 Marks

Write an RTL description for each of the below given Falcon-A instructions.

 

Solution:

 

Instruction

RTL Description

JNZ R1, [25]

(R[1]≠0): PC←PC+25

SHIFTR R3, R2, 5

R[3]←(5α0)©(R[2]<15…4)

LOAD R4, [R1 + 20]

R[4] ← M[20+R[1]]

CALL R6, Ah

R[6] ←PC, PC← Ah

MUL R2, R3, R1

R[2] ← R[3]*R[1]R[0] ←C

 

Note: You must use a sign-extended the constant in the instructions wherever needed.

 

Question No. 02                                                                                                            10 Marks

Consider the below-given tables. Table 1 shows the contents stored at different memory addresses. Table 2 shows the contents stored in different registers.

 

Memory Address

Memory Contents

 

Register

Register Contents

1530h

45h

 

R[0]

AB04h

1531h

90h

 

R[1]

2010h

AB20h

66h

 

R[2]

1520h

AB21h

02h

 

R[3]

0230h

Table 1: Memory Contents

 

Table2: Register Contents

 

What will the contents of the address bus and data bus after each of the instructions be executed?

 

  • LOAD R1, [R0+28]
  • STORE R3, [R2+16]

 

Solution:

 

Instruction

Address Bus

Data Bus

LOAD R1, [R0+28]

AB20h

6602h

STORE R3, [R2+16]

1530h

4590h

 

 

 

#Cs501 #VUassignment Cs 501 assignment solution Fall 2020

RSS

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service