Showing posts with label Digital logic design and analysis. Show all posts
Showing posts with label Digital logic design and analysis. Show all posts

Friday, May 23, 2014

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2010 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2010  COMPUTER SCIENCE SEMESTER 3

Con.3016-10                                                                                                AN-2500
                                                          (3 Hours)                                  [Total Marks : 100]

N.B : (1) Question No. 1 is compulsory.
         (2) Attempt any four questions out of remaining six questions.
         (3) Assume suitable data and it clearly.

1. (a)Convert (1473.45)10 to Octal, Binary and Hexadecimal.(6)
    (b)Perform directly without converting to any other base.(8)
(i) (BC5)H-(A2BD)H (ii) 12.3)4+(212. 3)4
(iii) (77)8*(17)8 (iv) (11110)2÷(110)2

    (b)Write the hamming code for 1010.(3)
    (c)State and prove De Morgan's Theorem.(3)

2. (a)

Using the K-map method minimization technique simplify and draw

(10)
the circuit for the following function.
F(A,B,C,D,E)=£m(0,1,2,3,5,7,8,9,11,14,16,17,18,19)+d(24,25)
    (b)Design 3 bit Binary to gray code converter(5)
    (c)What is essential prime implicant in Quine McClusky Method.(2)
    (d)Prove OR-AND configuration is equivalent to a NOR-NOR configuration.(3)

3. (a)

What is Canonical SOP and POS form? Explain with an example.

(5)
    (b)Implement the following using only one 8:1 MUX and few gate.(5)
F(A,B,C,D)=£m(0,3,5,7,9,13,15)
    (c)Design and draw a combinational circuit that multiplies two 2 bit numbers(10)
A1A2 and B1B2 to produce 4-bit product C3C2C1C0.

4. (a)

Design a sequence generator using T flip-flop for the given sequence. Check

(10)
for lock-out conditions.
                         0-> 2 -> 4 -> 5 -> 0
    (b)Implements the following boolean function using 4:1 MUX(10)
    F(A,B,C,D)=£m(0,1,2,4,6,9,12,14).

5. (a)

Convert SR flip-flop to Dand T flip-flop and draw the circuit.

(10)
    (b)Calculate the characteristics equation using characteristic table of SR, JK, D and T(10)
Flip-flop.

6. (a)

Design a synchronous counter for the following sequence using JK FF Draw the

(10)
timing diagram.
                    1-> 0 -> 3-> 2-> 5-> 4
    (b)Using the quine McClusky method simplify(10)
         F=£m(1,3,7,9,11,13,15)+D(2,4)

7. (a)

Air India Complex has four elevators for visitors. To save on power only two elevators

(10)
cars are available.If the traffic is heavy or if car 1 is shutdown due to technical problem,
the third elevators car is switched ON. The fourth elevators car is a standby car which
is powered ON if both car1 and car2 fail.Design a logic circuit for starting power to
car3 and car4.
    (b)Compare TTL, CMOS and ECL families with respect to gate, voltage level, fan-in, (10)
fan-out, propagation delay, power dissipation and noise margin.

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2010 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2010 COMPUTER SCIENCE SEMESTER 3


Con.5680-10                                                                                                 GT-6240

                                                                  (3 Hours)                               [Total Marks : -100]


N.B.: (1) Question No.1 is compulsory.
         (2) Attempt any four questions out of remaining six questions.
         (3) Assume suitable data and it clearly.

1. (a) Convert (1234.56)10 to octal, Hexadecimal. [4 Marks]
    (b) Perform following operation without converting to any other base. [4 Marks]
            (i) (ABC)H - (FEDC)H
            (ii) (234.12)5 + (432.34)5
            (iii) (76)8 * (67)8
             (iv) (10101011)2 / (101)2
    (c) Represent (29)10 into Excess -3 code and gray code. [4 Marks]
    (d) Design (1:16) Demultiplexer using (1:4). [4 Marks]

