0% found this document useful (0 votes)
21 views8 pages

Course Description DLD

Uploaded by

boyjainalabirin
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
0% found this document useful (0 votes)
21 views8 pages

Course Description DLD

Uploaded by

boyjainalabirin
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/ 8

I.

COURSE DESCRIPTION

A course that provides an overview of the principles underlying number system, logic gates, fixed–Point representation, Boolean Function,
Boolean Algebra, Combinational and Sequential Logic Circuits, Flip-Flops, Registers, and PLA (programmable logic arrays). It focuses on
overview of Analog Electronics and Digital Electronics on testing diagnosis, performance, and different computer architecture technical aspects.
The students are expected to become capable in analyzing and implementing different methods, tools, and techniques in their respective Digital
Electronic projects.

II. LEARNING PLAN


Course Learning
Week Topics Teaching and Learning Activities Assessment Tasks Remarks
Outcomes Resources
I. Orientation
Class Discussion Short Quiz
1.1 Vision, Mission, Goals and Computer/
Objectives of the university, Laptop
campus and department
1.2 Subject Lesson
guidelines and policies Oral Recitation presentation
1.3 GAD Orientation
1.3.1 GAD The students will ask Internet
1
1.3.2 Gender the reporter connection
Sensitivity regarding the topic
1.3.3 Gender Issues reported and vice
1.3.4 Gender Fair Language versa.

Oral recitation

2-3 CO 1 II. Concepts in Digital Short Quiz Computer/


Circuit and Logic Design Lecture Laptop
2.1 Numeration Systems Discussion Presentation
2.2 Numbers and Symbols Activity Lesson
2.3 Systems of Numeration presentation

Page PAGE 25 of NUMPAGES 25


Internet
connection

III. Binary Arithmetic Class Discussion The students will


3.1 Numbers versus present their Computer/
Numeration discussion in class. Laptop
3.2 Binary Addition Lecture
3.3 Negative Binary Lesson
Numbers presentation
3.4 Binary
Subtraction Internet
3.5 Binary connection
Overflow
3.5 Bit Grouping
4-6 CO 2

IV. Logic Gates Class Discussion


4.1 Digital Signals and Gates
4.2 The NOT Gate
4.3 The “Buffer” Gate Lecture
4.4 Multiple-input Gates
4.5 TTL NAND and

Page PAGE 25 of NUMPAGES 25


AND Gates
4.6 TTL NOR and
OR Gates
4.7 CMOS Gate
Circuitry
4.8 Special-output Gates
4.9 Gate
Universality
4.10 Logic Signal Voltage
Levels
4.11 DIP Gate
Packaging
V. Switches Class Discussion
1.1 Switch Types
1.2 Switch Contact Design
1.3 Contact Lecture
“Normal” State and
Make/Break Sequence
1.4 Contact
Class Discussion
VI. Electromechanical Relays
6.1 Relay
Construction Lecture
6.2 Contactors
6.3 Time-delay Relays
6.4 Protective Relays
6.5 Solid-state Relays
VII. Ladder Logic Class Discussion
7.1 Ladder
Diagrams
7.2 Digital Logic Functions Lecture
7.3 Permissive and Interlock
Circuits
7.4 Motor Control Circuits
7.5 Fail-safe Design
7.6 Programmable Logic

Page PAGE 25 of NUMPAGES 25


Controllers (PLC)
Midterm Examination
VIII. Boolean Algebra
8.1 Boolean Demonstration Quiz Computer/
Algebra Laptop
8.2 Boolean Interactive class discussion
Arithmetic Lesson
8.3 Boolean Recitation presentation
Algebraic Identities
8.4 Boolean Internet
Algebraic Properties connection
8.5 Boolean Rules for
7-9 Simplification
8.6 Circuit Simplification
Examples
8.7 The Exclusive- OR
Function
8.8 De Morgan’s
Theorems
8.9 Converting
Truth Tables into Boolean
Expressions
IX. Karnaugh Mapping Class Discussion The students will ask Computer/
9.1 Karnaugh the reporter regarding Laptop
Mapping the topic reported and
9.2 Venn Diagrams and Sets Lecture vice versa. Lesson
9.3 Boolean Relationships presentation
9.4 Making a Venn Diagram
Look Like a Karnaugh Map Internet
9.5 Karnaugh Maps, Truth connection
Tables, and Boolean
Expressions
9.6 Logic
Simplification With
Karnaugh Maps
9.7 Larger 4-

