UPDATED NEWS...
Semester  3rd Semester  Fall 2017 

Prerequisite  Programming Fundamentals 
Course Instructor/s  Dr Hashim Ali, Ms Sadia Azam 
hashim.ali@hitecuni.edu.pk, sadia.azam@hitecuni.edu.pk  
Teaching Assistant (TA)  Sana Naseer [text] 
Office Hours 

Text Book/s
To introduce the basic knowledge of Boolean algebra, design and analysis of Combinational Logic Circuits, design and analysis of Sequential Logic Circuits, Registers, Counters, Memory and programmable logic devices.
Introduction, number systems, Boolean algebra, logic gates (AND, OR, NOT etc.), Karnaugh maps, QM method, combinational circuits, half & full adder and subtractor, comparator, encoders, decoders, multiplexer, demultiplexer, sequential circuits, Flip Flop, (RS, JK, D, T, Master Slave), state transition diagram, counters, registers, memories, PLAs, Programmable Logic Devices (PLDs), hardware descriptive language (HDL Verilog), lab assignments using tools such as Verilog HDL/VHDL, Logisim, etc.
Design and simulation of logic circuits through Logisim and Verilog, Basic logic gates, hardware implementation of combinational logic circuits such as multiplexers and demultiplexers, encoders/decoders, ALU; implementation of sequential circuits such as flipflops, registers, shift registers, counters and other digital circuits.
75% class attendance is mandatory to appear in the examination. Course grades will be determined by the following weights:
Theory (70%)  Laboratory (30%)  

Assignments  2%  Lab Reports  4% 
Quizzes  10%  Lab Performance  10% 
Sessional  I  10%  Viva Voce  10% 
Sessional  II  10%  Project  6% 
Final Exam  38%  
Course Total (100%)  Theory (70%) + Laboratory (30%) 
NOTE:
Reading material about topics related to the course is mentioned under "Support Documents, Resources, and Links".
Week# Date  Topic  Slide Download  Readings  Evaluation 
1 18, 20/9/17  Introduction to Digital Systems Number Systems Decimal, Binary, Octal, Hexadecimal 
Lecture 1  Ch 1.11.6 Mano Ch 2 Floyd 
 
2 25, 28/9/17  Number Systems Signed Numbers Complements Computer Arithmetic Binary Codes 
Lecture 2  Ch 1.11.6 Mano Ch 2 Floyd 
 
3 5, 7/9/17  Boolean Algebra and Logic Gates Basic Definitions Boolean Algebra [Theorems, Properties] Boolean Functions Canonical and Standard Forms Digital Circuit Optimization 
Lecture 3  Ch 2 Mano Ch 3, 4.14.7 Floyd 
Quiz 1 
4 9, 12/9/17  Remaining Lecture 3 Gatelevel Minimization The Map Method 
  Ch 3.1 Mano  Quiz 2 
5 16, 19/9/17  Gatelevel Minimization Two/Three/Fourvariable KMaps ProductofSums Simplification Don'tcare Conditions NAND and NOR Implementaiton ExclusiveOR Function 
Lecture 4 Lecture 5 
Ch 3.23.4 Mano Ch 4.84.11 Floyd 
 
6  Lecture 6    Quiz 3 Assignment 1  Deadline 

7  Sessional  I Exam  
8  Lecture 7      
9  Lecture 8    Quiz 4  
10  Lecture 9    Quiz 5  
11  Lecture 10    Quiz 6  
12  Lecture 11      
13  Sessional  II Exam  
14  Lecture 12      
15  Lecture 13    Quiz 7  
16  Lecture 14      
17  Lecture 15    Quiz 8  
18  Lecture 16    Assignment 2  Deadline  
19  Final Exam 
Download Assignment Cover Page
Try to cover the course material everyday!! Surprise quizzes may be taken during the course.
Week#  Experiment Title  Mannual Download  Evaluation 
1  Introduction to Digital Logic Trainer and Logic Gates.  Lab 1   
2  Implementation of Boolean Functions on Digital Trainer.  Lab 2   
3  Verilog Implementation of basic logic gates and Boolean functions.  Lab 3   
4  Introduction to Digital Logic Circuit Simulation with Logisim.  Lab 4   
5  The objective of this lab is to familiarize students how to obtain simplest implementation of any digital circuit..  Lab 5   