2. (a)    i. Subtract using 1's and 2's complement method (73)10 - (49)10. [2 Marks]
            ii. Perform BCD addition for number 56 and 65. [2 Marks]
           iii. Perform (11010)2 / (101)2. [2 Marks]
           iv. Write hamming code for number 0111. [2 Marks]
    (b) Simplify using Boolean Theorems and draw logic diagram for the following:-
          i.
         ii.
        iii.

3. (a) Minimize the following logic function and realize using NAND gates:- [10 Marks]
          f(A,B,C,D) = m(1,3,5,8,9,11,15) + d(2,13)
    (b) Simplify using Quine McClusky method. Realize the equation using any universal
          gate. [10 Marks]
          F(A,B,C,D) = m(0,2,3,6,7,8,9,12,13)

4. (a) Deign a MOD-6 synchronous up counter and explain its working. [10 Marks]
    (b) What is shift register? Explain 4-bit bi-directional shift register. [10 Marks]

5. (a) Implement the following Boolean function using 4:1 MUX. [10 Marks]
          F(A,B,C,D) = m(1,2,4,6,9,12,14)
    (b) Convert SR flip flop to D and T flip flop and draw the circuit. [10 Marks]

6. (a) Draw 2-input TTL NAND gate and explain its operation. [10 Marks]
    (b) Prove that NAND and NOR gate as universal gate. [10 Marks]

7. (a) Write notes on following :- [20 Marks]
          (a) ALU
          (b) PLA and PAL
          (c) Multiplexer and demultiplexer
          (d) Race around condition in JK flip flop
         

   

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2009 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2009 COMPUTER SCIENCE SEMESTER 3

Con.5818-09.                                     (REVISED COURSE)                                     SP-7358


                                                                     (3 Hours)                                       [Total Marks: 100]

N.B.: (1) Question No.1 is compulsory.
         (2) Attempt any four questions out of remaining six questions.

1. (a) Convert (2009.12)10 into octal and hexadecimal. [4 Marks]
    (b) Design (1:16) demultiplexer using (1:4). [4 Marks]
    (c) Design a full subtractor using a decoder and additional gates. [4 Marks]
    (d) Simplify and implement using gates: [4 Marks]
              

   (e) State and prove DeMorgan's theorems. [4 Marks]

2. (a) Simplify using K-map, obtain POS equation and realize using NOR gates : [10 Marks]
              f(A,B,C,D) = πm(1,2,3,4,5,9,10,11).d(6,8).
    (b) Draw a twisted ring counter and prove that it is "Divide by 2 N" circuit, where 'N' is
         number of flip flops. Show necessary timing diagrams. [10 Marks]

3. (a) Prove NAND as universal gate. [10 Marks]
    (b) Compare TTL, CMOS and ECL families with respect to basic gate, voltage levels,
          fan-in, fan-out, propagation delay, power dissipation and noise margin. [10 Marks]   

4. (a) Simplify using Quine McClusky method and realize using any universal gate: [10 Marks]
          F(P,Q,R,S) = ∑m(1,2,6,8,10,11,14,15) + d(5,9).
    (b) Implement the following expression using 8:1 MUX. [10 Marks]
          f(A,B,C,D) = ∑m(0,1,3,5,7,10,11,13,14,15).

5. (a) Design a 3-bit even and odd parity generator. [10 Marks]
    (b) Design a maximum length sequence generator, to generate the sequence 1101001
         and repeat. [10 Marks]

6. (a) Design a 2-bit digital comparator that  accepts inputs A and B and gives three outputs
         G, E and L. [10 Marks]
             (i) Output G is active, when A>B.
            (ii) Output E is active, when A=B.
           (iii) Output L is active, when A<B.
     (b) Draw a 4-bit universal shift register and explain. [10 Marks]

7. Write short notes on the following: - [20 Marks]
     (a) Totem pole output stage of TTL gate.
     (b) Priority Encoder
     (c) Current and voltage parameters of logic gates.
     (d) Race around condition in J-K Flip Flop.             

