Video Notes: Computer Architecture and Operating Systems

0.0(0)
studied byStudied by 0 people
GameKnowt Play
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/88

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards derived from the lecture notes covering computer architecture, hardware, assembly language, operating systems, and popular OS concepts.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

89 Terms

1
New cards

Binary system

Base-2 counting system used by computers, using digits 0 and 1.

2
New cards

Bit

A single binary digit; the smallest unit of data (0 or 1).

3
New cards

Byte

8 bits; a common data unit in computing.

4
New cards

Transistor

Electronic switch in a semiconductor used to control electrical current.

5
New cards

MOSFET

Metal-oxide-semiconductor field-effect transistor; common type of transistor in chips.

6
New cards

nMOS

N-type MOS transistor; conducts when the gate is at a positive voltage.

7
New cards

pMOS

P-type MOS transistor; conducts when the gate is at a low voltage.

8
New cards

Logic gate

Digital building block that performs a boolean operation (AND, OR, NOT, NAND, NOR, XOR).

9
New cards

NOT gate

Inverter; outputs the complement of the input.

10
New cards

AND gate

Logic gate that outputs 1 only if both inputs are 1.

11
New cards

OR gate

Logic gate that outputs 1 if at least one input is 1.

12
New cards

XOR gate

Exclusive OR gate; outputs 1 if exactly one input is 1.

13
New cards

NAND gate

NOT-AND; outputs 0 only if both inputs are 1.

14
New cards

NOR gate

NOT-OR; outputs 1 only if both inputs are 0.

15
New cards

Digital circuit

Electronic circuit that processes discrete values (0s and 1s).

16
New cards

Combinational circuit

Output depends only on current inputs.

17
New cards

Sequential circuit

Output depends on current and past inputs (requires memory).

18
New cards

State variable

Bits that store the past state of a system.

19
New cards

Full adder

Circuit that adds two bits plus a carry-in; produces sum and carry-out.

20
New cards

Turing machine

Abstract CPU model with a read/write head, tape, and state table; foundation of computing theory.

21
New cards

ENIAC

Early large-scale digital computer built in 1943; used vacuum tubes.

22
New cards

Jacquard loom

Programmable loom using punched cards; ancestor of punched-card computers.

23
New cards

Babbage machine

Early mechanical calculators (Difference Engine) that influenced later computing ideas.

24
New cards

Hollerith’s tabulator

Electric punched-card system; led to IBM.

25
New cards

COBOL

First high-level business language developed in the 1950s.

26
New cards

UNIX

Unix time-sharing operating system developed at Bell Labs (1969).

27
New cards

GUI

Graphical user interface; enables interaction via visuals and a mouse.

28
New cards

Transistor vs vacuum tubes

Transistors replaced bulky, power-hungry vacuum tubes in computers, enabling smaller, faster machines.

29
New cards

Von Neumann architecture

Computer architecture where CPU, memory, and I/O share a single memory and bus; fetch-decode-execute cycle.

30
New cards

Harvard architecture

architecture with separate data and instruction memories and buses for parallel access.

31
New cards

ISA

Instruction Set Architecture; the programmer-visible interface to the processor.

32
New cards

RISC

Reduced Instruction Set Computer; small, simple, regular instruction set (e.g., ARM).

33
New cards

CISC

Complex Instruction Set Computer; large set of instructions (e.g., x86).

34
New cards

MIPS

A 32-bit RISC ISA used for education; emphasizes regularity and simplicity.

35
New cards

Program counter (PC)

Register that holds the address of the next instruction to fetch.

36
New cards

Instruction Register (IR)

Holds the fetched instruction being decoded/executed.

37
New cards

MAR

Memory Address Register; holds the address to access in memory.

38
New cards

MDR

Memory Data Register; holds data being read from or written to memory.

39
New cards

Accumulator (AC)

Register that stores intermediate results of arithmetic/logic operations.

40
New cards

Machine language

Low-level language consisting of 0s and 1s understood by the CPU.

41
New cards

Assembly language

Human-readable symbolic representation of machine instructions; uses mnemonics.

42
New cards

Mnemonic

Symbolic name for an operation in assembly language.

43
New cards

Immediate instruction

Instruction that uses a constant value encoded in the instruction (e.g., addi).

44
New cards

R-type/I-type/J-type

MIPS instruction formats: R-type (register), I-type (immediate), J-type (jump).

45
New cards

Hexadecimal (hex)

Base-16 number format used for compact machine-language representation.

46
New cards

SPIM

Self-contained simulator for MIPS32 programs.

