Scribd
Upload
63 views2 pages

DLCA Outline

This document outlines the course objectives, topics, and policies for CS 221 Digital Logic & Computer Architecture, which introduces digital logic, gates, and circuits and focuses on combinational and sequential logic design as well as basic computer hardware components; the course will be graded based on quizzes, assignments, participation, midterm, and final exam; and topics include binary systems, Boolean algebra, logic circuits, sequential circuits, memory organization, and instruction set architecture.

Uploaded by

Naima Naeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
63 views2 pages

DLCA Outline

This document outlines the course objectives, topics, and policies for CS 221 Digital Logic & Computer Architecture, which introduces digital logic, gates, and circuits and focuses on combinational and sequential logic design as well as basic computer hardware components; the course will be graded based on quizzes, assignments, participation, midterm, and final exam; and topics include binary systems, Boolean algebra, logic circuits, sequential circuits, memory organization, and instruction set architecture.

Uploaded by

Naima Naeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

International Islamic University, Islamabad.

CS 221 Digital Logic & Computer Architecture


Neelum Inam
[email protected]

Objective:
This course introduces the concept of digital logic, gates and the digital circuits. Further, it focuses on
the design and analysis combinational and sequential circuits. It also serves to familiarize the student
with the logic design of basic computer hardware components.

Recommended Book:
Digital Design, by M Morris Mano. Seventh Edition
Computer System Architecture by M Morris Mano Latest Edition

Grading:
 Quizzes 10%
 Home work / Programming Assignments 10%
 Class Participation 5%
 Mid Term 15%
 Final 60%

Rules, Regulations and Other Policies:


1. There will be detection of marks for late assignments (1 per day)
2. Quizzes will be announced.
3. No makeup quizzes will be taken.
4. There will be no makeup for midterm exam

Topics to be covered in this course:


Binary System, Fundamentals of Boolean algebra. Minimization techniques: algebraic, K-maps.
Canonical Forms and Standard forms, Combinational logic circuits and their Analysis, Adders,
Subtractors, Encoders and decoders, multiplexers and demultiplexers. Sequential logic circuits: flip
flops, registers, counters, memory timing sequences. Register transfer language, integrated circuits,
levels of integration, logic families, memory and PLDs, Instruction types (data transfer, data
manipulation, program control), Interrupts, Memory organization, memory hierarchy.

Lecture Details
Week Topics to be covered
1 Number Systems, Conversions, Conversion of Fractional Numbers,
Addition of Binary Numbers, Radix (1’s) Compliment and Diminished
Radix Complements, Subtraction Using the compliments
2 Binary Codes, Representation of signed binary numbers, Basic operators
and gates, Truth tables, NAND and NOR, Exclusive OR, exclusive NOR
3 Basic Theorems and Properties of Boolean Algebra, Boolean Functions,
circuit Designing and Simplification/ minimization (using Boolean algebra
and K-Map)
4 Canonical Forms, Standard Forms. K-map and don’t care conditions.
5 Integrated Circuits, Levels of Integration, Logic Families, Combinational
and Sequential Circuits, MSI Components Half Adder, Full Adder
6 Serial adders and parallel adders, Full adder with lookahead carry, adder-
subtractor , Decoders, and Encoders, Multiplexers and Demultiplexers
7 Sequential Circuits, Latches, Flip-flops, Registers, Parallel Load, Shift
Register,
8 Problems and revision, Midterm.
9 Asynchronous Counters, Synchronous Counters
10 Register Transfer Language, Integrated Circuits, Levels of Integration,
Logic Families
11 Random Access Memory, Read-Only Memory, Memory and PLDs,
12 Memory Organization, Memory Hierarchy, Cache Memories, DMA, And
Pipelining
13 Instruction Set Architecture, Addressing Modes
14 Instruction Types (Data Transfer, Data Manipulation, Program Control),
Interrupts
15 Revision
16 Final exam

You might also like