Thursday, May 22, 2014

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2009 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2009 COMPUTER SCIENCE SEMESTER 3

Con.2721-09.                                        (REVISED COURSE)                  VR-3327

                                                                    (3 Hours)                           [Total Marks: 100]

N.B.: (1) Question No.1 is compulsory.
         (2) Attempt any four questions out of remaining six questions.

1. (a) Convert (670.17)8 into decimal, binary and hex. [6 Marks]
    (b) Design 16:1 MUX using 4:1 MUX. [6 Marks]
    (c) Design a full subtractor using only NAND gates. [4 Marks]
    (d) Simplify the following using Boolean laws : [4 Marks]
            (i) 
           (ii)  

2. (a) Simplify using K-map, obtain SOP equation and realize using only NAND gates. [10 Marks]
           f(A,B,C,D) = πM(1,2,3,8,9,10,11,14) + d(7,15).
    (b) Consider a chemical mixing tank for which there are 3 variables of interest: [10 Marks]
          Liquid level, pressure and temperature. The alarm will be triggered under the
          following conditions:
          (i) Low level with high pressure
         (ii) High level with low pressure
        (iii) High level with low temperature and high pressure
              Design the system, implement using only NOR gates.

3. (a) Design BCD to 7-segment code converter. [10 Marks]
    (b) Draw the 2-input TTL NAND gate and explain. List important characteristics of TTL
          family. [10 Marks]

4. (a) Design BCD adder using 4-bit binary adder and explain. [10 Marks]
    (b) Design a MOD-6 synchronous up-counter and explain its operation. [10 Marks]

5. (a) Simplify using K-map and realize using NOR gates. [10 Marks]
          f(A,B,C,D)= ∑m(1,3,7,11,15)+d(0,2,5,8,14).
    (b) Draw a 4-bit jhonson counter using shift register and prove that it is "Divide by 4"
         logic. [10 Marks]

6. (a) Simplify using Quine McClusky method. [10 Marks]
          f(A,B,C,D) = πm(0,2,3,6,7,8,9,12,13).
          Realize the equation using any universal gate.
    (b) Implement the following expression using 8:1 MUX. [10 Marks]
         f(A,B,C,D) = ∑m(0,1,5,7,9,10,15)

7. Write short notes on :- [20 Marks]
     (a) DeMorgan's Theorems
     (b) NOR as universal gate
     (c) ALU
     (d) TTL Vs CMOS logic family. 

Wednesday, May 21, 2014

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2011 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2011 COMPUTER SCIENCE SEMESTER 3

Con.6565-11.                                                                                                           MP-4105

                                                       (3 Hours)                                               [Total Marks: 100]


N.B.: (1) Question No.1 is compulsory.
         (2) Attempt any four questions out of remaining six questions.

1. (a) Convert (650.17)8 into decimal, binary and hex. [6 Marks]
    (b) Explain ALU with the help of block diagram. [6 Marks]
    (c) State and explain distributive and associative law for boolean equation. [4 Marks]
    (d) Determine the truth table for the circuit given below:-[4 Marks]
               

2. (a) Design 16:1 MUX using 4:1 MUX. [10 Marks]
    (b) Simplify using K-map obtain SOP equation and realise only by using NAND
         gates. [10 Marks]
                  f(A,B,C,D) = πm(1,2,3,8,9,10,11,14) + d(7,15)

3. (a) Using Quine McCluskey method, determine the minimal SOP form for:- [10 Marks]
          F(A,B,C,D,E,F,G) = εm(20,28,38,39,52,60,102,103,107)
    (b) Design a BCD adder using 4 bit binary adders and explain. [10 Marks]

4. (a) What is shift register? Explain 4 bit bidirectional shift register. [10 Marks]
    (b) Design a MOD-6 synchronous up-counter and explain its operation. [10 Marks]