Page PAGE 25 of NUMPAGES 25


variable Karnaugh Maps
9.8 Minterm vs Maxterm
Solution
9.9 Sum and
Product Notation
9.10 Don’t Care Cells in
the Karnaugh Map
9.11 Larger 5 & 6-variable
Karnaugh Maps

X. Combinational Logic Recitation Sharing of Thoughts Computer/


Functions and Learnings Laptop
10.1 Combinational Logic
10.2 Half-Adder & The students will Lesson
Full-Adder share their thoughts presentation
10.3 Decoder & and learnings in
Encoder class. Internet
10.4 Demultiplexers connection
10.5 Multiplexers The teacher will let the
Using Multiple students express
Combinational Circuits their feelings about
the course subject.

9 Final Examination

IX. SUGGESTED READINGS


Journals
X. COURSE REQUIREMENTS
A. Three Outcomes-Based Assessment including the Free Speech Test on BiPSU’s mandate and GE: Entrepreneurial Mind.
B. Major Examination (Mid-Term Examination and Final Examination)
C. Course Conduct
a) Participation in online activities

XI. GRADING SYSTEM

Page PAGE 25 of NUMPAGES 25


A. Major Examination (30%)
 Mid-Term Examination
 Final Examination
B. Performance Outcomes (50%)
C. Course Conduct (20%)
100%

XII. CLASSROOM POLICIES


1. All course requirements are to be submitted promptly.
2. Online etiquette must be observed properly.

XIII. CONSULTATION HOURS


Tuesday & Thursday, 2:40 PM to 4:10 PM

XIV. ADDITIONAL REQUIREMENTS


Regular attendance in class
Active participation in class through board work and recitation
Submit assignments and project on time and pass the quizzes and examination

Duration:

60–90 minutes (can be split across two sessions if needed)

🎯 Objectives:
At the end of the course, students are expected to:
 Attain the vision, mission, goals, and objectives of the university, campus, and department;
 deliver a gender fair and gender sensitive instruction to students aligned with University goals and objectives;
 introduce Digital Circuits;
 differentiate the fundamentals of both combinational and sequential circuits in a systematic, logical order of self-
contained chapters;
Page PAGE 25 of NUMPAGES 25
 analyze arithmetical foundation of the digital world, Boolean algebra, concepts and their application to electronic circuitry, minimization techniques of
combinational digital circuits, the application of combination circuit concepts to practical problems, sequential circuits and their
characteristics and limitation, and methods of developing general sequential circuitry; and
 stressing real-life applications digital circuit design and offering numerous worked-out examples, and presenting a
unique method of experiments.

📚 References:

Sharma, S. (2013). Digital design. New Delhi: S.K. Kataria & Sons

Dorf, R. C., & Svoboda, J. A. (2006). Introduction to Electric Circuits (7th ed.). United States: John Wiley & Sons Inc.

Roth Jr., C. H., & Kinney, L. L. (2011). Logic Design Fundamentals. Pasig City, Philippines: Cengage Learning Asia Pte Ltd (Philippines Branch).

Saha, A., & Manna, N. (2008). Digital Principles of Logic Design. 11 Leavitt street Hingham, MA 02043: Infinity Science Press LLC.
Lesson Title: Computers in Our Daily Life

Subject: Digital logic design


Grade Level: College
Duration: 60–90 minutes
Mode of Delivery: Face-to-Face / Online (Synchronous or Asynchronous)

I. Learning Objectives
At the end of the course, students are expected to:
 Attain the vision, mission, goals, and objectives of the university, campus, and department;
 deliver a gender fair and gender sensitive instruction to students aligned with University goals and objectives;
 introduce Digital Circuits;
 differentiate the fundamentals of both combinational and sequential circuits in a systematic, logical order of self-
contained chapters;

Page PAGE 25 of NUMPAGES 25


 analyze arithmetical foundation of the digital world, Boolean algebra, concepts and their application to electronic circuitry, minimization techniques of
combinational digital circuits, the application of combination circuit concepts to practical problems, sequential circuits and their
characteristics and limitation, and methods of developing general sequential circuitry; and
 stressing real-life applications digital circuit design and offering numerous worked-out examples, and presenting a
unique method of experiments.

Page PAGE 25 of NUMPAGES 25

You might also like