COURSE CONTENT

Course Code: ECE101 L+T+P: 30+0+15

Course Title: Applied Digital Logic Design CIE: 50

Teaching Hours: 30 SEE: 50

Unit-I

Fundamentals of Digital Design: Difference between Analog and Digital Signals, Number

Systems: Decimal, Binary, Octal and Hexadecimal. Binary Addition and Subtraction,

Digital Logic Gates, Boolean Algebra, Boolean Functions: Canonical Forms, Completely

and Incompletely Specified Functions

T1 - Chapter 1.-1.2, Chapter 2.-2.1, 2.2, 2.3.1, 2.3.2, 2.4, 2.5, 2.8 Chapter 3.-3.1 - 3.5, 3.7,

3.8, 3.9.1, 3.9.2, 3.9.6, 3.9.7 06Hrs

Unit-II

Simplification of Boolean expressions : Simplification of Boolean Functions using

Boolean Algebra, Karnaugh Maps, Quine-McCluskey (up to four variables), Realization of

Boolean functions using Basic Gates

T1 - Chapter 4.- 4.4, 4.5, 4.6, 4.8 06 Hrs

Unit-III

Combinational Logic Circuits : Introduction to Combinational Logic Circuits, Half/Full

Adders/Subtractors, Parallel Adders/Subtractors, Binary Comparators, Decoders, Encoders,

Multiplexers.

T1: chapter 5.- 5.1, 5.1.1, 5.3, 5.4, 5.5, 5.6. 06 Hrs

Unit-IV

Sequential Logic Circuits : Basic Bistable Element, SR Flip-Flop, D Flip Flop, JK Flip

Flop, T Flip Flop, Master Slave JK Flip Flop, Characteristic Equations, Conversion of Flip

Flops.

T1: chapter 6- 6.1, 6.2, 6.4.2, 6.6 06 Hrs

Unit-V

Applications of Flip Flops : Design of Shift Register using D- flip flop, Design of Counters:

Asynchronous counters using T-flip flop, Synchronous Counters using D-flip flop and

T Flip Flop.

T1: chapter 6- 6.7, 6.8.1, 6.9 06 Hrs

  1. List the applications, phases and models in Operations research; Formulate Linear Programming models for the optimum utilization of productive resources in service and manufacturing systems.
  2. Apply graphical method to find optimum solution for a given two variable Linear Programming Problem.
  3. Determine the optimum solution and Compute Maxima or Minima for a given Linear Programming Problem using Simplex method, Big M method and Two phase simplex method; Discuss the concept of duality in Simplex problems; Formulate and Solve dual Simplex problem for a given Linear Programming Problem.
  4. Formulate balanced and unbalanced transportation problem; Compute initial basic feasible solution for a given transportation problem using North-West Corner rule and Vogel’s Approximation method and optimal solution using Modified Distribution method; Explain degeneracy in transportation problem and List the applications.
  5. Formulate assignment model and Obtain optimal solution using Hungarian method; Explain Travelling Salesman Problem. Model an optimal replacement policy for individual and group replacement problems for a given real time scenario.