🇮🇳 UGC NET Computer Science · subject

UGC NET Computer Science Computer System Architecture Syllabus

The Computer System Architecture syllabus for UGC NET Computer Science in full: 11 chapters and 69 topics, every one listed below, plus 51 Computer System Architecture flashcards with answers.

11Chapters
69Topics
51Flashcards

Computer System Architecture syllabus: all 11 chapters

Expand any chapter to see its topics and sub-topics.

  1. Digital Logic Circuits and Components

    12 topics
    • Digital Computers
    • Logic Gates
    • Boolean Algebra
    • Map Simplifications
    • Combinational Circuits
    • Flip-Flops
    • Sequential Circuits
    • Integrated Circuits
    • Decoders
    • Multiplexers
    • Registers and Counters
    • Memory Unit
  2. Data Representation

    7 topics
    • Data Types
    • Number Systems and Conversion
    • Complements
    • Fixed Point Representation
    • Floating Point Representation
    • Error Detection Codes
    • Computer Arithmetic - Addition, Subtraction, Multiplication and Division Algorithms
  3. Register Transfer and Microoperations

    3 topics
    • Register Transfer Language
    • Bus and Memory Transfers
    • Arithmetic, Logic and Shift Microoperations
  4. Basic Computer Organization and Design

    8 topics
    • Stored Program Organization and Instruction Codes
    • Computer Registers
    • Computer Instructions
    • Timing and Control
    • Instruction Cycle
    • Memory-Reference Instructions
    • Input-Output
    • Interrupt
  5. Programming the Basic Computer

    6 topics
    • Machine Language
    • Assembly Language
    • Assembler
    • Program Loops
    • Subroutines
    • Input-Output Programming
  6. Microprogrammed Control

    3 topics
    • Control Memory
    • Address Sequencing
    • Design of Control Unit
  7. Central Processing Unit

    6 topics
    • General Register Organization
    • Stack Organization
    • Instruction Formats
    • Addressing Modes
    • RISC Computer
    • CISC Computer
  8. Pipeline and Vector Processing

    5 topics
    • Parallel Processing
    • Pipelining
    • Arithmetic Pipeline
    • Instruction Pipeline
    • Vector Processing Array Processors
  9. Input-Output Organization

    7 topics
    • Peripheral Devices
    • Input-Output Interface
    • Asynchronous Data Transfer
    • Modes of Transfer
    • Priority Interrupt
    • DMA
    • Serial Communication
  10. Memory Hierarchy

    6 topics
    • Main Memory
    • Auxiliary Memory
    • Associative Memory
    • Cache Memory
    • Virtual Memory
    • Memory Management Hardware
  11. Multiprocessors

    6 topics
    • Characteristics of Multiprocessors
    • Interconnection Structures
    • Interprocessor Arbitration
    • Interprocessor Communication and Synchronization
    • Cache Coherence
    • Multicore Processors

