KTU CS203 Switching Theory and Logic Design (STLD) Notes

 

Previous Year Question Paper Solution

Previous Question Paper for December 2019 Exam - Click Here 

Solution for the December 2019 Exam - Click Here


To get Previous Question Papers on KTU CS203 Switching Theory and Logic Design (STLD) Click Here

Notes on KTU CS203 Switching Theory and Logic Design (STLD) are available....



Module

Syllabus


Quick Revision Notes

Module 1 Number systems – Decimal, Binary, Octal and Hexadecimal – conversion from one system to another – representation of negative numbers – representation of BCD numbers – character representation – character coding schemes – ASCII – EBCDIC etc. Addition, subtraction, multiplication and division of binary numbers (no algorithms). Addition and subtraction of BCD, Octal and Hexadecimal numbers. Representation of floating point numbers – precision – addition, subtraction, multiplication and division of floating point numbers Click Here
Module 2 Introduction — Postulates of Boolean algebra – Canonical and Standard Forms — logic functions and gates methods of minimization of logic functions — Karnaugh map method and QuinMcClusky method Product-of-Sums Simplification — Don’t-Care Conditions Click Here
Module 3 Combinational Logic: combinational Circuits and design Procedure — binary adder and subtractor — multi—level NAND and NOR circuits — Exclusive-OR and Equivalence Functions. Implementation of combination logic: parallel adder, carry look ahead adder, BCD adder, code converter, magnitude comparator, decoder, multiplexer, demultiplexer, parity generator. Click Here
Module 4 Sequential logic circuits: latches and flip-flops – edgetriggering and level-triggering — RS, JK, D and T flipflops — race condition — master-slave flip-flop. Clocked sequential circuits: state diagram — state reduction and assignment — design with state equations Click Here
Module 5 Registers: registers with parallel load - shift registers universal shift registers – application: serial adder. Counters: asynchronous counters — binary and BCD ripple counters — timing sequences — synchronous counters — up-down counter, BCD counter, Johnson counter — timing sequences and state diagrams. Part 1
Part 2
Module 6 Memory and Programmable Logic: Random-Access Memory (RAM)—Memory Decoding—Error Detection and Correction — Read only Memory (ROM), Programmable Logic Array (PLA). HDL: fundamentals, combinational logic, adder, multiplexer. Arithmetic algorithms: Algorithms for addition and subtraction of binary and BCD numbers, algorithms for floating point addition and subtraction.

Comments

Post a Comment

Popular posts from this blog

KTU CS304 Compiler Design S6 CS/IT

CS428 Blockchain Technologies - S8 CSE - Elective

KTU CST362 Programming in Python S6 CSE Elective