5. (a) Implement the following expression using 8:1 MUX. [10 Marks]
         f(A,B,C,D) = εm(0,1,3,6,9,11,12,13,15)
    (b) Explain with a neat diagram 2 input TTL NAND gate in detail. [10 Marks]

6. (a) Covert T flip flop to D flip flop. [10 Marks]
    (b) Compare the different logic families with respect to the following parameters: [10 Marks]
          Fan in, Fan out, Noise margin, speed and power dissipation.

7. Write short notes on:- [20 Marks]
     (a) Decade Counters
     (b) Demorgan's Theorems
     (c) Race around condition

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2011 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2011 COMPUTER SCIENCE SEMESTER 3

                                       (3 Hours)                                   [Total Marks: -100]

1. (a) Convert (243.63)8 to decimal, binary and hexadecimal. [6 Marks]
    (b) Perform directly without converting to any other base- [6 Marks]
          (i) (BC 5)H - (A2B)H
         (ii) (210.2)4 + (312.2)4
         (iii) (56)8 x (45)8
    (c) Obtain hamming code for 1010. Prove that hamming code is an error detecting and
          correcting code. [8 Marks]

2. (a) Design a 3 bit binary to gray code converter. [10 Marks]
    (b) Design a full adder circuit using half adder and some gates. [10 Marks]

3. (a) Simplify using Q-M method and implement using NAND gates. [10 Marks]
                   f(A,B,C,D) = ∑m(4,5,8,9,11,12,13,15)
    (b) Implement the following expression using single 4:1 MUX. [10 Marks]
                  f(A,B,C,D) = ∑m(2,6,8,12,13,14)

4. (a) Design a 24 bit comparator using IC 7485. [10 Marks]
    (b) Design 1:28 line Demux using 1:8 Demux. [10 Marks]

5. (a) Design a synchronous counter using JK FF for following sequence:- [10 Marks] 
       
    (b) Convert JK FF to SR and D FF. [10 Marks]

6. (a) Draw a 3 bit ring counter and draw timing wave form. Prove that it is a divide by
         3 network. [10 Marks]
    (b) Explain the operation of 4 bit Universal shift register. [10 Marks]

7. Write short notes on: - [20 Marks]
      (a) Race around condition in JKFF.
      (b) TTL v/s CMOS
      (c) ALU
      (d) Priority encoder

Tuesday, May 20, 2014

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2012 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2012 COMPUTER SCIENCE SEMESTER 3

Con. 4466                                                                                                        GN-8339

                                                                     (3 Hours)                           [Total Marks:-100]

N.B.: (1) Question No.1 is compulsory.
         (2) Attempt any four from remaining from remaining questions.
         (3) Figures to the right indicate full marks.

1. (a) Convert (54.45)10 into binary, base 4, octal and Hexadecimal Number Systems. [4 Marks]
    (b) Subtract using 1's and 2's complement (15)10-(20)10. [4 Marks]
    (c) Perform BCD addition of the decimal numbers 45 and 27. [4 Marks]
    (d) Represent (25)10 in excess 3 and Gray code. [4 Marks]
    (e) Perform:- i) (11001)2/(101)2 [4 Marks]
                        ii) (11001)2*(101)2

2. (a) Design a 4 bit binary to gray code converter. [10 Marks]
    (b) Design a full Subtractor and implement using basic logic gates. [10 Marks]
 
3. (a) Simplify the following expression using Quine Mc-Cluskey method and implement with 
         universal gates only. [10 Marks]
                   F(A,B,C,D) = ∑M(1,3,4,5,6,7,9,11,12,13,14,15)
    (b) Implement the following using only one 8:1 MUX. [10 Marks]
                   F(A,B,C,D) = ∑m(0,1,2,4,6,7,8,10,14,15)

4. (a) Design 2 bit digital magnitude comparator and implement using NAND gates 
         only. [10 Marks]
    (b) Design a 32:1 multiplexer using 4:1 multiplexers. [10 Marks]