UGC NET Computer Science Computer System Architecture flashcards — 51 questions with answers

  1. What is the difference between a combinational circuit and a sequential circuit?

    A combinational circuit's output depends only on the present inputs (no memory), while a sequential circuit's output depends on both present inputs and past states, using memory elements (flip-flops).

  2. State the absorption laws and De Morgan's theorems of Boolean algebra.

    Absorption: A + AB = A and A(A + B) = A. De Morgan's: (A + B)' = A'B' and (AB)' = A' + B'.

  3. List the three universal/basic logic gates and the two universal gates.

    Basic gates: AND, OR, NOT. Universal gates (each can implement any function): NAND and NOR.

  4. What is a Karnaugh map (K-map) used for, and what is the rule for grouping?

    A K-map is a graphical method to simplify Boolean expressions by grouping adjacent 1s. Groups must be sizes that are powers of 2 (1,2,4,8...), as large as possible, and may overlap or wrap around edges.

  5. Differentiate between SR, JK, D, and T flip-flops.

    SR: set/reset (S=R=1 invalid). JK: like SR but J=K=1 toggles. D: output follows input (D=Q next). T: toggles output when T=1, holds when T=0.

  6. What is the difference between a latch and a flip-flop?

    A latch is level-triggered (responds to input while the enable level is active), whereas a flip-flop is edge-triggered (responds only on a clock edge).

  7. What is a decoder and how many outputs does an n-to-2^n decoder have?

    A decoder is a combinational circuit that converts n binary input lines into a maximum of 2^n unique output lines, with exactly one output active for each input combination.

  8. What is a multiplexer (MUX) and how many select lines does a 2^n-to-1 MUX need?

    A multiplexer selects one of many input lines and routes it to a single output. A 2^n-to-1 MUX needs n select lines.

  9. Differentiate between a register and a counter.

    A register is a group of flip-flops storing multiple bits of data. A counter is a register that goes through a predetermined sequence of states (counts) in response to clock pulses.

  10. What is the difference between a synchronous and an asynchronous (ripple) counter?

    In a synchronous counter all flip-flops share a common clock and change simultaneously; in an asynchronous (ripple) counter the output of one flip-flop clocks the next, causing propagation delay.

  11. What are the SSI, MSI, LSI, and VLSI classifications of integrated circuits?

    SSI: small-scale (<10 gates), MSI: medium-scale (10-100 gates), LSI: large-scale (100-10,000 gates), VLSI: very-large-scale (>10,000 gates).

  12. Convert decimal 156 to binary, octal, and hexadecimal.

    156 = 10011100 (binary) = 234 (octal) = 9C (hexadecimal).

  13. What is the difference between (r-1)'s complement and r's complement?

    The (r-1)'s complement is obtained by subtracting each digit from r-1 (e.g., 1's complement in binary). The r's complement is the (r-1)'s complement plus 1 (e.g., 2's complement).

  14. How do you find the 2's complement of a binary number?

    Take the 1's complement (invert all bits) and add 1; or equivalently, keep all bits up to and including the least-significant 1 unchanged and invert the rest.

  15. What are the three ways to represent signed numbers in fixed-point representation?

    Signed-magnitude, signed-1's-complement, and signed-2's-complement. Most computers use signed-2's-complement for arithmetic.

  16. What are the components of a floating-point number, and what is the IEEE 754 single-precision bit layout?

    A floating-point number has a sign, mantissa (significand), and exponent. IEEE 754 single precision: 1 sign bit, 8 exponent bits (bias 127), 23 mantissa bits (32 bits total).

  17. What is the purpose of a parity bit and what is the difference between even and odd parity?

    A parity bit is an error-detection code making the total number of 1s even (even parity) or odd (odd parity); a single-bit error changes the count and is detected.

  18. Describe the Booth multiplication algorithm's core idea.

    Booth's algorithm multiplies signed 2's-complement numbers by examining pairs of adjacent multiplier bits: it adds, subtracts, or does nothing based on the bit transitions (00/11 shift, 01 add, 10 subtract), then arithmetic shifts.

  19. What is the difference between restoring and non-restoring division algorithms?

    In restoring division, if a subtraction yields a negative partial remainder, the previous value is restored by adding back. Non-restoring division avoids restoring by adding instead of subtracting in the next step, making it faster.

  20. What is Register Transfer Language (RTL) and how is a register transfer denoted?

    RTL is a symbolic notation describing micro-operations on registers. A transfer is denoted R2 ← R1 (contents of R1 copied to R2), often controlled by a condition, e.g., P: R2 ← R1.

Show the other 31 Computer System Architecture flashcards
  1. What are the three types of microoperations in RTL?

    Arithmetic microoperations (add, subtract, increment), logic microoperations (AND, OR, XOR, complement), and shift microoperations (logical, circular, arithmetic shifts).

  2. Differentiate between logical, circular, and arithmetic shift microoperations.

    Logical shift inserts 0 into the vacated bit; circular shift rotates bits end-around; arithmetic shift preserves the sign bit (shifts the magnitude while keeping the sign).

  3. What is a common bus system and how can it be constructed?

    A common bus is a shared set of lines connecting multiple registers so only one transfers data at a time. It can be built using multiplexers or three-state (tri-state) buffers controlled by select lines.

  4. In the basic computer, what are the functions of the AC, PC, AR, IR, DR, TR, and IEN?

    AC: accumulator (results); PC: program counter (next instruction address); AR: address register; IR: instruction register; DR: data register; TR: temporary register; IEN: interrupt enable flip-flop.

  5. What are the three instruction-code formats in Mano's basic computer?

    Memory-reference instructions (opcode 000-110 with I bit and address), register-reference instructions (opcode 111, I=0), and input-output instructions (opcode 111, I=1).

  6. What are the phases of the instruction cycle?

    Fetch the instruction, decode it, read the effective address (if indirect), and execute the instruction; then check for interrupts before the next cycle.

  7. What is the difference between hardwired control and microprogrammed control?

    Hardwired control uses fixed logic gates/flip-flops, making it fast but hard to modify. Microprogrammed control stores control signals as microinstructions in control memory, making it flexible but slower.

  8. What is address sequencing in a microprogrammed control unit?

    Address sequencing is the process of determining the address of the next microinstruction in control memory, using methods like incrementing, branching (conditional/unconditional), mapping the opcode, and subroutine return.

  9. What is a vectored interrupt and how does it differ from a non-vectored interrupt?

    In a vectored interrupt, the interrupting device supplies the address (vector) of its service routine. In a non-vectored interrupt, control branches to a fixed predetermined address.

  10. Differentiate between machine language, assembly language, and an assembler.

    Machine language is binary code directly executed by the CPU; assembly language uses mnemonic symbols for instructions; an assembler is a program that translates assembly language into machine language.

  11. What is a subroutine and how do the CALL and RETURN operations work using a stack?

    A subroutine is a reusable block of code. CALL pushes the return address onto the stack and branches to the subroutine; RETURN pops the return address from the stack to resume the caller.

  12. What is the difference between LIFO and FIFO organization, and which does a stack use?

    LIFO (Last-In-First-Out) removes the most recently added item; FIFO (First-In-First-Out) removes the oldest. A stack uses LIFO.

  13. What are zero-, one-, two-, and three-address instruction formats?

    Three-address: ADD R1,R2,R3; two-address: ADD R1,R2 (R1←R1+R2); one-address: uses an implied accumulator (ADD M); zero-address: stack-based, operands implied on top of stack (ADD).

  14. List and define common addressing modes.

    Immediate (operand in instruction), register, register-indirect, direct (address in instruction), indirect, indexed (base+index), relative (PC+offset), and autoincrement/autodecrement.

  15. Compare RISC and CISC architectures.

    RISC: few simple fixed-length instructions, many registers, load/store architecture, hardwired control, single-cycle execution. CISC: many complex variable-length instructions, fewer registers, memory operands allowed, microprogrammed control.

  16. What is Flynn's classification of computer architectures?

    SISD (single instruction, single data), SIMD (single instruction, multiple data), MISD (multiple instruction, single data), and MIMD (multiple instruction, multiple data).

  17. What is pipelining and what is the ideal speedup of a k-stage pipeline?

    Pipelining overlaps execution of multiple instructions by dividing the datapath into stages. The ideal speedup approaches k (the number of stages) for a large number of tasks.

  18. What are the three types of pipeline hazards?

    Structural hazards (resource conflicts), data hazards (dependency on results of prior instructions), and control hazards (branch/jump instructions changing the instruction flow).

  19. What is the difference between an arithmetic pipeline and an instruction pipeline?

    An arithmetic pipeline divides an arithmetic operation (e.g., floating-point add) into sub-operations to overlap them; an instruction pipeline overlaps the fetch-decode-execute phases of consecutive instructions.

  20. What is the difference between vector processing and array processing?

    Vector processing uses pipelined functional units to process one-dimensional arrays (vectors) of data. Array processing (SIMD) uses multiple processing elements operating in parallel under a single control unit.

  21. What is the difference between synchronous and asynchronous data transfer?

    Synchronous transfer uses a common clock to coordinate sender and receiver; asynchronous transfer has no common clock and relies on control signals like strobe or handshaking.

  22. What is handshaking in asynchronous data transfer?

    Handshaking uses two control signals so both units agree on timing: the source asserts data-valid and the destination responds with an acknowledge, ensuring reliable transfer without a shared clock.

  23. What are the four modes of data transfer between CPU/memory and I/O?

    Programmed I/O, interrupt-initiated I/O, Direct Memory Access (DMA), and I/O processor (channel) transfer.

  24. What is a daisy-chain priority interrupt scheme?

    A daisy chain connects devices in series by priority; the interrupt acknowledge passes through devices in order, and the highest-priority requesting device closest to the CPU intercepts it first and places its vector.

  25. What is DMA and why is it used?

    Direct Memory Access lets an I/O device transfer data directly to/from memory without CPU intervention for each word. The DMA controller takes over the bus (cycle stealing or burst mode), freeing the CPU and speeding bulk transfers.

  26. What is the difference between memory-mapped I/O and isolated (I/O-mapped) I/O?

    Memory-mapped I/O assigns I/O devices addresses in the memory space using the same instructions as memory. Isolated I/O uses a separate address space and dedicated I/O instructions (IN/OUT).

  27. Order main memory, cache, auxiliary memory, and registers by speed and cost in the memory hierarchy.

    From fastest/most-expensive to slowest/cheapest: registers > cache > main memory (RAM) > auxiliary memory (disk/tape). Speed and cost-per-bit decrease while capacity increases down the hierarchy.

  28. What is associative (content-addressable) memory and how is it accessed?

    Associative memory is accessed by the content of the data rather than by an address; all words are compared in parallel against a search argument, making it fast for searching (used in TLBs/cache tags).

  29. What are the three cache mapping techniques?

    Direct mapping (each block maps to one fixed cache line), associative mapping (a block can go in any line), and set-associative mapping (a block maps to a set of lines, e.g., 2-way or 4-way).

  30. What is virtual memory and what is the role of a page table?

    Virtual memory lets programs use an address space larger than physical memory by storing pages on disk and loading them on demand. The page table maps virtual page numbers to physical frame numbers.

  31. What is cache coherence and name two protocols that maintain it.

    Cache coherence ensures all caches in a multiprocessor see a consistent value for a shared memory location. Protocols include snooping protocols (e.g., MESI write-invalidate) and directory-based protocols.

UGC NET Computer Science Computer System Architecture FAQ

What is in the UGC NET Computer Science Computer System Architecture syllabus?

UGC NET Computer Science Computer System Architecture is split into 11 chapters: Digital Logic Circuits and Components, Data Representation, Register Transfer and Microoperations, Basic Computer Organization and Design, Programming the Basic Computer, Microprogrammed Control, Central Processing Unit, Pipeline and Vector Processing, Input-Output Organization, Memory Hierarchy and Multiprocessors. Together they contain 69 topics.

How many chapters are in UGC NET Computer Science Computer System Architecture?

11 chapters, containing 69 topics. The largest chapter is Digital Logic Circuits and Components, with 12 topics.

Are there flashcards for UGC NET Computer Science Computer System Architecture?

Yes — a 51-card Computer System Architecture deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.