Computer Architecture Quiz
45 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

What is a primary characteristic of fixed program computers?

  • They are designed to update their programs frequently.
  • They require external storage for program execution.
  • Their functionality is permanently written into a chipset. (correct)
  • They can perform a variety of tasks based on user input.
  • Which statement best describes embedded systems?

  • They are capable of performing complex calculations like general-purpose computers.
  • They have microprocessors that are flexible and can be reprogrammed easily.
  • They rely on multiple external devices to execute their programs.
  • They are built to perform specific tasks and cannot adapt to new functions. (correct)
  • What is a key feature of stored program computers based on the Von Neumann architecture?

  • They perform tasks only predetermined at the time of manufacturing.
  • They do not store programs in memory.
  • They operate using hardwired microcontrollers.
  • They allow programmers to change the functionality through stored programs. (correct)
  • What is the role of the control unit within a CPU?

    <p>To generate control signals for coordinating other components.</p> Signup and view all the answers

    Which of the following components is NOT typically found in a CPU?

    <p>External storage unit</p> Signup and view all the answers

    What is the primary operation associated with Boolean algebra?

    <p>Logical operations</p> Signup and view all the answers

    Who introduced Boolean algebra and contributed to the binary number system?

    <p>George Boole</p> Signup and view all the answers

    Which of the following best describes the role of the Arithmetic and Logic Unit (ALU)?

    <p>It performs mathematical and logical operations.</p> Signup and view all the answers

    What concept is utilized in a microprogrammed control unit to manage instruction execution?

    <p>Microprogram sequencing</p> Signup and view all the answers

    Which of the following describes a type of memory that is characterized by its permanence and reads only operations?

    <p>Read-Only Memory (ROM)</p> Signup and view all the answers

    Which of the following modes of data transfer allows the CPU to remain involved in the data transfer process?

    <p>Programmed I/O</p> Signup and view all the answers

    What is the main disadvantage of pipelining in computer architecture?

    <p>Structural hazards</p> Signup and view all the answers

    What does the term 'operand forwarding' refer to in pipelining?

    <p>Passing data directly between pipeline stages</p> Signup and view all the answers

    What is the primary function of a full adder in the circuit described?

    <p>To receive the value of B and add it to A</p> Signup and view all the answers

    How does Booth's algorithm optimize binary multiplication?

    <p>By reducing the number of additions and subtractions</p> Signup and view all the answers

    What is a key advantage of using an array multiplier over a sequential multiplier?

    <p>Faster computation as product bits are formed all at once</p> Signup and view all the answers

    In the restoring division algorithm, what happens when the value of QO is 0?

    <p>A remains unchanged</p> Signup and view all the answers

    What is the effect of setting M = 1 in the circuit operation described?

    <p>B is complemented</p> Signup and view all the answers

    Which of the following best describes the role of AND gates in an array multiplier?

    <p>To generate the product terms from inputs</p> Signup and view all the answers

    In the restoring division algorithm, what is the purpose of the operation A = A - M?

    <p>To prepare for another cycle in division</p> Signup and view all the answers

    What was Andrew Donald Booth known for in the field of computer science?

    <p>Pioneering binary multiplication algorithms</p> Signup and view all the answers

    What is the main function of the ALU in a computer system?

    <p>To perform operations on data</p> Signup and view all the answers

    Which component is responsible for ordering operations such as fetch, decode, and execute?

    <p>Timing circuit</p> Signup and view all the answers

    What does the address bus do in a CPU?

    <p>Identifies specific input/output devices</p> Signup and view all the answers

    What is the role of the control bus in data transfer?

    <p>It sends functional codes to selected devices</p> Signup and view all the answers

    Which of the following best describes bus arbitration?

    <p>A technique to handle simultaneous device requests</p> Signup and view all the answers

    How does daisy chaining function as a method of bus arbitration?

    <p>It propagates the bus request signal to the first requesting device</p> Signup and view all the answers

    What is a key purpose of the control unit in a CPU?

    <p>To generate control signals for other components</p> Signup and view all the answers

    What happens during the final step of data transfer using the data bus?

    <p>Either the CPU or the device will put data onto the data line</p> Signup and view all the answers

    What is the main purpose of using a base register in addressing?

    <p>To save the starting address of a program</p> Signup and view all the answers

    In which addressing mode is the content of the program counter added to an instruction's address part?

    <p>Relative Addressing Mode</p> Signup and view all the answers

    What is the role of the index register in Index Addressing Mode?

    <p>To indicate which element of an array to access</p> Signup and view all the answers

    What three inputs are required for a full adder's operation?

    <p>Two operands and a carry input</p> Signup and view all the answers

    What happens when two bits are added in a full adder when they generate a carry?

    <p>The carry is passed to the input of the next significant position</p> Signup and view all the answers

    What is the effective address formula when using a base address and offset?

    <p>Effective address = base address + offset</p> Signup and view all the answers

    What distinguishes Index Addressing Mode from other addressing modes?

    <p>It allows for accessing multiple array elements without changing the instruction</p> Signup and view all the answers

    Which component of a full adder corresponds to the carry from previous lower significant positions?

    <p>Carry input (Cin)</p> Signup and view all the answers

    What is the primary function of the data register (DR) in a CPU?

    <p>To store data that is to be transferred to or from memory.</p> Signup and view all the answers

    How does the fixed priority or independent request method manage bus access among multiple masters?

    <p>Through a built-in priority decoder that selects the highest priority request.</p> Signup and view all the answers

    What characteristic does the memory address register (AR) possess in terms of its bit width?

    <p>It uses 12 bits to accommodate the address space.</p> Signup and view all the answers

    Which register is used to hold intermediate arithmetic and logic results in the CPU?

    <p>Accumulator (AC)</p> Signup and view all the answers

    In the polling address generation method, what does the controller generate for each master?

    <p>Unique addresses based on priority.</p> Signup and view all the answers

    What happens when a master recognizes its own address in the polling method?

    <p>It activates a 'busy' signal and gains bus access.</p> Signup and view all the answers

    What distinguishes the temporary register (TR) from other registers?

    <p>It holds temporary data during processing.</p> Signup and view all the answers

    In a system with multiple masters, what effect does a master blocking the bus grant signal have?

    <p>It prevents other requesting modules from accessing the bus.</p> Signup and view all the answers

    Study Notes

    Video Chapters

    • Chapter 1: Introduction covers Boolean Algebra, computer types, functional units, buses, bus architecture, types of buses, bus arbitration, registers, organization, and addressing modes.
    • Chapter 2: Arithmetic and Logic Unit (ALU) details look-ahead carry adders, multiplication (Booth's algorithm and array multipliers), division, and logic operations, floating-point arithmetic, and ALU design. It also covers the IEEE standard for floating-point numbers.
    • Chapter 3: Control Unit explains instruction types, formats, instruction cycles (fetch and execute), micro-operations, program control (e.g., reduced instruction set computer), and control types (hardwired and microprogrammed).
    • Chapter 4: Memory explores basic concepts, hierarchy, semiconductor RAM memories (2D and 2 1/2D), ROM memories, cache memories (concepts and design), auxiliary memories (magnetic disk, magnetic tape, optical disks), and virtual memory concepts and implementation.
    • Chapter 5: Input/Output (I/O) discusses peripheral devices, I/O interfaces, I/O ports, interrupt hardware, interrupt types, exceptions, modes of data transfer (programmed I/O, interrupt initiated I/O, and direct memory access), and I/O channels and processors. It also covers communication interfaces (synchronous and asynchronous).
    • Chapter 6: Pipelining details the differences between uniprocessing and multiprocessing, pipelining, speedup, structural hazards, control hazards, data hazards, and operand forwarding.

    Boolean Algebra

    • The signal in most present-day electronic digital systems uses two discrete values, making it binary.
    • George Boole introduced the concept of a binary number system in logic studies, leading to Boolean algebra.
    • Boolean algebra is a branch of algebra where variables represent truth values (true/false, typically denoted 1 and 0).
    • Conjunction (AND) is denoted as A.
    • Disjunction (OR) is denoted as V.
    • Negation (NOT) is denoted as ¬.

    Turing Machine

    • The Church-Turing thesis states that any algorithmic procedure a human or computer can perform can also be carried out by a Turing machine.
    • The Turing machine is a theoretical model of a computer.

    Digital System

    • In the 1930s, Claude Shannon applied Boolean algebra to switching circuits, introducing switching algebra for circuit analysis and design.
    • This logic, organized and systematized by Shannon, is the basis for many digital hardware designs.
    • Boolean variables can take different values at various times.
    • They can represent input, output, or intermediate signals in circuits.
    • Boolean constants are 0 and 1.

    Historically Types of Computers

    • Fixed Program Computers/Dedicated Device/Embedded System: Their function is specific and cannot be reprogrammed (e.g., calculators, washing machines.)
    • Stored Program Computers/General Purpose computer/von Neumann architecture: Programmed to carry out many tasks with stored applications.

    Machine/CPU Architecture

    • A CPU has three main components: control unit (generates control signals), registers (temporary storage), and ALU (performs arithmetic and logic operations).
    • Registers include program counter (holding address), instruction register, and base registers.
    • Examples of ALU operations are addition, subtraction, comparisons, and bit shifting.

    Main Memory Elements

    • The main elements needed for a computer system include memory to store instructions, and an ALU to perform operations.
    • Registers are used as a fast memory.

    Bus Arbitration

    • Bus arbitration is a method to resolve simultaneous requests for access to a shared bus.
    • Without arbitration, data corruption and system malfunctions can occur.
    • Methods include daisy chaining (simple and cheaper) and polling.

    Addressing Modes

    • Addressing modes specify different ways to refer to operands in an instruction.
    • Effective address is the final address used to locate an operand. Methods include immediate (operand is part of instruction), direct (address of operand in instruction), indirect (address of address), and others.

    Stack Organization

    • A stack is an ordered list where elements are added and removed from only one end (top of stack).
    • It follows the Last-In, First-Out (LIFO) principle.
    • Stack pointer register (SP) stores the address of the top of the stack.

    Memory Organization

    • Memory organization can be simultaneous (all levels directly connected to CPU) or hierarchical (levels accessed sequentially based on hit rate).

    Cache Memory

    • Cache memory is a specialized fast memory that stores frequently accessed data.
    • Mapping algorithms determine where data from main memory is stored in the cache.
    • Methods include direct mapping, associative mapping, and set-associative mapping; each has different characteristics (e.g., cost, complexity).

    Cache Replacement Policies

    • Replacement policies are used when the cache is full and a new block needs to be loaded.
    • Common techniques include FIFO (First-In, First-Out), Optimal, LRU (Least Recently Used), MRU (Most Recently Used).

    Types of Miss

    • Compulsory miss occurs when the CPU reads a block from main memory for the first time.
    • Capacity miss occurs when the cache cannot hold all blocks needed for a program.
    • Conflict miss occurs in set-associative or direct-mapped caches when multiple blocks map to the same set or block frame.

    Floating-Point Representation

    • Floating-point numbers use a special representation storing a number as a mantissa and exponent.
    • The exponent is typically stored in biased form.

    IEEE 754 Standard

    • The IEEE 754 standard provides the formalization for floating-point arithmetic.
    • It defines conventions for accurate and consistent handling of these numbers in different hardware systems.

    Instruction Format

    • Instructions are classified into types based on the number of operands they use (e.g., 3-address, 2-address, 1-address, 0-address).

    Micro-Operation

    • A micro-operation is a small, atomic step in a sequence of operations. The operations are typically classified into groups such as register transfer, arithmetic, logic, or shift.

    I/O Management

    • I/O devices are independent devices that serve to communicate with the computer. The methods for data transfer include programmed I/O, interrupt-driven I/O, and direct memory access (DMA).

    I/O Processor

    • I/O processors are separate processors that handle input/output operations and communication with I/O devices, reducing the load on the main CPU.
    • It is separate to the main CPU so that the data can be passed freely without affecting the main CPU.

    Synchronous and Asynchronous Data Transfer

    • Synchronous data transfer uses a clock signal to synchronize operations between devices, while asynchronous communication uses handshaking signals, which are slower but good for varying speeds.

    Addressing Modes, Types and Examples

    • Describes different methods for specifying the location of data operands. Includes Immediate, Direct, Indirect and others.

    Types of Interrupts

    • Hardware interrupts are initiated by external devices, while software interrupts are instructions embedded in a program. Interrupt processing includes recognition, status saving, masking, acknowledgment, service routine execution, and restoration.

    Direct Memory Access (DMA)

    • DMA is a way for I/O devices to directly transfer data to main memory without continuous CPU intervention or instructions.

    Uniprocessing and Multiprocessing

    • Uniprocessing involves a single CPU executing instructions sequentially, whereas multiprocessing allows multiple CPUs to handle multiple tasks concurrently.

    Pipelining

    • Pipelining achieves concurrent instruction execution. Operations are divided into stages or phases, and multiple instructions are processed concurrently in different stages at the same time.

    Control Word Sequencing

    • Control word sequencing in microprogramming involves fetching control words to specify control signals for executing instructions.

    Memory Mapping, Hierarchy and Usage

    • Memory is organized in a hierarchy with varying levels of speed, capacity, and cost to organize and store data required by a system. Includes registers, cache memory, main memory, secondary memory.

    Replacement Algorithms, Locality of Reference and Cache Mapping

    • Replacement algorithms determine how a cache chooses which blocks to replace when a new block must be brought into a full cache. Locality of Reference is very important. Cache mapping determines where data from main memory is stored in the cache. This includes the methods like Direct, Fully Associative, and Set Associative mapping.

    Other Topics

    • The document has additional sections on specifics of the memory, different cache mapping methods (Direct, Set-associative, Fully-associative), and details of different types of ROM (e.g., masked ROM, PROM, EPROM, EEPROM, flash memory).
    • There are details on the specific characteristics of CISC and RISC types of architecture in terms of instructions and designs.

    Studying That Suits You

    Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

    Quiz Team

    Related Documents

    Description

    Test your knowledge of computer architecture concepts with this quiz. Topics include fixed program computers, embedded systems, and the Von Neumann architecture. Join now to assess your understanding of CPUs, ALUs, and Boolean algebra.

    More Like This

    Use Quizgecko on...
    Browser
    Browser