5. (a) Design a mod-6 synchronous counter using JK FF. [10 Marks]
    (b) Covert: - [10 Marks]
          i) SR FF to JK FF
         ii) SR SR to D FF

6. (a) Draw a 4 bit ring counter. Draw the timing diagram and explain the working
          of counter. [10 Marks]
    (b) Explain the working of Universal shift register with the help of suitable
         diagram. [10 Marks]

7. Write short notes on :-
     (a) Error detecting and correcting codes. [5 Marks]
     (b) TTL and CMOS. [5 Marks]
     (c) ALU [5 Marks]
     (d) DeMorgan's Theorems. [5 Marks]

Monday, May 19, 2014

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2012 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2012 COMPUTER SCIENCE SEMESTER 3

Con. 7376-12.                                                                                                     KR-3410

                                                              (3 Hours)                                       [Total Marks : 100]

N.B.: (1) Question No.1 is compulsory.
         (2) Solve any four out of the remaining six questions.
         (3) Draw neat diagram wherever necessary.

1. (a) Using Quine Mc-cluskey method, determine the minimal SoP form for- [10 Marks]
          F(A,B,C,D) = ∑m(4,5,8,9,11,12,13,15)
    (b) Obtain the hamming code fro 1010. Prove that hamming code is an error detecting and
          correcting code. [10 Marks]

2. (a) Implement the following using 8:1 MUX [10 Marks]
         F(A,B,C,D) = ∑m(0,1,2,4,6,7,8,10,14,15)
     (b) Draw a 4 bit ring counter. Draw the timing diagram and explain the working
          of counter. [10 Marks]

3. (a) Design a sequence generator using T flip flop for the given sequence. Also identify and check
         for lock out condition (if any) : - [10 Marks] 
        
    (b) Using K-map method of minimization technique simplify [10 Marks]
          F(A,B,C,D) = m(1,2,3,8,9,10,11,14) + d(7,15)

4. (a) Explain the operation of a 4 bit universal shift register. [10 Marks]
    (b) Design a full adder circuit using half adders and some gates. [10 Marks]

5. (a) Covert: - SR to JK flip flop
                        SR to  D flip flop
    (b) Compare the different logic families with respect to the following parameters- Fan in, Fan out,
          Noise margin, speed and power dissipation. [10 Marks]     

6. (a) Convert (243.63)8 to decimal, binary (210.2)4 +(312.2)4. [10 Marks]
    (b) Draw and design a combinational circuit that multiplies two 2 bit numbers A1 A2 and
          B1 B2 to produce a 4 bit product C3 C2 C1 C0. [10 Marks]

7.  Write short notes on :- [20 Marks]
      (a) De morgans theorem
      (b) Decade counters
      (c) Race around condition in JK flip flop
      (d) PLA and PAl.

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2013 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) MAY 2013 COMPUTER SCIENCE SEMESTER 3


Con. 9152-13.                                                                                              GS-6420

                                                              (3 Hours)                               [Total Marks : -100]

N.B.: (1) Question No.1 is compulsory.
         (2) Solve any four out of the remaining six question.
         (3) Draw neat diagram whenever necessary.

1. (a) Convert (1234.56)10 to octal, hexadecimal. [4 Marks]
    (b) Represent (29)10 into XS-3 and Gray code. [4 Marks]
    (c) Design full adder using half adders. [4 Marks]
    (d) Design a full subtractor using a decoder and additional gates. [4 Marks]
    (e) Simplify and implement using gates. [4 Marks]
            
2. (a) What is canonical SOP and POS form? Explain with an example. [5 Marks]
    (b) Implement the following using only one 8:1 MUX and few gate. [5 Marks]
                   F(A,B,C,D) = ∑m(0,3,5,7,9,13,15)
    (c) Using the K-map method minimization technique simplify and draw the circuit for
         the following function. [10 Marks]
         F(A,B,C,D,E) = ∑m(0,1,2,3,4,5,7,8,9,11,14,16,17,18,19) +d(24,25)
