Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Boolean Functions and Logic Gates Practice Exercise, Exercises of Computer Architecture and Organization

A set of practice exercises on simplifying boolean functions and implementing logic gates such as exclusive or using nand and nor gates. It includes truth tables and circuit diagrams for reference.

Typology: Exercises

2012/2013

Uploaded on 05/06/2013

anurati
anurati 🇮🇳

4.2

(24)

121 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Practice Exercise 2
1. Simplify following Boolean Functions:
a) F = xy + x’y + xy’
b) F = x + x’y
c) F = (x + y)(x +y’)
d) F = xy + x’z + yz
e) F = xyz + x’y + xyz’
2. What does the circuit in Figure 1 do?
Figure 1: Truth-table (a) and circuit (b) for majority of three circuit
Docsity.com
pf2

Partial preview of the text

Download Boolean Functions and Logic Gates Practice Exercise and more Exercises Computer Architecture and Organization in PDF only on Docsity!

Practice Exercise 2

  1. Simplify following Boolean Functions: a) F = xy + x’y + xy’ b) F = x + x’y c) F = (x + y)(x +y’) d) F = xy + x’z + yz e) F = xyz + x’y + xyz’
  2. What does the circuit in Figure 1 do?

Figure 1: Truth-table (a) and circuit (b) for majority of three circuit

Docsity.com

3.What is Exclusive or function? Implement it with only Nand gates. Figure2.: Exclusive or - three implementations

Implement it with only Nor gates.

  1. Prove that by truth table.
  2. How would you use two xor s, two inverter/not s, and an and to create a circuit to compare two two-bit numbers;

Docsity.com