Nothing Special   »   [go: up one dir, main page]

Course Outline-1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

MUFULIRA COLLEGE OF EDUCATION

Mathematics Department
Computer Studies Section

OPERATING SYSTEMS
Course outline

BACK GROUND
The course Operating Systems will enable student teachers have knowledge and skills on the
architecture and underlying functionality of computer systems.

RATIONALE
The course is very important as it equips the student teachers with relevant knowledge and skills
on how computers are made and how they operate. Furthermore, it provides the student teacher
with the necessary teaching and learning knowledge and skills for pupils of computer studies at
secondary school level in Zambia.

LEARNING OUTCOMES
By the end of the course students will:
 use computer arithmetic in hardware construction and organization,
 identify computer components and their functions,
 disassemble and assemble a computer system,
 explain representation of programs in computers,
 explain the interdependence of software and hardware in the memory system,
 explain the bus structure,
 apply principles of Input/output structures and processor design,
 apply concepts needed for designing modern operating systems,
 explain key features of a modern operating system.

COURSE CONTENT

1. Introduction to Operating Systems (OS)


 Concept of Operating Systems
 Historical Perspective and Evolution
 Operating System Components
 Operating System Services
 Operating System Structure
2. Process Management
 Concept of Process management
 Process and CPU Scheduling
 Operations on Processes
 Multiple-Processor Scheduling
 Disk Scheduling
 Batch, Online and Real-Time Scheduling
 Inter-Process Communication

3. Threads
 Concepts of threads
 User and Kernel threads
 Multithreading Modules
 Solaris, Windows and Linux - threads

4. Process Synchronization
 Concept of Process Synchronization
 Race Conditions
 Critical-Section Problem
 Mutual Exclusion
 Semaphores

5. Deadlocks
 Concept of Deadlock
 Deadlock Characterization
 Methods for Handling Deadlocks
 Deadlock Prevention
 Deadlock Avoidance
 Deadlock Detection
 Recovery from Deadlock
 Two Phase Locking

6. Memory Management
 Concept of Memory manage
 Memory Management Functions
 Memory Architecture Evolution
 Swapping
 Multiprogramming with Partitions
 Contiguous Memory Allocation
 Paging
 Segmentation
7. Virtual Memory
 Virtual Memory concept
 Demand Paging
 Page Replacement
 Allocation of Frames
 Thrashing
 Memory Management with bit maps and linked lists
 Buddy Systems

8. File Systems
 Concepts File Systems
 Directory Structure
 Security and Protection
 File-System Structure
 Allocation Methods
 Free-Space Management
 Directory Implementation
 Efficiency and Performance
 Log-Structured File System

ASSESSMENT
Continuous Assessment, weighted at 50%

Final Examination, weighted at 50%


There shall be one (1) theory paper carrying 100 marks, weighted at 50%.

You might also like