Self learn MIT-6.004 Computation Structure via:
Status of Lecture:
- L01 Basic of Information
- L02 The Digital Abstraction
- L03 CMOS Technology
- L05 Sequential Logic
- L06 Finite State Machine
- L07 Performance Measures
- L08 Design Tradeoffs
- L09 Instruction Set Architectures
- L10a Assembly Language
- L10b Models of Computation
- L11 Compilers
- L12 Procedures & Stack
- L13 Building the Beta
- L14 The Memory Hierachy
- L15 Pipeling the Beta
- L16 Virtual Memory
- L17 Virtualizing the Processor
- L18 Devices & Interrupts
- L19 Concurrency & Synchronization
- L20 System-level Communication
- L21 Parallel Processing
Status of Lab:
- Lab1 CMOS Technology
- Lab2 CMOS Adder
- Lab3 FSMs
- Lab4 32-bit ALU
- Lab5 Assembly Language
- Lab6 Procedures & Stacks
- Lab7 Building the Beta
- Lab8 Caches
- Lab9 Emulating Instructions
- Lab10 Tiny Operating System
- Lab11 Optimizing the Beta
Status of Problem:
- prob1 Basic of Information
- prob2 The Digital Abstraction
- prob3 CMOS Technology
- prob4 Gates and Boolean Logic
- prob5 Synthesis of combinational logic
- prob6 Sequential Logic
- prob7 Finite State Machine
- prob8 Synchronization and metastability
- prob9 Pipeling
- prob10 Models of Computation
- prob11 Programmable machines
- prob12 Machine language
- prob13 Procedures & Stacks
- prob14 Building the Beta
- prob15 Memory Hierachy
- prob16 Caches
- prob17 Virtual Memory
- prob18 Operating System issues
- prob19 Interrupts and real time
- prob20 Semaphores
- prob21 Pipeling Beta