1

GATE CSE 2002

Subjective

+5

-0

Express the function $$f( x, y, z)= xy'+ yz'$$ with only one complement operation and one or more $$AND/OR$$ operations. Draw the logic circuit implementing the expression obtained, using a single

**NOT**gate and one or more $$AND/OR$$ gates.2

GATE CSE 1996

Subjective

+5

-0

A logic network has two data inputs $$A$$ and $$B,$$ and two control inputs $${C_0}$$ and $${C_1}$$. It implements the function $$F$$ according to the following Table.

Implement the circuit using one $$4$$ to $$1$$ Multiplexor, one $$2$$-input Exclusive $$OR$$ gate, one $$2$$-input $$AND$$ gate, one $$2$$-input $$OR$$ gate and one Inverter.

3

GATE CSE 1991

Subjective

+5

-0

Find the minimum sum of products form of the logic function

$$f\left( {A,B,C,D} \right) = \sum d \left( {3,11,12,14} \right)$$

Where $$m$$ and $$d$$ denote the minterms and don't cares respectively.

$$f\left( {A,B,C,D} \right) = \sum d \left( {3,11,12,14} \right)$$

Where $$m$$ and $$d$$ denote the minterms and don't cares respectively.

4

GATE CSE 1990

Subjective

+5

-0

Show with the help of a block diagram represent Boolean function:

$$f=AB+BC+CA$$ can be realized using only $$4:1$$ multiplexer.

$$f=AB+BC+CA$$ can be realized using only $$4:1$$ multiplexer.

Questions Asked from Boolean Algebra (Marks 5)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages