Quote:

The amount of happiness that you have depends on the amount of freedom you have in your heart

Wednesday 14 March 2012

CS501 Advance Computer Architecture ASSIGNMENT 5 SOLUTION


Assignment No. 05 SOLUTION
Semester Spring 2011
Advance Computer Architecture - CS501

Total Marks: 20

Due Date: 01/07/2011

Objective:
To learn and understand basic concepts of disk drives, and error control
Instructions:
Please read the following instructions carefully before solving & submitting assignment:
Assignment should be in your own wordings not copied from net, handouts or books.
It should be clear that your assignment will not get any credit (zero marks) if:

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file corrupt.
  • The assignment is copied (from other student or copy from handouts or internet).
  • Student ID is not mentioned in the assignment File or name of file is other than student ID.

Note: You have to provide solution with all the calculations and formulations involved, else no marks will be awarded.

For any query about the assignment, contact at cs501@vu.edu.pk

GOOD LUCK
Question No 1

10 Marks 

A hard drive has 4 surfaces, with 512 tracks per surface and constant 64 sectors per track. Sector size is 2K byte. The average seek time is 3 ms, the drive runs at 3,600 rpm.

  1. What is the drive capacity? (5)
  2. What is average access time for the drive? (5)

Solution:

  1. Capacity = 4 x 512 x 64 x 2K= 262144 KB
  2. Rotational latency = Rotation time/ 2 = 60/ 3600x2 = 8.3 ms
Average access time= Seek time + Rotational latency = 3 + 8.3 = 11.3 ms

Question No 2
10 Marks

Use the hamming code to encode the following 4-bit values (8 marks)
Also write down the encoding scheme (2 mark)
 Total (8+2 = 10 marks)

A.                0110
B.                 1001
C.                0000
D.                1111

Note : Use odd bit parity to encode above values
Solution:

The encoding scheme is P1P2D3P4D5D6D7 , using odd parity

0110 → 0001110
1001 → 1110001
0000 → 1101000
1111 → 0010111



No comments:

Post a Comment

“You can't change the past, but you can ruin the present by worrying about the future”