0% found this document useful (0 votes)
14 views

Applied computing syllabus

Uploaded by

aamirrasoolkhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views

Applied computing syllabus

Uploaded by

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

BACHELORS WITH APPLIED COMPUTING AS MINOR

(FOR STUDENTS WITH MAJOR IN COMPUTER APPLICATIONS / INFORMATION TECHNOLOGY)


1st SEMESTER
ACP124N APPLIED COMPUTING _ DIGITAL ELECTRONICS
CREDITS: THEORY: 4; PRACTICAL: 2
COURSE LEARNING OUTCOMES:
• To introduce concepts of number systems and Boolean algebra.
• To familiarize students with the operation and use of basic digital logic gates as well as the design and
minimization of combinational logic circuits.
• To introduce the concept of microprocessors and familiarize them with basic operation of a CPU.
THEORY (4 CREDITS)
UNIT 1:
Introduction to Digital and Analog Quantities, Binary Digits, Logic Levels, Pulse, Waveforms, Clock and Timing
Diagrams (1 Hour)
Number Systems - Decimal, Binary, Octal, Hexadecimal and their Conversions. (4 Hours)
Unsigned Binary Arithmetic, Ones Complement, Twos Complement. Signed Numbers and their arithmetic. Binary Coded
Decimal. Error Codes-Parity Code (4 Hours)
Logic Gates—AND, OR, NOT, NAND, NOR, XOR and XNOR Gates. (2 Hours)
Boolean Algebra: Boolean Operations, Laws and Rules of Boolean Algebra, DeMorgan's Theorems. Constructing a
Boolean Expression for a Logic Circuit, Logic Simplification. (5 Hours)
UNIT 2:
SOP and POS forms, Karnaugh Maps and minimization upto 4 variables, Don't care conditions (4 Hours) Combinational
Logic Circuits: AND-OR, AND-OR-INVERT, XOR and XNOR logic, Converting Boolean Expression or Truth Table to
a Logic Circuit, NAND and NOR as Universal Gates (4 Hours)
Half Adder, Full Adder, 4-bit Parallel Binary Adder, Comparator, Binary Decoder, Encoder, Multiplexer, Demultiplexer
(7 Hours)
UNIT 3:
Latches: SR Latch, D Latch, Gated SR and D Latch (2 Hours) Flip Flops: Difference between Flip Flop and Latch, Level
vs Edge-Triggered. D Flip Flops, JK Flip Flops and their operation (4 Hours)
Characteristics and Applications of Flip Flops (storage, counting), Intro to 555 Timer (2 Hours)
Shift Registers - Serial and Parallel (4-bit) (3 Hours) Counters: Synchronous and Asynchronous (2/3 bit). Decade
Counter, Johnson counter (4 Hours)
UNIT 4:
von Neumann Architecture: Block Diagram, CPU, Memory, I/O Ports and Buses, Bus Master, Bus Contention: Shared
Signal Lines and Tri-State Outputs, Fan-out, Buffers, Device Selection, System Timing.
Microprocessor, ALU, Control/Timing Unit, Decode Unit, Register Set, Instruction Execution Cycle. Memory: Memory
Bus, Read / Write operations and Addressing Modes. I/O: Polling, Interrupts and DMA. Intro to Types of CPU
Instructions.
Microcontrollers: Architecture, Registers, Functional Units and Peripherals. System on Chip (SoC): Block Diagram,
Functional Elements, Difference between Microprocessor, Microcontroller and SoC. (15 Hours)
TEXTBOOK:
1. Thomas Floyd, Digital Fundamentals, 11th Edition (2015), Pearson.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy