Digital Logic - Syllabus

Introduction to digital systems and their importance in modern computing. Understanding the basics of digital systems and their applications.

Representation of binary numbers, their advantages, and conversion to other number systems. Understanding binary arithmetic and its significance in digital systems.

Conversion of numbers between different number bases such as binary, octal, decimal, and hexadecimal. Understanding the importance of number base conversion in digital systems.

Representation and conversion of octal and hexadecimal numbers. Understanding their applications in digital systems and programming.

Introduction to compliments in binary systems, including 1's and 2's compliment. Understanding their significance in digital arithmetic and error detection.

Representation of signed binary numbers, including signed magnitude, 1's compliment, and 2's compliment. Understanding their applications in digital systems.

Introduction to decimal codes such as BCD, 2 4 2 1, 8 4 -2 -1, and Excess 3. Understanding their applications in digital systems and programming.

Introduction to Gray code, its representation, and conversion. Understanding its applications in digital systems and error detection.

Introduction to binary storage and registers, including their types and applications. Understanding their significance in digital systems and computing.

Introduction to binary logic, including logical operations and gates. Understanding their applications in digital systems and computing.

Introduction to Boolean algebra, including basic and axiomatic definitions, laying the foundation for digital logic.

Exploration of fundamental theorems and properties of Boolean algebra, essential for understanding digital logic principles.

Study of Boolean functions, including their representation and manipulation in digital logic systems.

Examination of logic operations, including AND, OR, and NOT, and their role in digital logic circuits.

Introduction to logic gates, the building blocks of digital logic circuits, including their types and applications.

Overview of integrated circuits, including their design, fabrication, and role in modern digital systems.

Overview of software tools used for simulation, including their features and applications.

Introduction to programming languages specifically designed for simulation, such as GPSS.

In-depth study of the GPSS simulation language, including its syntax, features, and examples.

Analysis of real-world examples of simulation in different domains, highlighting their objectives, methodologies, and outcomes.

Concepts and techniques for designing and developing simulation models, including model types and their applications.

Methods for building mathematical models that can be used for simulation, including equation-based and algorithmic models.

A method for selecting the essential prime implicants in a Boolean function. It is used to minimize Boolean expressions and implement digital circuits.

The internship work should be relevant to the field of computer science and information technology, with a minimum duration of 180 hours or ten weeks.

The internship evaluation consists of three phases: Proposal Submission, Mid-Term Submission, and Final Submission.

A regular faculty member of the college is assigned as a supervisor to supervise the students throughout the internship period.

A regular employee of the intern providing organization is assigned as a mentor to guide the students throughout the internship period.

The evaluation scheme consists of Proposal Defense, Midterm, and Final Defense, with a total of 200 marks.

The internship report should contain prescribed content flow, including introduction, problem statement, objectives, and references.

The citation and referencing standard should be APA referencing standard, with proper citation and referencing in the document.

This topic covers the fundamental logic gates NOT, OR, and AND, including their symbols, truth tables, and applications.

This topic explores the universal logic gates NOR and NAND, their properties, and how they can be used to implement other logic gates.

This topic discusses the EX-OR and EX-NOR gates, their truth tables, and applications in digital circuits.

This topic introduces Boolean algebra, including postulates, theorems, and canonical forms, and how they are used to simplify logic functions.

This topic covers the use of Karnaugh maps to simplify logic functions, including analysis of SOP and POS expressions.

This topic explores the implementation of combinational logic functions using encoders, decoders, half adders, and full adders.

This topic covers the implementation of data processing circuits, including multiplexers, de-multiplexers, parallel adders, and parity generators/checkers.

This topic introduces the basic concepts of programmable logic, including PROM, EPROM, PAL, and PLA.

A type of digital integrated circuit that can be programmed to perform a specific digital function.

A type of digital integrated circuit that can be programmed to perform a specific digital function, similar to PLA but with some differences.

Feistel Cipher Structure is a design model for block ciphers, and Substitution Permutation Network (SPN) is a method of constructing block ciphers. Both are fundamental concepts in symmetric cryptography.

Data Encryption Standards (DES) is a symmetric-key block cipher, and its variants include Double DES and Triple DES. These are important encryption algorithms in cryptography.

Finite Fields, including Groups, Rings, and Fields, are mathematical structures used in cryptography. Modular Arithmetic, Euclidean Algorithm, and Galois Fields are essential concepts in finite fields.

International Data Encryption Algorithm (IDEA) is a symmetric-key block cipher used for encrypting data. It is an important encryption algorithm in cryptography.

Advanced Encryption Standard (AES) is a symmetric-key block cipher used for encrypting data. It is a widely used and secure encryption algorithm in cryptography.

Modes of Block Cipher Encryption include Electronic Code Book, Cipher Block Chaining, Cipher Feedback Mode, Output Feedback Mode, and Counter Mode. These modes determine how block ciphers are used in practice.

Learn how to design relational databases using ER-to-relational mapping, including mapping of regular entities, weak entities, relationship types, multivalued attributes, and N-ary relationships.

Understand informal design guidelines for relational schemas, including semantics of attributes in relations, redundant information in tuples and update anomalies, NULL values in tuples, and generation of spurious tuples.

Study functional dependencies, including definition, inference rules, Armstrong's axioms, attribute closure, equivalence of functional dependencies, and minimal sets of functional dependencies.

Explore normal forms based on primary keys, including First Normal Form, Second Normal Form, Third Normal Form, and their general definitions.

Learn about Boyce-Codd Normal Form, a higher normal form that ensures a relational schema is in a good structure.

Understand multivalued dependency and Fourth Normal Form, which eliminates multivalued dependencies in a relational schema.