Computer Architecture - Syllabus

Course Overview and Structure

Embark on a profound academic exploration as you delve into the Computer Architecture course () within the distinguished Tribhuvan university's CSIT department. Aligned with the 2065 Syllabus, this course (CSC-201) seamlessly merges theoretical frameworks with practical sessions, ensuring a comprehensive understanding of the subject. Rigorous assessment based on a 80+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: This course gives the fundamental knowledge concern with the way the hardware components are connected together to form a computer system and how they interact to provide the processing needs of the user.
Goals:
· Introduces the fundamental concepts behind the design working and organization of a computer system.
· Instruction set architecture, memory hierarchies and interconnection.

Units

Key Topics

  • Introduction to Databases
    DA-1

    Introduction to databases, including examples and basic concepts.

  • Database Management System
    DA-2

    Introduction to Database Management Systems (DBMS), including advantages and examples.

  • Database Users
    DA-3

    Types of database users, including actors on the scene and workers behind the scene.

  • Benefits of Databases
    DA-4

    Advantages and benefits of using databases.

  • Data Models
    DA-5

    Types of data models, including hierarchical, network, ER, relational, and object models.

Key Topics

  • Control Word and Microprogram
    MI-1

    This topic covers the concept of control words and microprograms in microprogrammed control, including their roles in controlling the flow of data and instructions in a computer system.

  • Address Sequencing and Conditional Branch
    MI-2

    This topic explains how address sequencing and conditional branching are used to control the flow of instructions in a microprogrammed control unit, including the use of conditional branch instructions and subroutines.

  • Microinstruction Format and Symbolic Microinstructions
    MI-3

    This topic covers the format of microinstructions and the use of symbolic microinstructions to represent complex control sequences in a microprogrammed control unit.

  • Design of Control Unit
    MI-4

    This topic covers the design principles and considerations for building a control unit using microprogrammed control, including the organization of control memory and the role of the sequencer.

Key Topics

  • Introduction to Functions
    FU-1

    Definition, domain, and range of functions. Understanding the concept of functions and their representations.

  • Graphs of Functions
    FU-2

    Understanding the graphical representation of functions, including the vertical line test and piecewise defined functions.

  • Types of Functions
    FU-3

    Introduction to common functions including linear, power, polynomial, and rational functions.

  • Combining Functions
    FU-4

    Shifting and scaling graphs, sums, differences, products, and quotients of functions, and composite functions.

  • Graphing with Technology
    FU-5

    Using calculators and computers to plot graphs of functions.

  • Exponential Functions
    FU-6

    Definition, exponential behavior, and exponential growth and decay.

Key Topics

  • Basic Logic Gates
    CO-01

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

  • Universal Logic Gates
    CO-02

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

  • EX-OR and EX-NOR Gates
    CO-03

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

Key Topics

  • Register Organization
    CE-01

    Organization of registers in a CPU, including the types and functions of registers. Understanding how registers are used to store and retrieve data.

  • Register Stack and Memory Stack
    CE-02

    The concept of register stack and memory stack, including how they are used to manage data and program control. Understanding the differences between register stack and memory stack.

  • One Address and Two Address Instructions
    CE-03

    Types of instructions based on the number of addresses, including one address and two address instructions. Understanding the format and execution of these instructions.

  • Addressing Modes
    CE-04

    Different ways of specifying the address of an operand, including immediate, direct, indirect, and indexed addressing modes. Understanding how addressing modes are used in instruction execution.

  • Data Transfer and Manipulation
    CE-05

    Instructions for transferring and manipulating data, including load, store, move, and arithmetic instructions. Understanding how data is transferred and manipulated in a CPU.

  • Introduction to RISC and CISC
    CE-06

    Overview of Reduced Instruction Set Computing (RISC) and Complex Instruction Set Computing (CISC) architectures, including their design principles and trade-offs.

Key Topics

  • File Concept
    FI-1

    Understanding the concept of a file and its importance in C programming.

  • File Operations
    FI-2

    Opening, closing, naming, and basic operations on files in C.

  • File Input/Output
    FI-3

    Reading data from and writing data to a file in C, including functions such as fgetc(), fputc(), fprintf(), and fscanf().

Introduction to Peripheral Devices, I/O interface, Direct Memory Access ( DMA), I/O Processor, Data communication processor

Key Topics

  • Memory Hierarchy
    ME-1

    The organization of memory in a computer system, including main memory, RAM, ROM, and auxiliary memory. This topic covers the memory address map and connection to the CPU.

  • Main Memory
    ME-2

    The primary storage for data and program instructions in a computer system, including RAM and ROM chips.

  • Associative Memory
    ME-3

    A type of memory that uses hardware organization and match logic to perform read and write operations.

  • Cache Memory
    ME-4

    A small, fast memory that stores frequently accessed data, using locality of reference and mapping to improve performance.