Anda di halaman 1dari 5
Computer Organisation & Architecture 106 Memory Organisation Review Questions 1. List the different characteristics of memory system. 2. Write a note on memory hierarchy. 3. Describe the various types of semiconductor memories. Draw and explain the organisations for a) ROM. b) PROM What are the types of RAMs ? Explain them in detail. . Write a note on chip packaging. . What is cache memory ? Why is it implemented ? Define hit rate. 9. Describe the elements of cache design. 10. Explain the following, a) Program locality _b) Block fetch 11. Draw and explain fully associative cache organisation. 12. Draw and explain direct mapped cache organisation. 13. Draw and explain set associative cache organisation 14. What is cache updating ? Why is it necessary ? Explain different updating systems. 15. What is cache coherency ? Why is it necessary ? Explain different approaches for cache coherency. 16. Explain the replacement algorithms for cache memory. 17. Write a short note on advance DRAM organisations. 18, Draw and explain the organisation of EDRAM and SDRAM. 19. Explain the features of RAMBUS DRAM. 20. Draw and explain the RAMLINK architecture. 21. Draw the typical organisation for EDORAM. 22. Comment on the performance of two level cache system. 23. What is virtual memory ? Why is it necessary to implement virtual memory ? 24. Draw and explain the virtual memory organisation. 25. Explain the working of page translation mechanism. 26. What do you mean by TLB ? 27. Write a note on magnetic disk. 28. Explain how bits are represented on the magnetic disk. 29. How data is organized and formatted on the magnetic disk ? 30. Draw and explain winchester disk track format. 31. Give the characteristics of magnetic disks. 32. List the specifications for magnetic disks. 33. List the specifications for floppy disks. PrNaw Computer Organisation & Architecture 107 Memory Orga 34 Write a short note on magnetic tapes. 35. Write a note on RAID. 36, What is data stripping ? 37. Explain various RAID levels. 38. List various types of optical memory 39. Write a short note on a) CD-ROM b) WORM ©) Erasable optical memory d) Associative memory e) Interleaved memory. University Questions 1. Explain in brief Virtual memory (Dec.-96) 2. Write detailed note on Cache memories. (Dec.-96) (Dec.-2001) 3. A certain moving arm disk storage device has the following specification ; Number of tracks per recording surface 100 disk rotation speed 1200 r/min. Track storage capacity 31250 bits. Estimate the average latency and the data transfer rate of this device. (May-97) 4. Design a 16 K-byte RAM using 256 x 4 bit RAM ICs. (May-97) (May-2002) 5. In a two level virtual memory, t4; = 107 s and ta = 107 s, What must be the hit ratio H be in order for the access efficiency to be atleast 90 percent of its maximum possible value. (May-97) 6. Design a segment page virtual memory mapping system for a physical memory size of 512 Mbytes and virtual address of 48 bits. (May-97) 7. Write detailed note on : Interleaved memory. (May-97) (Dec.-2001) 8. A magnetic-tape system accommodates 2400 ft reels of standard ninetrack tape. The tape is moved past the recording head at rate of 200 in/s. i) What must the linear tape-recording density be in order to achieve data transfer rate of 10° bits/sec. ii) Suppose that the data on the tape is organized into blocks each containing 32 k bytes. A gap of 0.3 in separates each block.'How many bytes may be stored on the tape ? (Dec-97) 9. Consider a two level memory hierarchy of the form (M;, M) where M, is connected directly to the CPU. Determine the average cost per bit ¢ and average access time t, for the data given below. Level (i) | Capacity (5) Access time | Hit ratio (H) (ty) M, (Cachey [1024 10° 0.9000 M;, (Main) 26 10° - (Dec-97) 10. Design a set associative cache with 64 sets and 128 block frames. (Dec.-97) (May-2001) Computer Organisation & Architecture _108 Memory Organisation 11. What is demand paging ? Explain any two page replacement algorithms. (Dec.-97) 12. Explain the structure of a virtual memory system, hence explain the virtual memory design objectives for the same. (May-98) 13! Design a set associative cache with 32 sets and 64 block frames. Explain the operation of the same (Physical address size = 32 bits) (Dec.-98) 14. Consider a two level memory hierarchy M, and M, and let cy, ¢; be the costs per type, tai and ta be the access times and S, and S, be the memory capacities for M, and M, respectively. a) Under what conditions will the average cost of the entire memory system approach & b) What is the effective memory access time ty of this hierarchy ? ) Express access efficiency e in term of speed ratio and hit ratio. 4) Plot e against h for r = 520 and 100 respectively and comment on its performance. (Dec.-98) 15. The access time of a cache memory is 100 ns and that of main memory is 1000 ns. It is estimated that 75 percent of memory requests are for read and remaining for write. The hit ratio for read access only is 0.9 and for write is 0.8. A write through procedure is used : i) What is the average access time of the system considering only memory read cycle ? ii) What is the average access time of the system for both read and write requests. (Dec.-99) 16. Explain in brief the various types of cache organization. (Dec.-99) (May-2000) (May-2002) 17. Explain in detail, the various properties to be considered when evaluating any memory technology (Dec.-99) 18. A high speed tape system accomodates 2400 ft. reel of standard 9-track tape. The tape is moved past the recording head at the rate of 150 inches/sec. i) What must be the linear tape recording density in order to achieve a data transfer of 10° bit/sec ? ii) If tape is organized into block of 32 KB, a gap of 0.4 inches separates the blocks, what is the storage capacity of the tape ? (Dec.-99) 19. The logical address space in a computer system consists of 128 segments of capacity 32 pages of 4K words. The physical memory consists of 4K page frames each of 4K words capacity : i) Formulate the logical and physical address ii) Give the block diagram for table translation. (Dec.-99) 20. A Winchester magnetic disk unit has densities of 40° 10° bits per square inch of surface. i) If the inner diameter of recording area is 4 inches and the outer diameter of 7 inches, what is the average bit density along a track if radial track spacing density is 2000 tracks/inch. ii) What is the data transfer rate in bytes/sec at a rotational speed of 3600 RPM ? (May-2000) 21. Design a 4M 16 memory unit, using 256 K x 1 memory chips. Explain in detail the assumptions made while designing the system. (Dec.-2000) 22. Explain the process of address translation in a virtual memory system and hence explain why the page size should be neither very small nor very large. (Dec.-2000) Computer Organisation & Architecture 109 Memory Organisation 23. Explain the implementation of = i) Paged memory system. ii) Demand paged memory system. and hence compare the two. (May-2001) 24. Discuss in brief the concept of memory hierarchy. Explain its relevance to computer systems design using suitable examples. (Dec.-2001) 25. Explain the following terms using suitable examples : i) Locality of reference ii) Hit ratio (Dec.-2001) 26. Write a short note on : Paged segments. (Dec.-2001) (Dee.-2001) 27. Write a short note on : Secondary memory technologies. Q00 Datapath Design A processor consists of datapath (data processing) and control unit. The datapath unit performs all arithmetic and logical operations. We know that, modern computers communicate and operate with binary numbers which use only the digits 0 and 1. Based on binary number system various data types are implemented in the computer system. The most common data types are : Fixed point numbers and Floating point numbers. In this chapter, we see the fixed point and floating point number systems, and arithmetic algorithms and circuits needed to process numerical data using these systems. 4.1 Fixed Point Representation In binary number system, a number can be represented as an integer or a fraction. Depending on the design, the hardware can interpret number as an integer or fraction. The radix point is never explicitly specified. It is implicited in the design and the hardware interprets it accordingly. In integer numbers, radix point is fixed and assumed to be to the right of the right most digit. As radix point is fixed, the number system is referred to as fixed point number system. The fixed point/ integer numbers are represented in two forms : signed integer and unsigned integer. Unsigned integer numbers represent positive numbers. To represent negative numbers various techniques are used because computer does not have provision to represent negative sign. In this section we will see techniques to represent signed integer numbers : + Sign-magnitude representation + 1's complement * 2's complement 4.1.1 Sign-Magnitude Representation In signed numbers it is necessary to represent B7 86 85 64 B3 B2 81 80 | negative as well as positive numbers. Fig. 4.1 LLLTLTILIL I shows the sign magnitude format for 8 bit signed number. In sign-magnitude representation the most significant bit (leftmost bit) is used to Sign Magnitude a represent sign of the number. If the most Fig. 4.4 Sign - magnitude format _ significant bit is 0, the number is positive, and if (110)

Anda mungkin juga menyukai