Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Digital Logic

Digital Logic - Syllabus

Course Overview and Structure
Syllabus Notes Old Questions Unit Wise Questions Question Bank

Embark on a profound academic exploration as you delve into the Digital Logic course () within the distinguished Tribhuvan university's CSIT department. Aligned with the 2065 Syllabus, this course (CSC-151) seamlessly merges theoretical frameworks with practical sessions, ensuring a comprehensive understanding of the subject. Rigorous assessment based on a 60+20+20 marks system, coupled with a challenging passing threshold of , propels students to strive for excellence, fostering a deeper grasp of the course content.

This 3 credit-hour journey unfolds as a holistic learning experience, bridging theory and application. Beyond theoretical comprehension, students actively engage in practical sessions, acquiring valuable skills for real-world scenarios. Immerse yourself in this well-structured course, where each element, from the course description to interactive sessions, is meticulously crafted to shape a well-rounded and insightful academic experience.


Course Synopsis: General concepts to be used in the design and analysis of digital systems and introduces the principles of digital computer organization and design.

Goals:
Introduce fundamental digital logic and switching networks. Exposure of Boolean algebra and its application for circuit analysis. Introduction to multilevel gates networks, flip-flops, counters and logic devices.

Units

Key Topics

  • Digital Systems
    BI-01

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

  • Binary Numbers
    BI-02

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

  • Number Base Conversion
    BI-03

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

  • Octal and Hexadecimal Numbers
    BI-04

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

  • Compliments
    BI-05

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

  • Signed Binary Numbers
    BI-06

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

Basic definition of Boolean Algebra, Basic Theory of Boolean Algebra, Boolean Function, Logic operations, Logic Gates, IC Digital Logic Families

K-map, Two and three Variable Maps, Four variable Maps, Product of Sums, sum of product simplification, NAND and NOR implementation

Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure, NAND Circuits, NOR Circuits, Exclusive -OR Circuit

Key Topics

  • Nature of Internship
    CO-1

    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.

  • Phases of Internship
    CO-2

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

  • Provision of Supervision
    CO-3

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

  • Provision of Mentorship
    CO-4

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

  • Evaluation Scheme
    CO-5

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

  • Report Contents
    CO-6

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

  • Citation and Referencing
    CO-7

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

Key Topics

  • Challenges and Approach of E-government Security
    SE-1

    This topic covers the challenges faced by e-government in terms of security and the approaches to address them. It explores the importance of security in e-government and the ways to mitigate risks.

  • Security Management Model
    SE-2

    This topic introduces a security management model for e-government, outlining the key components and processes involved in ensuring the security of e-government systems.

  • E-Government Security Architecture
    SE-3

    This topic delves into the architecture of e-government security, including the design and implementation of secure systems and infrastructure for e-government services.

  • Security Standards
    SE-4

    This topic covers the security standards and guidelines for e-government, including international standards and best practices for ensuring the security of e-government systems and data.

Key Topics

  • Relational Database Design Using ER-to-Relational Mapping
    RE-1

    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.

  • Informal Design Guidelines for Relational Schemas
    RE-2

    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.

  • Functional Dependencies
    RE-3

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

  • Normal Forms Based on Primary Keys
    RE-4

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

  • Boyce-Codd Normal Form
    RE-5

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

  • Multivalued Dependency and Fourth Normal Form
    RE-6

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