Operating Systems

Before Class:
Syllabus

Class:
Introduction
Syllabus
Hello, world
Class notes

Before Class:
Set-up a Linux environment and C compiler (instructions for Windows)
Preprocessor Directives
Session 1: Intro to C and Pointers (start at 3:20) (from Dr. Obando's C Workshop)

Class:
Hello, world
C: Compiling
C: Preprocessor
C Exercises
Class notes

Before Class:
Casting and Misc. Operators
Session 2: Arrays and Pointer Arithmetic (audio is garbled)

Class:
C: Preprocessor
C: Comments
Class notes

Due:
Quiz: Syllabus & C (on CougarVIEW)

Before Class:
Quiz: C: Preprocessor and Comments

Class:
C: Numeric Data Types
C Exercises
Class notes

Before Class:
Session 3: Strings
Session 4: Parsing (strings)
Session 5: Parsing strings and working with tokens (part 1)
Session 6: Parsing strings and working with tokens (part 2)
Session 8: Binary to String Conversion Function
Session 9: String to Binary Conversion Function

Class:
C: Variables (example)
C: Type conversion (example)
C: Arrays
C Exercises
Class notes

Before Class:
Quiz: Data Types and Type Conversion and Arrays
Session 7: Bit Flags (Booleans)
Session 11: Typedefs and Structs

Class:
C: Arrays
C: Pointers
C Exercises
Class notes

Before Class:
C-style Strings

Class:
C: Pointers
C: C-style Strings
C Exercises
Class notes

Before Class:
Quiz: Pointers and C-Style Strings
Dynamic Memory Allocation in C (8:28)
Switch Statements
Do-while Loops
For Loops

Class:
C: Command-line arguments
C: Libraries
C: Memory Allocation (example)
C Exercises
Class notes

Before Class:
Quiz: C-Style Strings and Command-line arguments and Libraries and Memory Allocation and Control Structures
Section 4 (5 pages)
Sections 16.1 - 16.3 (pages 109 - 143)

Class:
C: Control Structures
C: Structured Data Objects
C: Functions
C Exercises
Class notes

Before Class:
Quiz: Structs and Functions
Preface (4 pages)
Chapter 1 Dialogue (2 pages) http://ostep.org/dialogue-threeeasy.pdf Chapter 2 Introduction (18 pages)
Quiz: Chapter 2

Class:
C: File I/O
C Class notes

Before Class:
Quiz: File I/O
Chapter 3 Dialogue (2 pages)
Chapter 4 Processes (12 pages)
Quiz: Chapter 4

Class:
Overview of virtualization, concurrency, persistence and history of OSs
Intro Class notes
Processes
Process creation
Process state (exercises)
Processes Class notes

Before Class:
Chapter 5 Process API (11 pages)
Quiz: Chapter 5

Class:
UNIX Shell Command Line (Unix Commands)
Process API: fork(), exec(), and wait()

Due:
Project 1

Before Class:
Chapter 6 Direct Execution (14 pages)
Quiz: UNIX commands
Quiz: Chapter 6

Class:
Process API: fork(), exec(), and wait()
Direct execution
User & kernel modes
Class Notes

Before Class:
Chapter 7 CPU Scheduling (12 pages)
Chapter 8 Multi-level Feedback (12 pages)
Chapter 9 Lottery Scheduling (10 pages) (9.0 - 9.1, skim the rest)
Chapter 11 Summary (2 pages)
Quiz: Chapter 7
Quiz: Chapters 8 & 9

Class:
Context switches
CPU scheduling
Turnaround time
Response time
Scheduling algorithms: FIFO, shortest job first, shortest time-to-completion first, round robin
CPU scheduling using a multi-level feedback queue

Class:
Lottery scheduling
Exam #1 Game Review (topics)

Class:
Exam 1 (in CCT 409) (topics)

Before Class:
Chapter 12 Dialogue (ignore the rude professor's remarks) (2 pages)
Chapter 13 Address Spaces (9 pages)
Quiz: Chapter 13

Class:
Address spaces

Before Class:
Chapter 14 Memory API (11 pages)
Chapter 15 Address Translation (14 pages)
Quiz: Chapter 14
Quiz: Chapter 15

Class:
Memory allocation (malloc(), free())
Types of memory: stack and heap
Address translation (virtual and physical addresses)
Base and bounds address translation

Before Class:
Chapter 16 Segmentation (12 pages)
Quiz: Chapter 16

Class:
Address translation (virtual and physical addresses)
Base and bounds address translation

Before Class:
Chapter 17 Free Space Management (17 pages)
Quiz: Chapter 17

Class:
Segmentation (exercises) (translation code)

Before Class:
Chapter 17 Free Space Management (17 pages)

Class:
Segmentation (exercises) (translation code)
Free Space Management (exercises)
External fragmentation
Internal fragmentation
Free space management strategies
Class Notes

Before Class:
Chapter 18 Introduction to Paging (14 pages)
Quiz: Chapter 18

Class:
Paging
Virtual page number (VPN) and offset
Physical frame number

Before Class:
Sections 19.0 & 19.8 (1 1/2 pages)
Sections 20.0 & 20.6 (1 page)
Chapter 21 Beyond Physical Memory: Mechanisms (11 pages)


Class:
Page tables and page table entries

Before Class:
Chapter 22 Swapping: Policies (18 pages)
Chapter 24 Summary (3 pages)
Quiz: Chapter 22

Class:
Translation-lookaside Buffers (TLBs)
Swap space
Page-faults

Class:
Page-replacement policies (e.g., Optimal, FIFO, Random, LRU, Clock) (exercises)

Due:
Project 2

Before Class:
Chapter 25 Dialogue (2 pages)
Chapter 26 Concurrency and Threads (16 pages)
Quiz: Chapter 26

Class:
Critical section

Before Class:
Chapter 27 Thread API (12 pages)
Quiz: Chapter 27

Class:
Race condition
Indeterminate programs
Mutual exclusion
Threads
Thread creation
Thread completion
Locks
Condition variables

Before Class:
Sections 28.0 - 28.8 and 28.12 - 28.17 (20 pages)

Class:
Locks
Pthread locks
Spin-wait
Test-and-set instructions
Spin locks

Before Class:


Class:
Exam2 Game Review (topics)

Class:
Exam2 In CCT 407 (topics)

Before Class:
Chapter 30 Condition Variables (17 pages)

Class:
Condition variables (Producer/consumer problem)

Before Class:
Chapter 31 Semaphores (18 pages)

Class:
Semaphores
Binary semaphores (locks)

Before Class:
Chapter 32 Common Concurrency Problems (17 pages)

Class:
Readers-Writers Lock
Dining philosophers problem

Before Class:
Chapter 32 Common Concurrency Problems (17 pages)
Chapter 34 Summary (2 pages)

Class:
Non-deadlock currency bugs
Deadlock
Conditions for deadlock
Deadlock prevention
Deadlock Avoidance

Before Class:
Chapter 35 Dialogue (2 pages)
Chapter 36 I/O Devices (13 pages)

Class:
Deadlock Avoidance
I/O devices
CPU-guided data movement
Interrupts
Interrupt service routines / interrupt handlers
Direct memory access data movement

Before Class:
Chapter 37 Hard Disk Drives (17 pages) (skim 37.5)
Chapter 38 Redundant Disk Arrays (RAIDs) (19 pages) (Intro, summary and know what each level does and is good for)
Quiz: Chapters 37 & 38

Class:
Hard disk drives
Hard disk drives' physical structure
I/O Timing

Class:
Disk Scheduling
Redundant array of inexpensive disks (RAIDs)

Due:
Project 3 - Thread Synchronization

Before Class:
Chapter 39 Files and Directories (19 pages)

Class:
Files
Creating files
Reading and writing files
Removing files

Before Class:
Chapter 40 File System Implementation (18 pages)

Class:
Directories
Making directories
Reading directories
Deleting directories
Hard & symbolic links
Mounting a file system
File system implementation
Inodes

Before Class:
Sections 44.0 & 44.11 Flash-based SSDs (2 pages)
Chapter 46 Summary (2 pages)

Class:
Flash-based SSDs
SSD performance
Final Game Review

Class:
Final (CCT 409, 4:15 - 6:45 PM) (topics)