40 hours over 10 weeks (2 two-hour meetings per week)
Introduction to operating systems. Process management and scheduling.
Concurrency control. Synchronization problem. Critical section problem.
Language constructs for concurrent programming. Deadlock handling.
Memory management. File systems. Performance. Distributed operating
systems. Prerequisite: COEN 12 (Abstract Data Types and Data
Course Learning Objective:
Overview of operating systems design issues. Mastery of process vs.
thread concepts; process synchronization and communication. Ability to
design and analyze process and disk scheduling algorithms. Awareness of
deadlock issues. An understanding of memory management, contiguous
allocation, paging, and segmentation schemes. Introductory knowledge of
basic networking principles.
Hardware, software, and memory. Secure and safe system programming.
Secure system administration and configuration. Operating system
security mechanisms for authorization, authentication, and audit.
Method of Instruction:
Lecture, homeworks, several programming projects
Tests, quizzes, projects
| © 2006 Center for
Advanced Study and Practice of
Information Assurance (CASPIA), Santa Clara University