Category Archives: Computer Organisation and Assembly Language Programming

Give block diagram of DMA controller. How does the CPU initialize the DMA transfer? 5m Jun2008

Give block diagram of DMA controller. How does the CPU initialize the DMA transfer? 5m Jun2008 Device Controller A device controller need not necessarily control a single device. It can usually control multiple I/O devices. It comes in the form of an electronic circuit board that plugs directly into the system bus, and there is… Read More »

Explain briefly the working of two-pass assembler. 5m Jun2008

Explain briefly the working of two-pass assembler. 5m Jun2008   Two-pass assembler: Assemblers typically make two or more passes through a source program in order to resolve forward references in a program. A forward reference is defined as a type of instruction in the code segment that is referencing the label of an instruction, but… Read More »

List three differences between Dynamic RAM and Static RAM. 3m Jun2008

List three differences between Dynamic RAM and Static RAM. 3m Jun2008 Static RAM   ü  SRAM uses transistor to store a single bit of data ü  SRAM does not need periodic refreshment to maintain data ü  SRAM’s structure is complex than DRAM ü  SRAM are expensive as compared to DRAM ü  SRAM are faster than… Read More »

Draw logic circuit for a converter that converts 4 bit binary input to its equivalent BCD number. 8m Jun2008

Draw logic circuit for a converter that converts 4 bit binary input to its equivalent BCD number. 8m Jun2008 A four bit number can be any number value between 0 to 15  i.e.  0 to F in Hexadecimal. BCD is a number which is represented in binary as a decimal number hence it can have… Read More »

Write an 8086 assembly language program that finds the smallest and the second smallest number from a list of 10 numbers stored in memory. 7m Jun2008

Write an 8086 assembly language program that finds the smallest and the second smallest number from a list of 10 numbers stored in memory. 7m Jun2008 To understand program for Largest or Smallest in an array in detail Please Click this link below http://cssimplified.com/computer-organisation-and-assembly-language-programming/an-assembly-program-for-finding-the-largest-number-in-array-of-10-elements DATA SEGMENT ARR DB 5,3,7,1,9,2,6,8,4 LEN DW $-ARR SMALL DB ? SECOND… Read More »

A computer has 64 words RAM with a word size of 16 bits and a cache memory of 8 Blocks with block size of 32 bits. 9m Jun2008

Assume a computer having 64 word RAM and cache memory of 8 blocks. Where can we find memory location 25 in cache when the following are used:  (i) Direct mapping (ii) Associative mapping (iii) 2-way set associative (2 blocks per set) mapping Assume 1 word – 16 bits, block size = 32 bits. 9m Jun2008 … Read More »

Simplify the following Boolean function in SOP form using K-Map: F (A, B, C, D) = Σ ( 0,1, 2, 4, 6, 8, 9, 12, 14, 15 ). Draw logic circuit diagram. 8m Jun2008

Simplify the following Boolean function in SOP form using K-Map: F (A, B, C, D) = Σ ( 0,1, 2, 4, 6, 8, 9, 12, 14, 15 ). Also, draw the simplified logic circuit diagram. 8m Jun2008  K-Map for F is: Thus, the simplified equations for F (A, B, C, D) = Σ (0,1, 2, 4, 6,… Read More »

Differences between structure and union in C programming with example

What are the differences between structure and union? Give one illustrative example of usage of the union. 8m Jun2008 Structure in C programming Structure is commonly referred to as a user-defined data type. C’s structures allow you to store multiple variables of any type in one place (the structure). A structure can contain any of… Read More »

A computer has 32 words RAM with a word size of 16 bits and a cache memory of 4 Blocks with block size of 16 bits. 10m Dec2007

Assume a computer has 32 words RAM each having a word of 16 bits and a cache memory of 4 blocks, with each block having 16 bits. Where can we find a main memory address 21 in the cache (if it exists) if (i) Set associative mapping is used? (ii) Direct mapping is used? (iii)… Read More »

Find the average access time for the disk. 4m Dec2007

Seek time on a hard disk is 50 ms. it rotates at a speed of 3000 rotations/sec. Each track on the disk has 100 sectors. Find the average access time for the disk. 4m Dec2007 Disk Rotation Speed = 3000 rps.  (i.e. 180000 rpm) Sectors per Track = 100 sectors Seek time = 50 millisecond  … Read More »