CPU Architecture, Instruction Set Principles, and Computer Fundamentals

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/32

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering CPU architecture, instruction set principles, operating system structures, digital computer components, and digital logic circuits.

33 Terms

1
New cards

Operating System (OS)

A program that manages computer hardware, provides a basis for application programs, and acts as an intermediary between the computer user and hardware.

2
New cards

Bootstrap Program

The initial program stored in ROM that executes when a computer is powered up or rebooted; it locates and loads the operating system kernel into main memory.

3
New cards

Interrupt

A hardware or software signal sent to the CPU that causes it to halt current execution and immediately transfer control to an interrupt service routine.

4
New cards

System Call

A special software-triggered operation (also known as a monitor call) that requests services directly from the operating system kernel.

5
New cards

Interrupt Service Routine (ISR)

A predefined software routine located at a fixed memory address that specifies the exact instructions executed to handle a specific interrupt.

6
New cards

Direct Memory Access (DMA)

An I/O technique where the device controller transfers an entire block of data directly to or from its own buffer to main memory without CPU intervention, generating only one interrupt per block.

7
New cards

Multiprogramming

An operating system technique that increases CPU utilization by holding multiple jobs in memory simultaneously, allowing the CPU to execute another program whenever one waits for I/O.

8
New cards

Multitasking (Time-Sharing)

A logical extension of multiprogramming in which the CPU switches between user jobs in small time slots so rapidly that users can interact with each program while it runs.

9
New cards

Mechanism vs. Policy

A fundamental software engineering design separation where mechanisms determine how something is done, while policies determine what will be done.

10
New cards

Microkernel

An operating system structure that strips non-essential components from the kernel and implements them as user-level system programs communicating via message passing.

11
New cards

Computer Architecture

The design and structure of a computer system visible to the programmer/user, including the instruction set, addressing modes, data types, and I/O mechanisms (what the system does).

12
New cards

Computer Organization

The internal operational units and physical interconnections that implement architectural specifications, such as memory technology, control signals, and bus structures (how the system works).

13
New cards

Arithmetic and Logic Unit (ALU)

The functional hardware unit within the CPU that executes arithmetic operations (such as addition and subtraction) and Boolean logical operations.

14
New cards

Control Unit (CU)

The processing component that directs and coordinates the flow of data and instructions between all units of a computer by issuing timed control signals.

15
New cards

Mainframe Computer

A large, powerful computer system designed for multi-user enterprise environments and high-volume, intensive computational tasks such as banking and reservations.

16
New cards

Supercomputer

The most powerful class of computers, utilizing massive multiprocessing and parallel processing architectures to execute complex scientific simulations such as weather modeling.

17
New cards

Macro-operation

A high-level operation defined at the architecture level by an individual machine instruction opcode, which is decomposed into one or more register transfer operations.

18
New cards

Micro-operation

An elementary hardware operation performed on data residing in registers during a single clock cycle, including register transfers, arithmetic, logic, and shifts.

19
New cards

Datapath

The hardware subsystem of a processor responsible for processing and storing data, consisting of the ALU, internal registers, buses, and signal driver/receiver circuits.

20
New cards

Program Status Word (PSW)

A register containing both status flags (reflecting arithmetic/logical operation outcomes) and control flags (governing CPU behavior such as interrupt handling).

21
New cards

Trap Flag (TF)

A processor control flag that enables single-step execution mode for program debugging by generating an internal interrupt after each individual instruction is executed.

22
New cards

XLAT Instruction

A translate instruction that converts a data code from one format or encoding into another using a memory lookup table.

23
New cards

ESC Instruction

A processor control instruction indicating that the subsequent instruction is intended for execution by an attached coprocessor rather than the host CPU.

24
New cards

LOCK Instruction

A bus-control instruction prefix that reserves the shared system bus and memory until the operation immediately following it finishes executing.

25
New cards

Bit

The smallest fundamental unit of binary data, representing one of two discrete electrical states: logic 00 or logic 11.

26
New cards

NAND Gate

A universal logic gate representing an inverted AND function ((A⋅B)′(A \cdot B)') whose output is logic 00 only when all inputs are logic 11.

27
New cards

NOR Gate

A universal logic gate representing an inverted OR function ((A+B)′(A + B)') whose output is logic 11 only when all inputs are logic 00.

28
New cards

Exclusive-OR (XOR) Gate

A logic gate whose output is 11 if any single input is 11, but evaluates to 00 if both inputs are identical (00 and 00, or 11 and 11).

29
New cards

Exclusive-NOR (XNOR) Gate

A logic gate producing an output of 11 only when both inputs are equal to each other (00 and 00, or 11 and 11); the logical complement of the XOR gate.

30
New cards

DeMorgan's First Theorem

A Boolean identity stating that the complement of a logical sum equals the logical product of the individual complements: (x+y)′=x′⋅y′(x + y)' = x' \cdot y'.

31
New cards

DeMorgan's Second Theorem

A Boolean identity stating that the complement of a logical product equals the logical sum of the individual complements: (x⋅y)′=x′+y′(x \cdot y)' = x' + y'.

32
New cards

Minterm

A Boolean product term containing every variable of a function in either complemented or uncomplemented form, corresponding to a single row in a truth table.

33
New cards

Karnaugh Map (K-Map)

A visual, grid-based representation of a truth table used to simplify Boolean expressions by grouping adjacent minterm cells in powers of two (2n2^n).