Learn · Computer Science 61C - Spring 2010
Lecture 3 of 392010-01-2753 min
Lecture 3: Introduction to C
Daniel D. GARCIA · University of California, Berkeley
Credits and licence
- From
- Computer Science 61C - Spring 2010, University of California, Berkeley (at Internet Archive)
- Licence
- CC BY-NC-ND 3.0, as Internet Archive states it. Non-commercial use only, and no changed versions.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 1: Course Introduction
- Lecture 2: Number Representation
- Lecture 3: Introduction to C
- Lecture 4: C Pointers, Arrays, Strings
- Lecture 5: C Structures, scanf, malloc
- Lecture 6: Memory Management I
- Lecture 7: Memory Management II
- Lecture 8: MIPS Intro
- Lecture 9: MIPS lw, sw, Decisions I
- Lecture 10: MIPS Decisions II
- Lecture 11: MIPS Procedures I
- Lecture 12: MIPS Procedures and Logic Ops
- Lecture 13: MIPS Instruction Format I
- Lecture 14: MIPS Instruction Format II
- Lecture 15: Floating Point I
- Lecture 16: Floating Point II
- Lecture 17: MIPS Instruction Format III
- Lecture 18: Compilation, Assembly, Linking I
- Lecture 19: Compilation, Assembly, Linking II
- Lecture 20: Students solve the Midterm
- Lecture 21: Intro to Synch. Digital Systems
- Lecture 22: State Elements
- Lecture 23: State Elements
- Lecture 24: Combinational Logic
- Lecture 25: CPU Design: Single-Cycle I
- Lecture 26: CPU Design: Single-Cycle II
- Lecture 27: CPU Design: Control
- Lecture 28: CPU Design: Pipelining I
- Lecture 29: CPU Design: Pipelining II
- Lecture 30: Caches I
- Lecture 31: Caches II
- Lecture 32: Caches III
- Lecture 33: Virtual Memory I
- Lecture 34: Virtual Memory II
- Lecture 35: I/O: Basics, Storage, and Networks
- Lecture 36: Performance
- Lecture 37: Intra-machine Parallelism: pthreads
- Lecture 38: Inter-machine Parallelism: mpi/map reduce
- Lecture 39: Summary, Review, and Evaluation