47
New cards

Sign extension

Extending a smaller signed value to a larger width by repeating the sign bit.

48
New cards

Byte-addressable memory

Memory where each byte has its own address.

49
New cards

Latency/CPI/clock period

CPI: cycles per instruction; clock period (TC): time per clock; latency: overall time.

50
New cards

CPU single-cycle vs multi-cycle vs pipelined

Different approaches to completing instructions per cycle in CPU design.

51
New cards

Hardware Description Language (HDL)

Declarative language (e.g., Verilog, VHDL) used to model hardware structures.

52
New cards

HDL purposes

Logic simulation and logic synthesis to generate gates from high-level descriptions.

53
New cards

Verilog/VHDL

HDL languages used to describe hardware behavior and structure.

54
New cards

ASIC/FPGA

IC design: ASICs are pre-programmed; FPGAs are programmable hardware blocks.

55
New cards

Von Neumann bottleneck

Data and instructions share the same memory and bus, causing potential stalls.

56
New cards

IEEE/Verilog/VHDL standards

IEEE standards governing HDL syntax and semantics.

57
New cards

Unit 2: Architecture vs Organization

Architecture describes capabilities/programming model; Organization covers physical implementation.

58
New cards

Instruction set architecture (ISA)

Defines the machine language visible to programmers and compilers.

59
New cards

MIPS microarchitecture

Implementation of the MIPS ISA, including datapath and control.

60
New cards

RISC vs CISC (recap)

Two ISAs philosophies: simple regular instructions vs complex multi-step instructions.

61
New cards

Registers (MIPS)

32 general-purpose registers with conventional names like $t0–$t9, $s0–$s7, etc.

62
New cards

lw / sw

Load word / store word; memory access instructions in MIPS.

63
New cards

Memory hierarchy (RAM/ROM)

Volatile vs non-volatile memory organized in layers for speed and cost.

64
New cards

I/O devices

Inputs and outputs enabling computer interaction with the outside world.

65
New cards

Monolithic vs Microkernel OS

Two OS architectures: large single kernel vs small core kernel with servers.

66
New cards

MINIX 3

Microkernel OS used as example for modular design and reliability.

67
New cards

File system concepts (MBR, partition, superblock, i-nodes)

Structures governing how data is stored and addressed on disks.

68
New cards

RAID

Redundant Array of Independent Disks; improves reliability/throughput.

69
New cards

Linux kernel and VFS

Monolithic kernel with a Virtual File System layer for multiple FS types.

70
New cards

Darwin/XNU/Mach/ BSD/I/O Kit

Apple macOS kernel environment composition and layers.

71
New cards

POSIX

Standard set of interfaces for OS compatibility.

72
New cards

Process vs Thread

Process: a running program with its own memory; Thread: lightweight unit of execution within a process.

73
New cards

Process states

Ready, Running, Blocked; transitions managed by the scheduler.

74
New cards

Round-robin scheduling

Fair CPU time allocation where each process gets a fixed quantum.

75
New cards

File naming conventions

OS-specific rules for naming files (Windows, UNIX, MS-DOS).

76
New cards

i-nodes

Filesystem data structures storing metadata about files.

77
New cards

MBR/partition table/superblock

Disk structures for booting, partitions, and filesystem metadata.

78
New cards

ACL (Access Control List)

List assigning access rights to users or domains for objects.

79
New cards

POLA (Principle of Least Authority)

Limit rights granted to entities to the minimum necessary.

80
New cards

TCB (Trusted Computing Base)

Hardware/software core trusted for system security.

81
New cards

Reference monitor

Security component that enforces access control on system calls.

82
New cards

OS architecture concepts (Windows/macOS/Linux/Android)

Different OS families and how their kernels, layers, and stacks are organized.

83
New cards

Android runtime (ART)

Android’s runtime system that translates bytecode to machine code (AOT).

84
New cards

Darwin/macOS architecture

Apple’s OS stack: Mach kernel, BSD layer, I/O Kit, and GUI components.

85
New cards

Unix/Linux layers

Hardware → Kernel → Standard library → Shell/GUI; includes VFS and system calls.

86
New cards

Linux command/utilities

Shell tools (cp, ls, mv, cat, chmod, etc.) used for system tasks.

87
New cards

Windows history/generations

MS-DOS → Windows NT → Modern Windows family.

88
New cards

macOS/iOS architecture

Darwin-based macOS with XNU kernel; iOS uses ARM architecture and security layers.

89
New cards

Android architecture stack

Linux kernel, ART, libraries, application framework, and apps.