Category Archives: Computer Organisation Theory


All important theory placed here!

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 »

Simplify Boolean function using Karnaugh map method F (A, B, C, D): Σ (0, 2, 4, 5, 6, 7, 8, 10, 13, 15) Also, draw the corresponding logic circuit diagram. 8m Jun2007

Construct the Karnaugh map for the following function, and find the function in sum of product form. Draw the resultant logic diagram. F (A, B, C, D): Σ (0, 2, 4, 5, 6, 7, 8, 10, 13, 15). 5m Dec2007  K-Map for F is: Thus, the simplified equations for F (A, B, C, D) =… Read More »

Give the Excitation tables and Block diagrams for the following: 10m Jun2007

Give the Excitation tables and Block diagrams for the following: 10m Jun2007 (i)                 D flip-flop (ii)               T flip-flop   D Flip-Flop: The D flip-flop shown in Figure is a modification of the clocked SR flip-flop. The D input goes directly into the S input and the complement of the D input goes to the R… Read More »

Explain the basic principle of Quine-McCluskey method of simplifying the Boolean expression with the help of an example function. 6m Jun2007

Explain the basic principle of Quine-McCluskey method of simplifying the Boolean expression with the help of an example function. 6m Jun2007 Quine McKluskey Method A tabular method was suggested to deal with the increasing number of variables known as Quine McKluskey Method. This method is suitable for programming and hence provides a tool for automating… Read More »

Design and draw a master-slave flip flop using JK flipflops. What are the advantages it offers over other flip flops? 10m Jun2007

Design and draw a master-slave flip flop using JK flipflops. What are the advantages it offers over other flip flops? 10m Jun2007 Master Slave Flip Flop Master-slave flip flop consists of two flip-flops. One is the master flip-flop & other is called the slave flip-flop. The figure shows implementation of master-slave flipflop using J-K flip-flop.… Read More »

List all the features of the RISC architecture. 6m Jun2015

List all the features of the RISC architecture. 6m Jun2007   List some important features of RISC architecture :  One instruction per cycle: A machine cycle is the time taken to fetch two operands from registers, perform the ALU operation on them and store the result in a register. Thus, RISC instruction execution takes about… Read More »

an assembly language procedure that divides a 32-bit number by a 16-bit number and can be called in any other module. 10m Jun2006

Write an assembly language procedure for 8086 microprocessor that divides a 32-bit number by a 16-bit number. The procedure should be written in general, so that it may be defined in one module and can be called in any other module.       10m Jun2006    Large Number Division ;- J := (K*M)/P mov ax,… Read More »