Scribd
Upload
141 views2 pages

DigitalElectronics (IV ECE) 18052012

This document contains a sample question paper for a digital electronics exam from Dronacharya College of Engineering in Gurgaon, India. The paper has two sections with 5 questions each. Section A covers topics like simplifying boolean expressions, implementing gates from NAND gates, De Morgan's laws, and Karnaugh maps. Section B covers multiplexers, majority function circuits, hamming codes, and binary to gray code conversion.

Uploaded by

JAYACHANDRAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
141 views2 pages

DigitalElectronics (IV ECE) 18052012

This document contains a sample question paper for a digital electronics exam from Dronacharya College of Engineering in Gurgaon, India. The paper has two sections with 5 questions each. Section A covers topics like simplifying boolean expressions, implementing gates from NAND gates, De Morgan's laws, and Karnaugh maps. Section B covers multiplexers, majority function circuits, hamming codes, and binary to gray code conversion.

Uploaded by

JAYACHANDRAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Roll No...............

DRONACHARYA COLLEGE OF ENGINEERING, GURGAON


I st Sessional Examination March 2012
(MDU, Rohtak)

Semester- IV Sem. Branch: ECE


QUESTION PAPER

Subject with Code: Digital Electronics (EE 204 F)


Time: - 2 hours
Max Marks: - 50
Note: Question No. 1 is compulsory. Attempt any two questions from each section. All questions carry equal
marks. (10each)

Q.1 a) Convert the binary number 1011.01 into its decimal equivalent ?
b) Convert (3000.45)10 into its equivalent octal number.
c) Convert (1011)binary to gray code ?
d) Design basic gates using NAND Gate?
e) Define De Morgans Law?

SECTION A

Q.2 Simplify the equation and realize using basic gates


a)Y= ABC+BC D + A BC
Q.3 Simplify the expression using K-Map considering dont cares
Y(A,B,C,D)= m (1,4,8,12,13,15)+d(3,14)
Q.4 Simplify the Boolean function using K-Map
F(A,B,C,D,E)= m(0,2,4,6,9,11,13,15,17,21,25,27,29,31)
Q.5 Simplify the following Boolean expression using Quine Mc-Cluskey (Tabular)
Method.
Y(A,B,C,D) = m(0,1,3,7,8,9,11,15)

SECTION B

Q.6 What are Multiplexers. Design 8:1 Mux using two 4:1 Mux.
Q.7 A circuit has four inputs and two outputs. One of the outputs is high when majority of inputs are high. The second
output is high only when all inputs are of same type. Design the combinational circuit.
Q.8 Construct the hamming code for data 1010 using odd parity.
Q.9 What are combinational circuits? Design a binary to gray code converter.
Roll No...............

DRONACHARYA COLLEGE OF ENGINEERING, GURGAON


I st Sessional Examination March 2012
(MDU, Rohtak)

Semester- IV Sem. Branch: ECE


QUESTION PAPER

Subject with Code: Digital Electronics (EE 204 F)


Time: - 2 hours
Max Marks: - 50
Note: Question No. 1 is compulsory. Attempt any two questions from each section. All
questions carry equal marks. (10each)

Q.1 a) Convert the binary number 1011.01 into its decimal equivalent ?
b) Convert (3000.45)10 into its equivalent octal number.
c) Convert (1011)binary to gray code ?
d) Design basic gates using NAND Gate?
e) Define De Morgans Law?

SECTION A

Q.2 Simplify the equation and realize using basic gates


a)Y= ABC+BC D + A BC
Q.3 Simplify the expression using K-Map considering dont cares
Y(A,B,C,D)= m (1,4,8,12,13,15)+d(3,14)
Q.4 Simplify the Boolean function using K-Map
F(A,B,C,D,E)= m(0,2,4,6,9,11,13,15,17,21,25,27,29,31)
Q.5 Simplify the following Boolean expression using Quine Mc-Cluskey (Tabular)
Method.
Y(A,B,C,D) = m(0,1,3,7,8,9,11,15)

SECTION B

Q.6 What are Multiplexers. Design 8:1 Mux using two 4:1 Mux.
Q.7 A circuit has four inputs and two outputs. One of the outputs is high when majority of inputs are high. The second
output is high only when all inputs are of same type. Design the combinational circuit.
Q.8 Construct the hamming code for data 1010 using odd parity.
Q.9 What are combinational circuits? Design a binary to gray code converter.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy