Computer Architecture Midterm Exam

In a typical memory hierarchy or bus system, can read and write operations be executed at the same time?

• Yes, always-read and write are independent and parallel by design

• No, never-memory can only handle one operation at a time

• It depends on the hardware architecture and memory/bus design

• Yes, but only if they target different addresses in cache

• Only if the CPU supports dual-ported memory modules

What is DDR RAM (Double Data Rate Random Access Memory)?

• A type of ROM used for permanent storage in embedded devices

• A memory type that transfers data on both rising and falling edges of the clock signal

• A cache memory integrated directly into the CPU for faster access

• A legacy memory format used only in floppy disk controllers

• A virtual memory technique used to expand RAM size on hard disks

RAM (Random Access Memory) is a volatile type of memory, meaning it loses its data when the power is turned off.

• True

• False

What is the primary purpose of a Karnaugh Map (K-map) in digital logic design?

• To represent the sequence of instructions in a processor pipeline

• To visually simplify Boolean algebra expressions by grouping adjacent 1s

• To convert binary numbers into hexadecimal format

• To simulate real-time memory access in embedded systems

• To generate truth tables for complex arithmetic operations

Which of the following best describes associative cache mapping?

• Each block of main memory maps to exactly one location in the cache

• Any block of main memory can be stored in any cache line

• Cache blocks are grouped into sets, and each block maps to one set only

• It uses the highest memory address bits as a direct index into the cache

• It maps cache lines using page tables and virtual addresses

What is the defining characteristic of associative cache mapping?

• Each memory block is mapped to a specific, fixed location in the cache

• The cache is divided into sets, and each block can only go into one assigned set

• A memory block can be placed in any cache line, offering complete flexibility

• Memory blocks are stored based on virtual addresses and page numbers

• It uses a hashing function to calculate cache indices from memory addresses

What best defines direct-mapped cache?

• Every memory block can go into any cache line, offering maximum flexibility

• Each memory block is mapped to a single, predetermined cache line based on address bits

• Cache lines are grouped into sets, and memory blocks map to one of several cache lines in a set

• Memory blocks are stored using virtual addressing for faster lookup

• Cache data is organized dynamically using LRU-based hashing

In which of the following real-life scenarios is a Karnaugh Map most likely to be applied?

• Encrypting data for secure network communication

• Minimizing logic in digital circuits for hardware design

• Scheduling tasks in an operating system kernel

• Managing file systems in cloud storage solutions

• Rendering 3D graphics in video game engines

What is a key difference between direct-mapped cache and associative cache?

• Direct mapping uses full memory address comparison for cache lookup; associative does not

• Associative cache allows each block to be mapped to one line; direct allows multiple

• Direct-mapped cache is slower but more flexible than associative mapping

• Associative mapping allows a memory block to go into any cache line, while direct mapping assigns it to one fixed line

• Both use the same tag matching process and indexing logic

From the video watched in-class "A short history of the computer", before transistors were invented, computers' electronic circuits were built on which component?

• Integrated Circuits (ICs)

• Vacuum Tubes

• Optical Fibers

• Magnetic Relays

• Crystal Oscillators