computer MCQs - 9th class Chapter 03 Mcqs

1

Which type of signal changes continuously over time and can have any value within a given range?

A

Digital Signal

B

Binary Signal

C

Analog Signal

D

Discrete Signal

2

What does ADC stand for in the context of digital systems?

A

Analog to Digital Converter

B

Advanced Digital Circuit

C

Analog Data Control

D

Automated Device Compiler

3

Which device converts digital signals back into analog signals, such as for a speaker?

A

ADC

B

CPU

C

ALU

D

DAC

4

In digital circuits, a higher voltage like 5 volts typically represents which binary value?

A

0

B

1

C

-1

D

Both 0 and 1

5

The symbol '.' is used for which basic logical operation in Boolean algebra?

A

OR

B

NOT

C

XOR

D

AND

6

The output of an AND operation is '1' only under which condition?

A

When at least one input is '1'

B

When both inputs are '0'

C

When both inputs are '1'

D

When inputs are different

7

The output of an OR operation is '0' only under which condition?

A

When at least one input is '1'

B

When both inputs are '0'

C

When both inputs are '1'

D

When inputs are different

8

Which operation takes a single binary variable and simply negates its value?

A

AND

B

OR

C

NOT

D

XOR

9

In binary logic as used in an OR gate, what is the result of 1 + 1?

A

2

B

0

C

1

D

10

A Boolean function produces how many outputs?

A

A single binary output

B

Multiple binary outputs

C

An analog output

D

A continuous output

11

Who is credited with inventing the Boolean algebra that laid the basis for the digital revolution?

A

Isaac Newton

B

Albert Einstein

C

Alan Turing

D

George Boole

12

An AND gate combined with a NOT gate creates which type of logic gate?

A

OR gate

B

XOR gate

C

NOR gate

D

NAND gate

13

Which logic gate outputs true only when exactly one of its inputs is true?

A

NAND

B

XOR

C

AND

D

OR

14

The Boolean law A + 0 = A is known as which law?

A

Null Law

B

Identity Law

C

Idempotent Law

D

Complement Law

15

The Boolean law A + 1 = 1 is known as which law?

A

Identity Law

B

Idempotent Law

C

Null Law

D

Absorption Law

16

The law A + A = A is an example of which Boolean law?

A

Complement Law

B

Associative Law

C

Distributive Law

D

Idempotent Law

17

According to the Complement Law, what is the result of A + Ā?

A

0

B

A

C

1

D

Ā

18

The Commutative Law states that A + B is equal to?

A

A . B

B

B + A

C

A + A

D

B . B

19

What is the result of the Double Negation Law applied to Ā?

A

Ā

B

0

C

1

D

A

20

What is the simplification of A + (A . B) according to the Absorption Law?

A

B

C

A . B

D

1

21

What is the dual of the Boolean expression A + 1 = 1?

A

A . 0 = 0

B

A . 1 = 1

C

A + 0 = 0

D

A + A = A

22

A half-adder circuit is designed to add how many single-bit binary digits?

A

One

B

Two

C

Three

D

Four

23

A half-adder circuit has two inputs (A, B) and how many outputs?

A

One output (Sum)

B

Two outputs (Sum, Carry)

C

Three outputs (Sum, Carry, Error)

D

One output (Carry)

24

The Sum (S) output of a half-adder is generated by which logical operation?

A

AND

B

OR

C

NAND

D

XOR

25

The Carry (C) output of a half-adder is generated by which logical operation?

A

AND

B

OR

C

NOT

D

XOR

26

A full-adder circuit is a more complex circuit that adds how many single-bit binary numbers?

A

Two

B

Four

C

Three

D

One

27

The inputs to a full-adder are typically denoted as A, B, and what?

A

Cout (Carry Out)

B

S (Sum)

C

D (Data)

D

Cin (Carry In)

28

For a half-adder with inputs A=1 and B=1, what are the Sum (S) and Carry (C) outputs?

A

S=1, C=0

B

S=0, C=0

C

S=1, C=1

D

S=0, C=1

29

What is a Karnaugh map (K-map) primarily used for?

A

To perform binary addition

B

To store data

C

To minimize logic functions

D

To convert analog to digital

30

A K-map for 3 variables would have which grid size?

A

2x2

B

4x4

C

2x4

D

4x8

31

In a K-map, every group of 1s must have a size that is a power of what number?

A

3

B

10

C

2

D

4

32

A single cell in a K-map represents which of the following?

A

A logic gate

B

A truth table

C

An entire function

D

A minterm

33

What is the decimal equivalent of the binary number 1101?

A

11

B

12

C

13

D

14

34

The expression A + B = Ā . B̄ represents which law?

A

Absorption Law

B

Distributive Law

C

De Morgan's Theorem

D

Commutative Law

35

Physical devices in electronic circuits that perform Boolean operations are known as?

A

Resistors

B

Capacitors

C

Logic gates

D

Transistors

36

The term 'discrete' for a digital signal implies that it has what?

A

Infinite possible values

B

A smooth wave form

C

Finite possible values (0 or 1)

D

A high voltage

37

What is the purpose of a microphone in the ADC/DAC process example?

A

To convert digital signals to sound

B

To store binary data

C

To capture sound waves as analog signals

D

To amplify digital signals

38

In the expression F(A,B,C) = A.B + Ā.C, which operations are used?

A

AND, OR, NOT

B

AND, OR

C

OR, NOT, XOR

D

NAND, OR

39

The simplification (A+Ā).(A+B) results in?

A

1

B

A

C

B

D

A+B

40

According to the text, Boolean functions are used in which part of a CPU to perform addition and subtraction?

A

Control Unit

B

Memory

C

Registers

D

Arithmetical Logic Units (ALUs)

41

Which type of logic gate is described as the inverse of the AND gate?

A

OR

B

NOR

C

NAND

D

XOR

42

What is the result of A . Ā according to the Complement Law?

A

1

B

A

C

Ā

D

0

43

A K-map for 4 variables would have which grid size?

A

2x4

B

4x4

C

4x8

D

8x8

44

What does a minterm in Boolean algebra correspond to?

A

A set of variables that makes the function false

B

A single variable in the function

C

A set of variables that makes the function true or 1

D

The simplified version of the function

45

In a full-adder, the sum output is high if the number of high inputs is what?

A

Even

B

Two or more

C

Odd

D

Zero

46

The Boolean expression for the Carry output of a full-adder is?

A

A ⊕ B ⊕ Cin

B

A . B

C

(A.B) + (Cin . (A⊕B))

D

A + B + Cin

47

Which Boolean law allows you to rewrite A.(B.C) as (A.B).C?

A

Commutative Law

B

Distributive Law

C

Associative Law

D

Absorption Law

48

To create a logic diagram, you must first find the logic gates needed for the what?

A

Boolean function

B

Truth table

C

K-map

D

Input variables

49

What is the Boolean expression for the Sum output of a full-adder?

A

A . B . Cin

B

A + B + Cin

C

A ⊕ B ⊕ Cin

D

(A.B) + Cin