computer-nec-license
  • NEC-Computer
  • 1. Concept of Basic Electrical and Electronics Engineering
    • 1.1 Basic Concepts
    • 1.2 Network Theorems
    • 1.3 Alternating Current Fundamentals
    • 1.4 Semiconductor Device
    • 1.5 Signal Generator
    • 1.6 Amplifiers
    • MCQs
      • MCQs On Basic Electrical
        • set-1
        • set-2
      • MCQs On Basic Electronics
        • set-1
        • set-2
  • 2. Digital Logic and Microprocessor
    • 2.1 Digital Logic
    • 2.2 Combinational & Arithmetic Circuit
    • 2.3 Sequential Logic Circuits
    • 2.4 Microprocessor
    • 2.5 Microprocessor System
    • 2.6 Interrupt Operations
    • MCQs
      • MCQs On Digital Logic
        • set-1
        • set-2
        • set-3
        • set-4
        • set-5
        • set-6
        • set-7
        • set-8
        • set-9
        • set-10
        • set-11
        • set-12
      • MCQs On Microprocessor
        • set-1
        • set-2
        • set-3
        • set-4
        • set-5
        • set-6
        • set-7
        • set-8
        • set-9
  • 3. Programming Language and Its Applications
    • 3.1 Introduction to C Programming
    • 3.2 Pointers, Structures, and Data Files
    • 3.3 C++ Language Constructs with Objects and Classes
    • 3.4 Features of Object-Oriented Programming
    • 3.5 Pure Virtual Functions and File Handling
    • 3.6 Generic Programming and Exception Handling
    • MCQs
      • set-1
      • set-2
      • set-3
      • set-4
      • set-5
  • 4. Computer Organization and Embedded System
    • 4.1 Control and CPU
    • 4.2 Computer Arithmetic and Memory System
    • 4.3 I/O Organization and Multiprocessor
    • 4.4 Embedded System Design
    • 4.5 Real-Time Operating and Control Systems
    • 4.6 Hardware Description Language (VHDL) and IC Technology
    • MCQs
      • set-1
      • set-2
      • set-3
      • set-4
      • set-5
      • set-6
      • set-7
      • set-8
      • set-9
      • set-10
      • set-11
  • 5. Concept of Computer Network and Network Security System
    • 5.1 Introduction to Computer Networks
    • 5.2 Data Link Layer
    • 5.3 Network Layer
    • 5.4 Transport Layer
    • 5.5 Application Layer
    • 5.6 Network Security
    • MCQs
      • Basic Networking
        • set-1
        • set-2
      • Advanced Networking
        • set-1
        • set-2
        • set-3
        • set-4
        • set-5
        • set-6
  • 6. Theory of Computation and Computer Graphics
    • 6.1 Introduction to Finite Automata
    • 6.2 Introduction to Context-Free Languages (CFL)
    • 6.3 Turing Machines (TM)
    • 6.4 Introduction to Computer Graphics
    • 6.5 Two-Dimensional Transformation
    • 6.6 Three-Dimensional Transformation
    • MCQs
      • MCQs on Theory of Computation
        • set-1
        • set-2
        • set-3
      • MCQs On Computer Graphics
        • set-1
        • set-2
        • set-3
        • set-4
        • set-5
        • set-6
  • 7. Data Structures and Algorithm, Database System and Operating System
    • 7.1 Introduction to Data Structures, Lists, Linked Lists, and Trees
    • 7.2 Sorting, Searching, Hashing and Graphs
    • 7.3 Introduction to Data Models, Normalization, and SQL
    • 7.4 Transaction Processing, Concurrency Control, and Crash Recovery
    • 7.5 Introduction to Operating System and Process Management
    • 7.6 Memory Management, File Systems, and System Administration
    • MCQs
      • MCQs ON DSA
        • set-1
        • set-2
        • set-3
        • set-4
        • set-5
        • set-6
      • MCQs On DBMS
        • set-1
        • set-2
      • MCQs On Operating System
        • set-1
        • set-2
        • set-3
        • set-4
        • set-5
        • set-6
        • set-7
        • set-8
        • set-9
        • set-10
        • set-11
        • set-12
  • 8. Software Engineering and Object-Oriented Analysis & Design
    • 8.1 Software Process and Requirements
    • 8.2 Software Design
    • 8.3 Software Testing, Cost Estimation, Quality Management, and Configuration Management
    • 8.4 Object-Oriented Fundamentals and Analysis
    • 8.5 Object-Oriented Design
    • 8.6 Object-Oriented Design Implementation
    • MCQs
      • set-1
      • set-2
      • set-3
      • set-4
      • set-5
      • set-6
      • set-7
      • set-8
      • set-9
  • 9. Artificial Intelligence and Neural Networks
    • 9.1 Introduction to AI and Intelligent Agents
    • 9.2 Problem Solving and Searching Techniques
    • 9.3 Knowledge Representation
    • 9.4 Expert System and Natural Language Processing
    • 9.5 Machine Learning
    • 9.6 Neural Networks
    • MCQs
      • set-1
      • set-2
      • set-3
      • set-4
      • set-5
      • set-6
      • set-7
      • set-8
      • set-9
  • 10. Project Planning, Design and Implementation
    • 10.1 Engineering Drawings and Its Concepts
    • 10.2 Engineering Economics
    • 10.3 Project Planning and Scheduling
    • 10.4 Project Management
    • 10.5 Engineering Professional Practice
    • 10.6 Engineering Regulatory Body
    • MCQs
      • MCQs On Engineering Drawing
        • set-1
        • set-2
      • MCQs On Engineering Economics
      • MCQs On Project Planning & Scheduling
      • MCQs On Project Mangement
      • MCQs On Engineering Professional Practice
      • MCQs On Engineering Regulatory Body
  • Questions Sets
    • Set 1 (Chaitra, 2080)
      • Short Questions (60*1=60 Marks)
      • Long Questions (20*2=40 Marks)
    • Set 2 (Aasadh, 2081)
      • Short Questions (60*1=60 Marks)
      • Long Questions (20*2=40 Marks)
    • Set 3 (Asojh, 2080)
      • Short Questions (60*1=60 Marks)
      • Long Questions (20*2=40 Marks)
    • Model Set - Computer Engineering By NEC
      • Short Questions (60*1=60 Marks)
      • Long Questions (20*2=40 Marks)
    • Model Set - Software Engineering By NEC
      • Short Questions (60*1=60 Marks)
      • Long Questions (20*2=40 Marks)
  • Tips & Tricks
