UGC NET Computer Science Computer System Architecture Syllabus

Computer System Architecture syllabus — full chapter and topic list

Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Computer System Architecture in UGC NET Computer Science, not a summary of it.

1. 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. 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. 3

   Register Transfer and Microoperations

   3 topics

   • Register Transfer Language
   • Bus and Memory Transfers
   • Arithmetic, Logic and Shift Microoperations
4. 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. 5

   Programming the Basic Computer

   6 topics

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

   Microprogrammed Control

   3 topics

   • Control Memory
   • Address Sequencing
   • Design of Control Unit
7. 7

   Central Processing Unit

   6 topics

   • General Register Organization
   • Stack Organization
   • Instruction Formats
   • Addressing Modes
   • RISC Computer
   • CISC Computer
8. 8

   Pipeline and Vector Processing

   5 topics

   • Parallel Processing
   • Pipelining
   • Arithmetic Pipeline
   • Instruction Pipeline
   • Vector Processing Array Processors
9. 9

   Input-Output Organization

   7 topics

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

    Memory Hierarchy

    6 topics

    • Main Memory
    • Auxiliary Memory
    • Associative Memory
    • Cache Memory
    • Virtual Memory
    • Memory Management Hardware
11. 11

    Multiprocessors

    6 topics

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

Computer System Architecture flashcards for UGC NET Computer Science

24 of 51 cards from the Computer System Architecture deck — real questions with worked 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.

21. 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).

22. 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).

23. 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.

24. 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.

See more Computer System Architecture flashcards →

Planning Computer System Architecture for UGC NET Computer Science

Computer System Architecture (UGC NET Computer Science) FAQ