Digital Electronics-Boolean Algebra and Minimization Techniques (NTA-NET (Based on NTA-UGC) Electronic Science (Paper-II)): Questions 1 - 2 of 2

Access detailed explanations (illustrated with images and videos) to 124 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 150.00 or

How to register?

Question number: 1

» Digital Electronics » Boolean Algebra and Minimization Techniques

Edit

Appeared in Year: 2017

MCQ▾

Question

The Boolean SOP expression obtained from the truth table is:

Table of Boolean SOP expression

Table of Boolean SOP expression

Inputs

Output

A

B

C

X

(November paper 2)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 2

» Digital Electronics » Boolean Algebra and Minimization Techniques

Edit

Appeared in Year: 2018

Assertion-Reason▾

Question

Assertion (Ꭺ)

The hexadecimal numbers are first converted into binary numbers and operations are performed using binary representation of hexadecimal numbers using rules of binary numbers. (July)

Reason (Ꭱ)

The information can be handled in hexadecimal form in digital circuits but it is easier to enter information using binary numbers.

Choices

Choice (4) Response

a.

Ꭺ is false but Ꭱ is true

b.

Ꭺ is true but Ꭱ is false

c.

Both Ꭺ and Ꭱ are true and Ꭱ is the correct explanation of Ꭺ

d.

Both Ꭺ and Ꭱ are false