Category Archives: August_2015

November Lesson Plan

LESSON PLAN

DATE             November 1 – November 15 

CLASS                       XII

SUBJECT                 Computer Science                                                                                         

TOPIC                       Boolean Algebra.

SUB-TOPIC  

  1. Logic Gate.
  2. K Maps.

GENERAL AIM

To introduce Boolean algebra, using various basic gates and universal gate to implement logic circuit and using K map to simplify logic circuits.

SPECIFIC AIMS

Students must be able to learn use of logic gates in building circuits and must be able to simplify the complex circuits using laws of Boolean algebra, truth table and K maps.

TEACHING OBJECTIVES

Concept of 0/1 must be clear to students and they must be able to perform all Boolean operations and build simple as well complex circuits and must be able to use various logic gates in building functions .Also they must be able to simplify complex function to simpler ones using K maps and laws.

PREVIOUS KNOWLEDGE

Students are expected to know about Boolean arithmetic i.e. addition, subtraction etc. basics of logic gates and conditional expressions.

TEACHER’S ACTIVITY  

                 (Teacher will ask questions based on previous knowledge of the students and will take up topic    accordingly)

  • What are bits?
  • What are logic gates?
  • What are conditional expressions?
  • How can we combine conditions?
  • What is truth table?
  • Rules of Binary Addition.
  • What is 1’s and 2’s complement?

PUPIL’S ACTIVITY

Children concepts should be analyzed on the basis of the answers they give. Accordingly we will take up the topic.

ANNOUNCEMENT OF TOPIC

Boolean algebra and Karnaugh Maps

INTRODUCTION

NOT; Truth Tables; Closure Property, Commutative Law, Associative Law, Identity law, Inverse law, Principle of Duality, Idem potent Law, Distributive Law, Absorption Law, Involution law, DeMorgan’s Law and their applications; Obtaining Sum of Product (SOP) and Product of Sum (POS) form from the Truth Table, Reducing Boolean Expression (SOP and POS) to its minimal form, Use of Karnaugh Map for obtaining minimal

form of Boolean expressions (up to 4 variables); Applications of Boolean Logic:Digital electronic circuit design using basic Logic Gates (NOT, AND, OR, NAND, NOR)Use of Boolean operators (AND,OR) in SQL SELECT statementsUse of Boolean operators (AND, OR) in search engine queries.

TEACHING METHOD

Lecture method followed by Practical Interactive Method.

TEACHING AIDS

Markers, Computers, Black-Board, Chalk etc.

TEACHING POINT TEACHER’S ACTIVITY PUPIL’S ACTIVITY BLACK BOARD SUMMARY
What are logic gates To explain what is logic gate and explain its importance in building logical circuits. To understand various logic gates and how conditional expressions are evaluated using this gates and building logical circuits using these gates. Various logic gates will be explained and simplification of complex logical circuits will be explained to students.
To explain that there are 3 basic logic gates

AND
OR

NOT

 

To make them understand that simple circuits can be made through these simple logic gates and can be simplified further. How it is done in Boolean algebra.
To explain various laws

Demorgans Laws

Distributive law

Identity Law

Involution Law

 

 

To make them understand these laws and proving these laws using algebraic method and using truth table. To understand laws and their prove.Impleming them in expression simplification.
To use K map in circuit simplification To make them understand using K map and various rules for using it;

Pair

Quad

Octet

Map Rolling

 

To understand the use of K map and its use in circuit simplification.

RECAPITULATION

  1. Gates are building blocks of logical circuits.
  2. AND, OR, NOT are basic logic gates.
  3. NAND and NOR are universal gates.
  4. K map is graphical tool to simplify Boolean logic circuits.

 

EVALUATION TOOLS

  1. Prove that X.(X+Y)=X by algebraic method.
  2. Give duals for the following :
  1. a) A+ ĀB
  2. b) AB+ĀB
  3. State and verify Involution law.
  4. Draw logic circuit diagram for the following expression:Y= AB+BC+CĀ
  1. State and verify Duality principle.

HOME-ASSIGNMENT

SLOW –LEARNER STUDENT

  1. State and verify De-Morgan’s law in Boolean algebra.
  2. Prove (x+y)(x+z) = x+yz algebraically.
  3. State absorption law.
  4. What is minterm?
  5. State and verify associative law.

AVERAGE STUDENT

  1. State and verify associative law.
  2. State and verify distributive law.
  3. State the principle of duality in Boolean algebra and give the dual of the Boolean expression (x+y). (x+z).
  4. Draw the circuit diagram for F = AB’C + C’B using NAND to NAND logic only.
  5. Given a Boolean function F= XY + X’Y’ + Y’Z. Implement it with only NAND-to-NAND logic.
  1. Draw the logic circuit diagram for F=ABC + A’B’C + A’BC’
  2. Reduce the following Boolean expression using K – Map:F (A, B, C, D) =    ∑ (0, 1, 2, 3,4, 5, 10, 11, 15)

BRIGHT STUDENT

  1. Reduce the following Boolean expression using K-Map.

F (a,b,c,d) = S (1,4,5,8,9,12,13)

  1. Reduce the following Boolean expression using K-Map.

F (a,b,c,d) = S (2,3,6,7,9,12,14,15)

  1. 3. Reduce the following Boolean expression using K-Map.

F (a,b,c,d) = P (2,3,5,8,9,10,11,15)

  1. 4. Reduce the following Boolean expression using K-Map.

F (a,b,c,d) = P (0,1,2,4,5,7,9,12,14,15)

  1. 5. Reduce the following Boolean expression using K-Map.

F (a,b,c,d) = P (1,4,5,6,8,10,11,13)

 

 

Teacher’s Signature                                                                                          Principal’s Signature

 

Advertisements