Course Name: CS2300 : Switching Theory & Digital Design

Description: Representation of Data: Number systems and codes, Representation of unsigned and signed integers, Fixed-point representation of real numbers, Floating-point representation of real numbers, Representation of character data, Representation of signals. Switching Theory: Laws of Boolean algebra, Theorems of Boolean algebra, Switching functions, Methods for specification of switching functions - Truth tables and Algebraic forms, Realization of functions using logic gates. Digital Logic Elements: Electronic logic gates, Positive and negative logic, Logic families -TTL, ECL and CMOS, Realization of logic gates. Simplification of Boolean Expressions and Functions: Algebraic methods, Canonical forms of Boolean functions, Minimization of functions using Karnaugh maps, Minimization of functions using Quine-McClusky method. Design of Combinational Logic Circuits: Gate level design of Small Scale Integration (SSI) circuits, Modular combinational logic elements - Decoders, Encoders, Priority encoders, Multiplexers and

Slot: G

RoomNo: CS36

Instructor: Shankar Balachandran

Period: JUL-NOV 2013

This page was created on: Thursday 19th of September 2013 09:31:05 PM