All Exams  >   GATE Physics  >   Electronics for GATE  >   All Questions

All questions of Digital Electronics for GATE Physics Exam

The minimum number of NAND gates required to implement ?
    Correct answer is '0'. Can you explain this answer?

    Vedika Singh answered

    Hence, minimum number of NAND gates required to implement
     is zero.
    The correct answer is: 0

    How many entries will be in the truth table of a 4-input NAND gate?
    • a)
      6
    • b)
      8
    • c)
      16
    • d)
      32
    Correct answer is option 'C'. Can you explain this answer?

    A NAND gate is a universal logic gate that performs the negation (NOT) of an AND logic operations in digital circuits. 
    As we know, 
    Y = 2
    Y number of Entries in the truth table Where, n = number of inputs.

    If the output of a logic gate is 0 only when all its inputs are at logic 1, then which of the following are/is not the corresponding gate?
    • a)
      AND
    • b)
      NAND
    • c)
      NOR
    • d)
      NOT
    Correct answer is option 'A,C,D'. Can you explain this answer?

    Aditi Basak answered
    Truth table is,

    This is truth table for NAND gate.
    The gate whose output is low if and only if all inputs are high, is NAND.
    The logic NAND gate is a combination of a digital logic AND gate and a NOT gate connected together in series.
    A NAND gate (NOT-AND) is a logic gate which produces an output which is false only if all its inputs are true; thus its output is complement to that of an AND gate. A LOW (0) output results only if all the inputs to the gate are HIGH (1); if any input is LOW (0), a HIGH (1) output results.

    If two input terminals of NAND gate are shorted, then the output for both the input being zero is ?
      Correct answer is '1'. Can you explain this answer?

      Utkarsh Shukla answered
      Explanation:

      When the two input terminals of a NAND gate are shorted, it means that both inputs are connected together. Let's analyze the behavior of a NAND gate under this condition.

      Truth Table of NAND Gate:
      A NAND gate is a logic gate that produces an output of 0 only when all of its inputs are 1. Otherwise, the output is always 1.

      | A | B | Output |
      |---|---|--------|
      | 0 | 0 | 1 |
      | 0 | 1 | 1 |
      | 1 | 0 | 1 |
      | 1 | 1 | 0 |

      Case 1: Both Inputs are 0:
      When both input terminals of a NAND gate are shorted and set to 0, it means that the same 0 voltage is applied to both inputs simultaneously. According to the truth table, when both inputs are 0, the output is 1.

      Case 2: One or Both Inputs are 1:
      In this case, at least one of the inputs is 1. According to the truth table, when any input is 1, the output of the NAND gate will always be 0.

      Therefore, when both input terminals of a NAND gate are shorted, the output will be 1 only when both inputs are 0. In all other cases, when one or both inputs are 1, the output will be 0.

      Summary:
      - When both inputs of a NAND gate are shorted, the output is 1 only when both inputs are 0.
      - If one or both inputs are 1, the output of a NAND gate will always be 0, regardless of whether the inputs are shorted or not.

      The binary number 110000111101 corresponds to a hexadecimal number. 
      • a)
        CFD
      • b)
        DBF 
      • c)
        D3C
      • d)
        C3D
      Correct answer is option 'D'. Can you explain this answer?

      Bhavana Pillai answered
      Hexadecimal is written with 16 numbers starting from 0, i.e., 0, 1,2, 3,...14, 15. The number 10 → A; 11 → B; 12 → C; 13 → D; 14 → E; 15 → F in place of two digits. To convert binary number in hexadecimal make the pairs of four numbers starting from right. Then convert them in decimal then hexadecimal e.g. (110000111101) ⇔ [(1100) (0011) (1101)2] in binary number ⇔ [(12) (3) (13) ] in decimal
      = C3D is the equivalent hexadecimal number
      The correct answer is: C3D

      Inputs given to a logic gate are A and B and its output is X. If A = 1, B = 0, then X = 1. What type of gate this could be?
      • a)
        OR
      • b)
        NAND
      • c)
        AND
      • d)
        NOR
      Correct answer is option 'A,B'. Can you explain this answer?

      Vaibhav Ghosh answered

       clearly it follows OR gate. 


      Thus, it also follows NAND gate 
        it is an AND gate 
       it is not a NOR gate. 
      Therefore, the correct options are (b, c)
      The correct answers are: NAND, OR

      The number 6.25 in the decimal notation, when converted to the binary notation will read as ?
        Correct answer is '110.01'. Can you explain this answer?

        Aashna Shah answered

        Hence, 6 =110
        Now 0.25 x 2 = 0.50 → 0
        0.50 x 2 = 1.00 → 1
        0.00 x 2 = 0 → 0
        Hence, 0.25 = 0.010 →1
        Hence (6.25)2 = 110.010
        The correct answer is: 110.01

        The circuit shown in the figure below functions as
        • a)
          AND gate
        • b)
          NAND gate 
        • c)
          OR gate 
        • d)
          NOR gate
        Correct answer is option 'C'. Can you explain this answer?

        Partho Gupta answered
        When A is high and B is low i.e. A = 1, B = 0 transistor A conducts and Y becomes high, i.e. Y = 1. If A = 0 and B = 1; transistor B conducts Y = 1, if A = 1 and B = 1; both transistors conduct. If A = B = 0. None of the transistors conducts hence Y= 0. The true table is shown below.

        The correct answer is: OR gate

        Which of the following sets of values given below satisfy the Boolean relation 
        • a)
          P = 0, Q = 0, R = 0
        • b)
          P = 1, Q = 0, R = 1
        • c)
          P = 1, Q = 1, R = 0
        • d)
          P = 1, Q = 1, R = 1
        Correct answer is option 'A,B,C'. Can you explain this answer?

        Vandana Chopra answered
        The realization of the algebraic expression   in terms of logic gate is

        Truth table.

        Hence, (a), (c), (d)
        The correct answers are: P = 0, Q = 0, R = 0, P = 1, Q = 0, R = 1, P = 1, Q = 1, R = 0

        Which of the following options is false for a two input XOR gate?
        • a)
        • b)
        • c)
        • d)
        Correct answer is option 'B,C,D'. Can you explain this answer?

        Pie Academy answered

        The truth table for XOR gate is


        The incorrect options are (b), (c), (d).
        So answers are: (b), (c), (d).

        The following circuit  does not performs the operation of.
        • a)
          NAND gate for a negative logic system
        • b)
          AND gate for a positive logic system
        • c)
          AND gate for a negative logic system
        • d)
          OR gate for a negative logic system
        Correct answer is option 'A,B,C'. Can you explain this answer?

        Pranavi Mishra answered
        If either V1 or V2 is high, we get a high in output, hence it each like an OR gate.
        The correct answers are: NAND gate for a negative logic system, AND gate for a positive logic system, AND gate for a negative logic system

        The number of bits that a digital computer can process in parallel at a time is called :
        • a)
          binary digit
        • b)
          PACE
        • c)
          word length
        • d)
          byte
        Correct answer is option 'C'. Can you explain this answer?

        Pie Academy answered
        The number of bits a digital computer can process in parallel at a time is referred to as the word length. This term defines the width of the data the computer can process in one cycle, often indicating the number of bits handled at once.
        • Binary digit (Option A) refers to a single bit, either 0 or 1, which is too small a unit for this question.
        • PACE (Option B) does not apply to the concept of processing bits in parallel.
        • Byte (Option D) refers to a group of 8 bits, but it's not a term for processing multiple bits at once.
        Thus, the best option is C: word length.

        The Boolean expression   can be realized by how many minimum number of gates?
          Correct answer is '1'. Can you explain this answer?

          Sagarika Yadav answered

          Hence one two input AND gate is required.
          ∴ Minimum number of gate = 1.
          The correct answer is: 1

          In the given figure, circuit  performs the operation of :
          • a)
            AND gate for a positive logic system
          • b)
            OR gate for a negative logic system
          • c)
            NAND gate for a negative logic system
          • d)
            AND gate for a negative logic system
          Correct answer is option 'B'. Can you explain this answer?

          Sarthak Chavan answered
          If either V1 is positive or V2 is positive, V0 be positive, otherwise we get a low output for both V1 and V2 negative. Hence it acts as an OR gate.
          The correct answer is: OR gate for a negative logic system

          The logic function is defined as:
          f = [(x AND y) OR (z AND NOT x)] AND [NOT (x XOR z)]
          Evaluate the output of the function for:
          • x = 1
          • y = 0
          • z = 1
          Correct answer is '0'. Can you explain this answer?

          Pie Academy answered
          Solution:
          • Step 1: Simplify the first part:
            • (x AND y):
            • x = 1, y = 0 → (x AND y) = 1 AND 0 = 0.
            • (z AND NOT x):
            • z = 1, NOT x = 0 → (z AND NOT x) = 1 AND 0 = 0.
            • (x AND y) OR (z AND NOT x):
            • 0 OR 0 = 0.
          • Step 2: Simplify the second part:
            • (x XOR z):
            • x = 1, z = 1 → (x XOR z) = 0 (since XOR is true only if inputs are different).
            • NOT (x XOR z) = NOT 0 = 1.
          • Step 3: Combine both parts:
            • f = [(x AND y) OR (z AND NOT x)] AND [NOT (x XOR z)]
            • f = 0 AND 1 = 0.
          Final Answer:
          The value of f is 0.

          What is the output for X = 1, Y = 0 for the logic circuit drawn below :
            Correct answer is '1'. Can you explain this answer?

            Preethi Joshi answered
            The truth table for the above circuit is.

            Hence, for X = 1, Y = 0, output = 1
            The correct answer is: 1 

            Chapter doubts & questions for Digital Electronics - Electronics for GATE 2025 is part of GATE Physics exam preparation. The chapters have been prepared according to the GATE Physics exam syllabus. The Chapter doubts & questions, notes, tests & MCQs are made for GATE Physics 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.

            Chapter doubts & questions of Digital Electronics - Electronics for GATE in English & Hindi are available as part of GATE Physics exam. Download more important topics, notes, lectures and mock test series for GATE Physics Exam by signing up for free.

            Electronics for GATE

            55 videos|28 docs|20 tests

            Top Courses GATE Physics