Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
CS501 Advance Computer Architecture final term paper 2011 imported question
#1
CS501 - Advance Computer Architecture
Final paper 8/11/10
Q1) suppose an I/O system with a single disk gets (on average) 200 I/O request/second. Assume that average time for a disk to service an I/O request is 4ms. What is the utilization time? 3Marks
Q2) Give an example when DMA can be brought into use? 3Marks
Q3) convert the hexadecimal number B316 to base 10 5Marks
Welcome to vuZs
Q4) Does DMA affects the relationship b/w the memory system and CPU system. Explain with example.
5Marks
Q5) consider a 128kb direct mapping with a line length of 32 bytes
I. Determine the number of bits in the address that refers to the bytes within the cache
I. 
Q6) consider the following floating point’s numbers 3 marks
-0.5 X 10-3
Find out the sign, significant and exponent
Q7) why we represent sometime some numbers in sign magnitude form.


Attached Files
.zip   CS501_Final_2010.zip (Size: 3.95 KB / Downloads: 187)
Reply
#2
[SIZE="5"][SIZE="5"]full solution in attachment [/SIZE][/SIZE]

Name different instruction format types of SRC “simple RISC computer”? Compare each type for the following features only:
a) Number of instructions
b) Addressing mode

Yours answer should be to the point and cover all the necessary details as asked in the question.

Solution

Four types of instructions are supported by the SRC
Type A
Type A is used for only two instructions:

Number of instructions
Addressing mode

Two instructions

• No operation or nop
• Stop operation stop

Both of these instructions do not need an operand (are 0-operand instructions).

Type B
Number of instructions
Addressing mode
Type B format includes three instructions; all three use relative addressing mode
• ldr instruction, used to load register from memory using a relative address
• The lar instruction, for loading a register with relative address
• The str is used to store register to memory using relative address


The effective address is computed at run-time by adding a constant to the PC. This makes the instructions ‘re-locatable’.


Attached Files
.zip   CS501_1_Spring 2011_solution.zip (Size: 15.67 KB / Downloads: 178)
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  All Unsolved Past Papers Final Term and Mid Term 2008 And 2009 viki 6 4,682 06-01-2012, 05:15 AM
Last Post: shahid11011
  CS402 Theory of Automata Mid Term Examination – Spring 2011 virtual university of pak Vuhelper 3 7,669 11-11-2011, 07:20 AM
Last Post: AliMustafa786
  cs301 final term current paper July 2011 Vuhelper 0 4,311 07-09-2011, 10:40 PM
Last Post: Vuhelper
  cs101 final term solve papers July 2011 Vuhelper 0 4,291 07-09-2011, 07:22 PM
Last Post: Vuhelper
  cs101 final term solve paper july 2011 Vuhelper 0 3,849 07-09-2011, 07:18 PM
Last Post: Vuhelper
  CS101- Introduction to Computing final term New paper July 2011 Vuhelper 0 3,502 07-09-2011, 07:04 PM
Last Post: Vuhelper
  CS101- Introduction to Computing final term paper July 2011 Vuhelper 0 3,478 07-09-2011, 07:02 PM
Last Post: Vuhelper
  CS101 Final term paper 2011 Subjective solved New Vuhelper 0 5,965 07-09-2011, 06:55 PM
Last Post: Vuhelper
  cS001 final term papers July 2011 Vuhelper 0 4,385 07-09-2011, 06:52 PM
Last Post: Vuhelper
  ACC501 Final Term July 2011 paper subjective Vuhelper 0 3,920 07-09-2011, 06:50 PM
Last Post: Vuhelper

Forum Jump:


Users browsing this thread: 1 Guest(s)