Powered by GitBook
On this page
  1. 2. Digital Logic and Microprocessor
  2. MCQs
  3. MCQs On Digital Logic

set-1

MCQs

1. Hexadecimal can express in one digit what is done by following binary number of binary digits:

  1. One\text{One}One

  2. Four\text{Four}Four

  3. Two\text{Two}Two

  4. Eight\text{Eight}Eight

Show me the answer

Answer: 2. Four\text{Four}Four

Explanation:

  • Hexadecimal (base-16) uses one digit to represent 4 binary digits (bits).

  • This is because 24=162^4 = 1624=16, so one hexadecimal digit can represent 16 unique values, equivalent to 4 binary digits.

2. NAND gates are preferred over others because these have:

  1. Have lower fabrication area\text{Have lower fabrication area}Have lower fabrication area

  2. Can be used to make any gate\text{Can be used to make any gate}Can be used to make any gate

  3. Consume less electronic power\text{Consume less electronic power}Consume less electronic power

  4. Provide maximum density in a chip\text{Provide maximum density in a chip}Provide maximum density in a chip

Show me the answer

Answer: 2. Can be used to make any gate\text{Can be used to make any gate}Can be used to make any gate

Explanation:

  • NAND gates are universal gates, meaning they can be used to construct any other logic gate (AND, OR, NOT, etc.).

  • This flexibility makes them highly preferred in digital circuit design.

  • For example:

    • A NOT gate can be made using a NAND gate by connecting both inputs together.

    • An AND gate can be made by combining two NAND gates.

3. According to De Morgan’s theorem, A+B‾=\overline{A + B} =A+B​=

  1. A‾⋅B‾\overline{A} \cdot \overline{B}A⋅B

  2. A‾+B‾\overline{A} + \overline{B}A+B

  3. A⋅BA \cdot BA⋅B

  4. A+BA + BA+B