3. (a) Simplify using Quine Mc-Cluskey method. Realize the equation using any universal 
         gate. [10 Marks]
         F(A,B,C,D) = πM(0,2,3,6,7,8,9,12,13)
    (b) Design a BCD adder using 4 bit binary adders and explain. [10 Marks]

4. (a) Design a 3 bit even and odd parity generator. [10 Marks]
    (b) State truth table of 3 bit gray to binary conversion and design using 3:8 decoder and
          additional gates. [10 Marks]

5. (a) Design MOD-6 synchronous counter and explain its operation. [10 Marks]
    (b) Draw a 4 bit universal shift register and explain. [10 Marks]

6. (a) Design 4 bit ring counter using Jk ff, draw the timing diagram for the same. [10 Marks]
    (b) Compare TTL and CMOS logic families.

Write notes on the following (any four) :- [20 Marks]
 (a) ALU(Arithmatic Logic Unit)
 (b) PAL and PLA
 (c) Race around condition
 (d) Error detecting and correcting code
 (e) Applications of flip flops and registers

Friday, May 16, 2014

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2013 COMPUTER SCIENCE SEMESTER 3

DIGITAL LOGIC DESIGN AND ANALYSIS (DLDA) DECEMBER 2013 COMPUTER SCIENCE SEMESTER 3

Con. 8955-13                                                                                                   GX-12152

                                                    (3 Hours)                                            [Total Marks : -80]

N.B.: (1) Question No.1 is compulsory.
         (2) Solve any three questions from the remaining.
         (3) All questions carry equal marks.
         (4) Figures to the right indicate marks.
         (5) Assume suitable data if required.

1. (a) State De-morgan's Theorems. Convert the following (761.514)8 to binary and
          hexadecimal. [5 Marks]
    (b) Subtract the following using method given below: [5 Marks]
          (i) (11)10-(22)10 using 2's complement.
          (ii) (33)10-(44)10 using one's complement.
    (c) Write short note on Ring Counter using 'D' FF. [5 Marks]
    (d) Compare FPGA and CPLD. [5 Marks]

2. (a) Perform the following directly without converting to any other base. [5 Marks]
         (i) (63)8 * (21)8
         (ii) (D9)H - (80)H
     (b) (i) Simplify the boolean expression
            
           (ii) Express it is standard POS form
             
      (c) Simplify the logic function using K-map. [5 Marks]
            f(A,B,C,D) = ∑m(4,5,6,7,8,10,12) + d(2,9,11)
            Draw the logic diagram using NAND gates only.
       (d) Explain Astable multivibrator using op-amp with neat wave forms. [5 Marks]

3. (a) Design a sequence generator to generate the sequence using 'D' FF 1101001 and repeat.
         Draw neat state diagram and ckt.diagram. [10 Marks]
    (b) Implement the following logic function using all 4:1 multiplexers with select inputs as
         'B', 'C', 'D', 'E' only. [10 Marks]
          F(A,B,C,D,E) = ∑(0,1,3,6,8,9,10,13,15,17,20,24,30).
4. (a) Explain 3 bit Biodirectional shift register using JK Flip Flop. Draw the neat
         waveforms. [10 Marks]
    (b) What is FPGA. Explain basic architecture. What are its advantages over CPLD. [10 Marks]

5. (a) Design Full adder using 3:8 decoder with active low output and NAND gates. [5 Marks]
    (b) Use Quine Mc-Cluskey method to simplify the logic function as given below.
         F(A,B,C,D,E) = ∑m(0,1,8,10,11,12,20,21,30) + d(14, 19). Realize the above function
         using NAND gates. [15 Marks]

6. (a) Design mod-10 synchronous counter using JK Flip Flop. Check for the lock out condition.
         If so, how the lock out condition can be avoided? Draw the neat state diagram and circuit
         diagram with Flip Flops. [15 Marks] 
    (b) Explain the transfer characteristics of TTL NAND gate and hence define Fan-in and
         Fan-out. [5 Marks]