Computer Architecture - Syllabus

Representation of data using binary digits (0s and 1s). This is the fundamental way computers store and process information.

Binary Coded Decimal representation, a way to represent decimal numbers using binary digits. This method is used in some computer systems for decimal arithmetic.

Representation of alphanumeric characters (letters and numbers) using binary digits. This is essential for text processing and storage in computers.

Representation of negative numbers using complements, which is essential for arithmetic operations in computers.

Representation of numbers using fixed point notation, which is used in some computer systems for arithmetic operations.

Methods for representing negative numbers in computers, including sign-magnitude and two's complement representations.

Representation of real numbers using floating point notation, which is used in computers for scientific and engineering applications.

Arithmetic operations using complements, including addition and subtraction of signed numbers.

Detection and handling of overflow errors that occur during arithmetic operations in computers.

Methods for detecting overflow errors during arithmetic operations, including flag-based and overflow bit-based detection.

A binary code that minimizes single-bit errors during data transmission and storage.

A binary code that is its own complement, used in some computer systems for error detection and correction.

A binary code that assigns different weights to each bit, used in some computer systems for arithmetic operations.

A binary code used for decimal arithmetic, where each digit is represented by a binary code with a bias of 3.

Extended Binary Coded Decimal Interchange Code, a character encoding standard used in some computer systems.

A single bit added to a binary code to detect single-bit errors during data transmission and storage.

A parity scheme where the parity bit is set to 1 if the number of 1s in the code is odd.

A parity scheme where the parity bit is set to 1 if the number of 1s in the code is even.

Circuits or algorithms used to generate and check parity bits for error detection in digital systems.

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.

This topic introduces the concept of backtracking, a problem-solving strategy that involves recursively exploring all possible solutions and backtracking when a dead end is reached. It also compares and contrasts backtracking with recursion.

This topic covers various backtracking algorithms, including those for solving the subset-sum problem, zero-one knapsack problem, and N-queen problem, along with their analysis.

This topic covers the instruction format, instruction set completeness, and the control unit of a basic computer. It explains how the control unit retrieves and executes instructions.

This topic explains the instruction cycle of a basic computer, including determining the type of instruction, memory reference instructions, input-output instructions, and program interrupts. It also covers the interrupt cycle and how it affects computer operation.

This topic provides a detailed description and flowchart of a basic computer, illustrating how the different components work together to execute instructions and perform tasks.

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.

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.

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

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.

This topic covers the major components of a CPU and how they are organized to perform tasks efficiently.

This topic explains the different instruction formats and addressing modes used by a CPU to access and manipulate data.

This topic discusses the ways in which a CPU transfers and manipulates data, including program control and subroutine calls.

This topic covers the different types of interrupts and how a CPU handles them to ensure efficient processing.

This topic compares and contrasts the Reduced Instruction Set Computing (RISC) and Complex Instruction Set Computing (CISC) architectures, including their pros and cons.

This topic explains the concept of overlapped register windows in RISC architectures and its benefits.

This topic covers parallel processing, multiple functional units, and Flynn's classification, which is a method of categorizing computer architectures based on the number of instruction streams and data streams.

This topic introduces the concept of pipelining, demonstrates it with an example, and covers the speedup equation, as well as floating-point addition and subtraction with pipelining.

This topic explores instruction level pipelining, including the instruction cycle, three and four-segment instruction pipelines, pipeline conflicts, and solutions to these conflicts.

This topic covers vector processing, its applications, vector operations, and matrix multiplication, which are essential concepts in computer architecture.

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.

Overview of E-commerce and its significance in the digital age.

Understanding the differences between E-business and E-commerce.

Key characteristics and benefits of E-commerce.

Types of E-commerce models and their applications.

Evolution and development of E-commerce over time.

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.

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

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

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

Secondary storage devices, including magnetic disks and magnetic tapes, used to store data and programs when not in use by the CPU.