Show me the answer

Answer: 1. A‾⋅B‾\overline{A} \cdot \overline{B}A⋅B

Explanation:

  • De Morgan’s theorem states that the complement of a sum is equal to the product of the complements: A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B}A+B​=A⋅B

  • This is one of the fundamental laws in Boolean algebra and is widely used in simplifying logic expressions.

4. According to De Morgan’s theorem, A⋅B‾=\overline{A \cdot B} =A⋅B=

  1. A‾+B‾\overline{A} + \overline{B}A+B

  2. A‾⋅B‾\overline{A} \cdot \overline{B}A⋅B

  3. A+BA + BA+B

  4. A⋅BA \cdot BA⋅B

Show me the answer

Answer: 1. A‾+B‾\overline{A} + \overline{B}A+B

Explanation:

  • De Morgan’s theorem states that the complement of a product is equal to the sum of the complements: A⋅B‾=A‾+B‾\overline{A \cdot B} = \overline{A} + \overline{B}A⋅B=A+B

  • This is another fundamental law in Boolean algebra and is used to simplify complex logic expressions.

5. The logic unit shown below is of the type:

  1. AND\text{AND}AND

  2. NAND\text{NAND}NAND

  3. OR\text{OR}OR

  4. NOT\text{NOT}NOT

Show me the answer

Answer: 1. AND\text{AND}AND

Explanation:

  • The logic unit described in the question performs the AND operation, which outputs true only when all inputs are true.

  • For example:

    • If inputs are A and B, the output is true only if both A and B are true.

6. The truth table shown below is for a:

Input A
Input B
Output (A AND B)

0

0

0

0

1

0

1

0

0

1

1

1

  1. NAND gate\text{NAND gate}NAND gate

  2. OR gate\text{OR gate}OR gate

  3. AND gate\text{AND gate}AND gate

  4. NOT gate\text{NOT gate}NOT gate

Show me the answer

Answer: 3. AND gate\text{AND gate}AND gate

Explanation:

  • The truth table matches the behavior of an AND gate, where the output is true only when all inputs are true.

  • For example:

    • If inputs are A and B, the output is true only if both A and B are true.

7. Odd parity of a word can be conveniently tested by:

  1. OR gate\text{OR gate}OR gate

  2. NOR gate\text{NOR gate}NOR gate

  3. AND gate\text{AND gate}AND gate

  4. XOR gate\text{XOR gate}XOR gate

Show me the answer

Answer: 4. XOR gate\text{XOR gate}XOR gate

Explanation:

  • An XOR gate can be used to test odd parity because it outputs true when the number of true inputs is odd.

  • For example:

    • If the input word has an odd number of 1s, the XOR gate will output 1 (true).

8. A record at the end of a file which contains control total is:

  1. Pointers\text{Pointers}Pointers

  2. Trunk\text{Trunk}Trunk

  3. Trailer\text{Trailer}Trailer

  4. Trunkey\text{Trunkey}Trunkey

Show me the answer

Answer: 3. Trailer\text{Trailer}Trailer

Explanation:

  • A trailer record is typically found at the end of a file and contains control totals or summary information.

9. Binary means:

  1. Three\text{Three}Three

  2. Ten\text{Ten}Ten

  3. Two\text{Two}Two

  4. Eight\text{Eight}Eight

Show me the answer

Answer: 3. Two\text{Two}Two

Explanation:

  • Binary refers to a base-2 number system, which uses only two digits: 0 and 1.

10. The digits used in a binary number system are:

  1. 9 and 09 \text{ and } 09 and 0

  2. 1 and 21 \text{ and } 21 and 2

  3. 0 and 10 \text{ and } 10 and 1

  4. 3 and 43 \text{ and } 43 and 4

Show me the answer

Answer: 3. 0 and 10 \text{ and } 10 and 1

Explanation:

  • The binary number system uses only two digits: 0 and 1.

11. Names, numbers, and other information needed to solve a problem are called:

  1. Program\text{Program}Program

  2. Data\text{Data}Data

  3. Instruction\text{Instruction}Instruction

  4. Controls\text{Controls}Controls

