0% found this document useful (0 votes)
96 views

Operating System16 Week Plan

The document outlines a course for an Operating Systems course at the University of Gujrat. It includes 3 credit hours, with 2 lectures per week that are 1.5 hours each. The course covers major components of operating systems including process management, memory management, file systems, and distributed systems. It aims to provide an introduction to operating system design and the role of the OS. The course will include both theory lectures and hands-on labs for Windows and Linux. It will be assessed through sessions, a midterm, final exam, assignments, and class participation. The course is organized into weekly topics that cover OS concepts, structures, processes, CPU scheduling, synchronization, deadlocks, memory management, and virtual memory over 16

Uploaded by

Kashif Asghar
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
96 views

Operating System16 Week Plan

The document outlines a course for an Operating Systems course at the University of Gujrat. It includes 3 credit hours, with 2 lectures per week that are 1.5 hours each. The course covers major components of operating systems including process management, memory management, file systems, and distributed systems. It aims to provide an introduction to operating system design and the role of the OS. The course will include both theory lectures and hands-on labs for Windows and Linux. It will be assessed through sessions, a midterm, final exam, assignments, and class participation. The course is organized into weekly topics that cover OS concepts, structures, processes, CPU scheduling, synchronization, deadlocks, memory management, and virtual memory over 16

Uploaded by

Kashif Asghar
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

University of Gujrat

Faculty of CS & IT
Course outline for CS & IT
Title Operating System
Code SE-205
3
Credit Hours Theory/week:
Weight 4(3,1) Cr. Hrs.
Lectures: 2
Duration 1.5 Hrs./Lecture
Prerequisite DLD or Computer Architecture, Data Structures
Follow Up
Category Core
Aims and Objectives The course will start with a brief historical perspective of the evolution of operating systems over the last fifty years, and then
cover the major components of most operating systems. This discussion will cover the tradeoffs that can be made between
performance and functionality during the design and implementation of an operating system. Particular emphasis will be given
to three major OS subsystems: process management (processes, threads, CPU scheduling, synchronization, and deadlock),
memory management (segmentation, paging, swapping), file systems, and operating system support for distributed systems.
Learning Outcomes This course will provide an introduction to operating system design and implementation. The operating system provides a well-
known, convenient, and efficient interface between user programs and the bare hardware of the computer on which they run.
The operating system is responsible for allowing resources (e.g., disks, networks, and processors) to be shared, providing
common services needed by many different programs (e.g., file service, the ability to start or stop processes, and access to the
printer), and protecting individual programs from one another.
Course The course would be Theory of Operating system and hands on practical lab session on Operating System ( Windows & Linux)
Reference Material Operating System Concepts – xxx Edition Silberschatz, Galvin and Gagne
Operating Systems, William Stallings
Linux All-in-One Desk Reference For Dummies, by Naba Barkakti

ftp://ftp.prenhall.com/pub/esm/computer_science.s-041/stallings/Slides/OS4e_PPT_Slides/

Assessment Criteria Sessional 25% Mid 25% Final 50% Total 100%
Quizzes and Tests
Assignment and Presentations Paper 25 Paper 50
Attendance and Class Participations
Framework
Week Lecture Topic Source Recommendations for Learning
(Book-Chapter No. Activities
Section No.) (Mention Assignments, Test, Quizzes,
Practical, Case Study, Projects, Lab Work or
Reading Assignments)
1 Chapter 1: Introduction What Operating Systems Do, Computer-System Distribution of course outline
1
2 Chapter 1: Introduction Organization ,Computer-System Architecture
,Operating-System Structure ,Operating-System
Operations ,Process Management ,Memory
3 Chapter 1: Introduction Management ,Storage Management ,Protection Assignment 1
2 and Security ,Distributed Systems ,Special-
Purpose Systems , Computing Environments
Chapter 2: Operating System Operating System Services, User Operating
4
Structures System Interface ,System Calls ,Types of System
Chapter 2: Operating System Calls ,System Programs ,Operating System Design
5
Structures and Implementation ,Operating System
3
Chapter 2: Operating System Structure ,Virtual Machines, Operating System
6 Test 1
Structures Generation ,System Boot
7 Chapter 3: Processes Process Concept , Process Scheduling ,Operations
4
8 Chapter 3: Processes on Processes ,Cooperating Processes ,Inter- Assignment 2
9 Chapter 3: Processes process Communication ,Communication in
5
10 Chapter 3: Processes Client-Server Systems
11 Chapter 5: CPU Scheduling Basic Concepts, Scheduling Criteria ,Scheduling
6 Algorithms , Multiple-Processor Scheduling ,Real-
12 Chapter 5: CPU Scheduling
Time Scheduling ,Thread Scheduling ,Operating ,
13 Chapter 5: CPU Scheduling Test 2
7 Systems Examples
14 Chapter 5: CPU Scheduling

15 Chapter 5: CPU Scheduling


8

16 Chapter 5: CPU Scheduling Wrap the course Contents Studied above


Mid-Term Exam
Chapter 6: Process
17
Synchronization Introduction, Producer Consumer problem,
9 Chapter 6: Process
18 critical section, semaphore, Deadlock and
Synchronization
Chapter 6: Process starvation, Monitors
19 Assignment 3
10 Synchronization
20 Chapter 7: Deadlocks
21 Chapter 7: Deadlocks The Deadlock Problem, System Model ,Deadlock
11
22 Chapter 7: Deadlocks Characterization ,Methods for Handling Deadlocks
, Deadlock Prevention ,Deadlock Avoidance
23 Chapter 7: Deadlocks Test 3
12
,Deadlock Detection ,Recovery from Deadlock
Threads concepts, User level threads, kernel level
24 Chapter 7: Deadlocks
threads, mapping of threads
Chapter 8: Memory
25
Management
13
Background, Swapping, Contiguous Memory
Chapter 8: Memory
26 Allocation
Management
Chapter 8: Memory Paging, Structure of the Page Table, Segmentation
27 Assignment 4
Management Example: The Intel Pentium
14
Chapter 8: Memory
28
Management
Chapter 8: Memory
15
29 Test 4
Management
30 Chapter 9: Virtual Memory
31 Chapter 9: Virtual Memory
16
32 Chapter 21: Virtual Memory
* Some Advanced Topics may be Discussed or Given as an Assignments
Final-Term Exam

You might also like