


PULSE AND DIGITAL CIRCUITS
Group A
Combinational Logic
Boolean algebra: Introduction, postulates of Boolean algebra, fundamental theorems,
uniqueness properties, laws of Boolean algebra, De Morgan's theorem, the (inclusion)
implication relation, bounds of Boolean algebra, duality in Boolean algebra, Boolean
constants, variables and functions, twovalued Boolean algebra switching algebra, electronic
gates and mechanical contacts.
Boolean functions and logic operations: Introduction, the normal form, the canonical form,
fundamental products and sums, disjunctive and conjunctive normal forms, binary, octal and
hexadecimal, designations, selfdual functions, logical operations, NAND and NOR
operations, EXCLUSIVEOR operation, functionally complete sets.
Minimization of switching functions: The Karnaugh mapintroduction cubes and the
Karnaugh map, prime cubes, maximum sum of products, minimum product of sums, don't
care forms, five and sixvariable maps, multiple output minimization.
Tabular methods of minimization: Introduction, QuineMcCluskey algorithm, the
dominance relation cyclic functions, the degree of adjacency and essential prime cubes.
Logic synthesis of switching functions: Introduction, AND, OR and inverter networks,
NAND and NOR networks, EXCLUSIVEOR networks, multiplexers, read only memories,
programmable logic arrays (PLA), PLA minimization, essential prime cube theorems, PLA
folding.
Reliable design and fault detection tests: Introduction, fault classes and models, fault
diagnosis and testing, test generation, fault table method, path sensitization method, Boolean
difference method, reliability through redundancy, hazards and hazardfree designs, quaded
logic.