Show me the answer

Answer: 2. Data\text{Data}Data

Explanation:

  • Data refers to the raw information, such as names and numbers, that is used to solve a problem.

12. The sequence of instructions that tells the computer how to process the data is called:

  1. Data\text{Data}Data

  2. Controls\text{Controls}Controls

  3. Program\text{Program}Program

  4. Instruction\text{Instruction}Instruction

Show me the answer

Answer: 3. Program\text{Program}Program

Explanation:

  • A program is a sequence of instructions that tells the computer how to process data.

13. Computer ICs work reliably because they are based on:

  1. Top-button design\text{Top-button design}Top-button design

  2. Two-stage design\text{Two-stage design}Two-stage design

  3. System design\text{System design}System design

  4. Two-status design\text{Two-status design}Two-status design

Show me the answer

Answer: 3. System design\text{System design}System design

Explanation:

  • Computer ICs are designed systematically to ensure reliability and functionality.

14. When a transistor is cut off or saturated, transistor variations have almost no effect:

  1. Wave\text{Wave}Wave

  2. Stage\text{Stage}Stage

  3. Variations\text{Variations}Variations

  4. Circuits\text{Circuits}Circuits

Show me the answer

Answer: 3. Variations\text{Variations}Variations

Explanation:

  • When a transistor is in cutoff or saturation, small variations in its parameters have minimal impact on its operation.

15. A group of devices that store digital data is called:

  1. Circuits\text{Circuits}Circuits

  2. Variations\text{Variations}Variations

  3. Register\text{Register}Register

  4. Bit\text{Bit}Bit

Show me the answer

Answer: 3. Register\text{Register}Register

Explanation:

  • A register is a group of devices (flip-flops) used to store digital data.

16. The abbreviation for binary digit is:

  1. 0 and 10 \text{ and } 10 and 1

  2. Base\text{Base}Base

  3. Binary\text{Binary}Binary

  4. Bit\text{Bit}Bit

Show me the answer

Answer: 4. Bit\text{Bit}Bit

Explanation:

  • The term "bit" is short for "binary digit," which is the smallest unit of data in computing.

17. A byte is a string of:

  1. Two bits\text{Two bits}Two bits

  2. Eight bits\text{Eight bits}Eight bits

  3. Four bits\text{Four bits}Four bits

  4. Ten bits\text{Ten bits}Ten bits

Show me the answer

Answer: 2. Eight bits\text{Eight bits}Eight bits

Explanation:

  • A byte consists of 8 bits and is a fundamental unit of data in computing.

18. The control and arithmetic-logic sections are called the:

  1. Block diagram\text{Block diagram}Block diagram

  2. Input/output unit\text{Input/output unit}Input/output unit

  3. Control unit\text{Control unit}Control unit

  4. Central Processing Unit (CPU)\text{Central Processing Unit (CPU)}Central Processing Unit (CPU)

Show me the answer

Answer: 4. Central Processing Unit (CPU)\text{Central Processing Unit (CPU)}Central Processing Unit (CPU)

Explanation:

  • The CPU consists of the control unit and the arithmetic-logic unit (ALU), which together perform processing tasks.

19. A microcomputer is a computer that uses a:

  1. Chips\text{Chips}Chips

  2. Microprocessor\text{Microprocessor}Microprocessor

  3. Registers\text{Registers}Registers

  4. Vacuum tube\text{Vacuum tube}Vacuum tube

Show me the answer

Answer: 2. Microprocessor\text{Microprocessor}Microprocessor

Explanation:

  • A microcomputer uses a microprocessor as its central processing unit (CPU).

20. The hexadecimal number system is widely used in analyzing and programming:

  1. Registers\text{Registers}Registers

  2. Microprocessors\text{Microprocessors}Microprocessors

  3. Chips\text{Chips}Chips

  4. Vacuum tubes\text{Vacuum tubes}Vacuum tubes

Show me the answer

Answer: 2. Microprocessors\text{Microprocessors}Microprocessors

Explanation:

  • Hexadecimal is commonly used in microprocessor programming and analysis due to its compact representation of binary data.

21. The hexadecimal digits are 0 to 9 and A to:

  1. E\text{E}E

  2. G\text{G}G

  3. F\text{F}F

  4. D\text{D}D

Show me the answer

Answer: 3. F\text{F}F

Explanation:

  • Hexadecimal digits range from 0 to 9 and A to F, where A = 10, B = 11, ..., F = 15.

22. The main advantage of hexadecimal numbers is the ease of conversion from hexadecimal to:

  1. Decimal\text{Decimal}Decimal

  2. ASCII\text{ASCII}ASCII

  3. Binary\text{Binary}Binary

  4. BCD\text{BCD}BCD

Show me the answer

Answer: 3. Binary\text{Binary}Binary

Explanation:

  • Hexadecimal numbers are easy to convert to binary because each hexadecimal digit corresponds to exactly 4 binary digits.

23. A typical microcomputer may have up to 65,536 registers in its memory. Each of these registers is usually called:

  1. Address\text{Address}Address

  2. Chip\text{Chip}Chip

  3. Registers\text{Registers}Registers

  4. Memory location\text{Memory location}Memory location

Show me the answer

Answer: 4. Memory location\text{Memory location}Memory location

Explanation:

  • Each register in memory is referred to as a memory location, which can store data.

24. Binary-Coded Decimal (BCD) numbers express each digit as a:

  1. Byte\text{Byte}Byte

  2. Bit\text{Bit}Bit

  3. Nibble\text{Nibble}Nibble

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 3. Nibble\text{Nibble}Nibble

Explanation:

  • In BCD, each decimal digit is represented by a 4-bit nibble.

25. BCD numbers are useful whenever decimal information is transferred into or out of a digital system:

  1. Decimal\text{Decimal}Decimal

  2. ASCII\text{ASCII}ASCII

  3. Binary\text{Binary}Binary

  4. Hexadecimal\text{Hexadecimal}Hexadecimal

Show me the answer

Answer: 1. Decimal\text{Decimal}Decimal

Explanation:

  • BCD is used when decimal data needs to be processed or displayed in a digital system.

26. The ASCII code is a 7-bit code for:

  1. Letters\text{Letters}Letters

  2. Other symbols\text{Other symbols}Other symbols

  3. Numbers\text{Numbers}Numbers

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 4. All of the above\text{All of the above}All of the above

Explanation:

  • ASCII codes represent letters, numbers, and other symbols using 7 bits.

27. The binary number 1100 0101 has:

  1. 1 byte1 \text{ byte}1 byte

  2. 4 bytes4 \text{ bytes}4 bytes

  3. 2 bytes2 \text{ bytes}2 bytes

  4. 8 bytes8 \text{ bytes}8 bytes

Show me the answer

Answer: 1. 1 byte1 \text{ byte}1 byte

Explanation:

  • The binary number 1100 0101 is 8 bits long, which is equivalent to 1 byte.

28. How many bytes are there in 1011 1001 0110 1110?

  1. 111

  2. 444

  3. 222

  4. 888

Show me the answer

Answer: 3. 222

Explanation:

  • The binary number 1011 1001 0110 1110 is 16 bits long, which is equivalent to 2 bytes.

29. What is the base of F4C3₁₆ numbers?

  1. 222

  2. 888

  3. 444

  4. 161616

Show me the answer

Answer: 4. 161616

Explanation:

  • The subscript 16 indicates that F4C3 is a hexadecimal number, which has a base of 16.

30. What is the decimal equivalent of 2⁹?

  1. 409640964096

  2. 100010001000

  3. 102410241024

  4. 161616

Show me the answer

Answer: 3. 102410241024

Explanation:

  • 29=5122^9 = 51229=512, but the correct answer is 1024, which is 2102^{10}210. (Note: There seems to be a discrepancy in the question.)

31. What does 4k represent?

  1. 400040004000

  2. 404040

  3. 409640964096

  4. 400400400

Show me the answer

Answer: 3. 409640964096

Explanation:

  • In computing, 4k typically refers to 212=40962^{12} = 4096212=4096.

32. Express 8192 in K units:

  1. 8×103K8 \times 10^3 \text{K}8×103K

  2. 8K8\text{K}8K

  3. 8.192K8.192\text{K}8.192K

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 2. 8K8\text{K}8K

Explanation:

  • 8192 is equivalent to 8K, where 1K = 1024.

33. Solve the following equation for X: X10=110010012X_{10} = 11001001_2X10​=110010012​

  1. 201201201

  2. 214214214

  3. 132132132

  4. 646464

Show me the answer

Answer: 1. 201201201

Explanation:

  • Converting the binary number 11001001 to decimal: 1×27+1×26+0×25+0×24+1×23+0×22+0×21+1×20=2011 \times 2^7 + 1 \times 2^6 + 0 \times 2^5 + 0 \times 2^4 + 1 \times 2^3 + 0 \times 2^2 + 0 \times 2^1 + 1 \times 2^0 = 2011×27+1×26+0×25+0×24+1×23+0×22+0×21+1×20=201.

34. A microprocessor has memory locations from 0000 to 3FFF. Each memory location stores 1 byte. How many bytes can the memory store? Express this in kilobytes.

  1. 4095,4K4095, 4\text{K}4095,4K

  2. 32740,32K32740, 32\text{K}32740,32K

  3. 16384,16K16384, 16\text{K}16384,16K

  4. 46040,46K46040, 46\text{K}46040,46K

Show me the answer

Answer: 3. 16384,16K16384, 16\text{K}16384,16K

Explanation:

  • The range 0000 to 3FFF in hexadecimal is 3FFF16+1=16384103FFF_{16} + 1 = 16384_{10}3FFF16​+1=1638410​ memory locations.

  • Since each location stores 1 byte, the total memory is 16384 bytes, which is 16K (1K = 1024 bytes).

35. If a microcomputer has 64K memory, what are the hexadecimal notations for the first and last memory locations?

  1. 0000,EEEE0000, \text{EEEE}0000,EEEE

  2. 0000,FFFF0000, \text{FFFF}0000,FFFF

  3. 0,640, 640,64

  4. 0000,99990000, 99990000,9999

Show me the answer

Answer: 2. 0000,FFFF0000, \text{FFFF}0000,FFFF

Explanation:

  • 64K memory corresponds to 216=655362^{16} = 65536216=65536 memory locations.

  • The hexadecimal range for 65536 locations is 0000 to FFFF.

36. How many nibbles are there in 1001 0000 0011?

  1. Two\text{Two}Two

  2. One\text{One}One

  3. Three\text{Three}Three

  4. Eight\text{Eight}Eight

Show me the answer

Answer: 3. Three\text{Three}Three

Explanation:

  • A nibble is 4 bits. The binary number 1001 0000 0011 has 12 bits, which is equivalent to 3 nibbles.

37. What is the ASCII code for 'T'?

  1. 101010010101001010100

  2. 101110010111001011100

  3. 101101010110101011010

  4. 101111110111111011111

Show me the answer

Answer: 1. 101010010101001010100

Explanation:

  • The ASCII code for 'T' is 84 in decimal, which is 1010100 in binary.

38. A gate is a logic circuit with one or more input signals but:

  1. Two output signals\text{Two output signals}Two output signals

  2. One output signal\text{One output signal}One output signal

  3. Double output signal\text{Double output signal}Double output signal

  4. More than one output signal\text{More than one output signal}More than one output signal

Show me the answer

Answer: 2. One output signal\text{One output signal}One output signal

Explanation:

  • A logic gate typically has one or more inputs but only one output.

39. An inverter is a gate with only:

  1. One input\text{One input}One input

  2. More than one input\text{More than one input}More than one input

  3. Two inputs\text{Two inputs}Two inputs

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 1. One input\text{One input}One input

Explanation:

  • An inverter (NOT gate) has only one input and one output.

40. An inverter is also called a:

  1. NOT gate\text{NOT gate}NOT gate

  2. OR gate\text{OR gate}OR gate

  3. AND gate\text{AND gate}AND gate

  4. NAND gate\text{NAND gate}NAND gate

Show me the answer

Answer: 1. NOT gate\text{NOT gate}NOT gate

Explanation:

  • An inverter performs the NOT operation, so it is also called a NOT gate.

41. The OR gate has two or more input signals. If any input is high, the output is:

  1. Low\text{Low}Low

  2. 000

  3. High\text{High}High

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 3. High\text{High}High

Explanation:

  • The OR gate outputs high if any of its inputs are high.

42. The number of input words in a truth table always equals:

  1. 10n10^n10n

  2. 4n4^n4n

  3. 2n2^n2n

  4. 8n8^n8n

Show me the answer

Answer: 3. 2n2^n2n

Explanation:

  • For n input variables, the truth table has 2n2^n2n input combinations.

43. The gate that has two or more input signals and requires all inputs to be high to get a high output is:

  1. OR gate\text{OR gate}OR gate

  2. AND gate\text{AND gate}AND gate

  3. NAND gate\text{NAND gate}NAND gate

  4. NOR gate\text{NOR gate}NOR gate

Show me the answer

Answer: 2. AND gate\text{AND gate}AND gate

Explanation:

  • The AND gate outputs high only when all inputs are high.

44. In Boolean algebra, the overbar stands for the NOT operation, and the plus sign stands for the:

  1. AND operation\text{AND operation}AND operation

  2. NAND operation\text{NAND operation}NAND operation

  3. OR operation\text{OR operation}OR operation

  4. NOR operation\text{NOR operation}NOR operation

Show me the answer

Answer: 3. OR operation\text{OR operation}OR operation

Explanation:

  • In Boolean algebra, the plus sign (+) represents the OR operation.

45. In Boolean algebra, the dot sign stands for the:

  1. AND operation\text{AND operation}AND operation

  2. NAND operation\text{NAND operation}NAND operation

  3. OR operation\text{OR operation}OR operation

  4. NOR operation\text{NOR operation}NOR operation

Show me the answer

Answer: 1. AND operation\text{AND operation}AND operation

Explanation:

  • In Boolean algebra, the dot sign (·) represents the AND operation.

46. The inverter, OR gate, and AND gate are called decision-making elements because they can recognize some input words while disregarding others. A gate recognizes a word when its output is:

  1. Words, high\text{Words, high}Words, high

  2. Bytes, high\text{Bytes, high}Bytes, high

  3. Bytes, low\text{Bytes, low}Bytes, low

  4. Character, low\text{Character, low}Character, low

Show me the answer

Answer: 1. Words, high\text{Words, high}Words, high

Explanation:

  • A gate recognizes a specific input combination (word) when its output is high.

47. How many input signals can a gate have?

  1. One\text{One}One

  2. Two only\text{Two only}Two only

  3. More than one\text{More than one}More than one

  4. Both (A) and (B)\text{Both (A) and (B)}Both (A) and (B)

Show me the answer

Answer: 3. More than one\text{More than one}More than one

Explanation:

  • A gate can have one or more input signals, depending on its type.

48. How many output signals can a gate have?

  1. One\text{One}One

  2. Two only\text{Two only}Two only

  3. More than one\text{More than one}More than one

  4. Both (A) and (B)\text{Both (A) and (B)}Both (A) and (B)

Show me the answer

Answer: 1. One\text{One}One

Explanation:

  • A gate typically has only one output signal.

49. The binary equivalent of the octal number 13.54 is:

  1. 1011.10111011.10111011.1011

  2. 1001.11101001.11101001.1110

  3. 1101.11101101.11101101.1110

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 3. 1101.11101101.11101101.1110

Explanation:

  • Converting octal 13.54 to binary:

    • 1 → 001, 3 → 011, 5 → 101, 4 → 100

    • Thus, 13.54₈ = 001011.101100₂ = 1101.1110₂.

50. The octal equivalent of 111010 is:

  1. 818181

  2. 717171

  3. 121212

  4. All of the above\text{All of the above}All of the above

Show me the answer

Answer: 2. 717171

Explanation:

  • Converting binary 111010 to octal:

    • Group the binary digits into sets of three: 111 010

    • 111₂ = 7₈, 010₂ = 2₈

    • Thus, 111010₂ = 72₈.

PreviousMCQs On Digital LogicNextset-2

Last updated 4 months ago