Download Document

Applied Science University
Faculty:
Department :
MIS Department
(Course Syllabus )
CourseTitle
Credit
Hours
Course
No.
Prerequisite
Operating systems
3
102804
300100
104101
Coordinator Name
Lecturer
Room
No.
Year
(semester)
2013-2014
(1)
E-mail
Dr. Samer Barakat
Lec./Lab.
Credit
Office Hours
[email protected]
Course Description:
This course is devoted to to provides a clear description of the main concepts of operating systems and
algorithms. This course will introduce a wide range of topics that is not tied to one specific type of
operating system. Particular emphasis will be given to the following topics: Operating System Structure,
OS Components: Process Management, CPU schedulling, Memory Management, and Deadlock
Handling.
Intended Learning Outcomes:
Successful completion of this course should lead to the following learning outcomes:
A- Knowledge and Understanding:
A1) Understand the general constructs of operating systems.
A2) Understanding the process management.
A3) Understanding the system components.
A4) present all the concepts and algorithms in general setting that is not tied to one particular operating system
B- Intellectual Skills:
B1) Distinguish between different operating system components.
B2) Distinguish between the threads and the multithreading models
B3) Realize the importance of the virtual memory.
C- Subject Specific Skills:
C1) Utilize algorithms in general setting that are not tied to one particular operating system.
C2) Develop real meaning of operating system for the students.
D- Transferable Skills:
D1) Discuss and work in a group in order to solve different real world problems
D2) Improve student skills of discussing many problems
1
Course Contents:
Week
1
Topics
Computer
Parts
2
Overview
3
4
5
O.S.
Structures
6
7
Process
Management
8
Threads
9
CPU
scheduling
10
11
12
Deadlock
13
14
Memory
Management
15
16
Topic Details
 Explore the Parts of a Computer
 What is an operating system?
 O.S. history
 Mainframe Systems
□ Simple Batch Systems
□ Multiprogrammed Batch Systems
□ Time-Sharing Systems
 Parallel Systems
 Distributed Systems
 Real -Time Systems
 System Components
 Operating System Services
 System Calls
 System Structure
 Virtual Machines
 Process Concept
 Process Scheduling
 Operations on Processes
 Cooperating Processes
 Interprocess Communication
 Introduction
 Benefits of Multithreading
 User and Kernel Threads
 Multithreading Model




















Basic Concepts
Scheduling Criteria
Scheduling Algorithms
Basic Concepts
System Model
Deadlock Characterization
Methods for Handling Deadlocks
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Recovery from Deadlock
Combined Approach to Deadlock
Handling
Address binding
Logical & physical addresses
Dynamic loading and Linking
Overlays
Swapping
Contiguous Allocation
Fragmentation
memory protection
Final Exam
2
Reference
(chapter)
Assessment
[1]Chp.2
[1]Chp.1
[1]Chp.3
FIRST EXAM
[1]Chp.4
[1]Chp.5
[1]Chp.6
SECOND EXAM
[1]Chp.8
[1]Chp.9
FINAL EXAM
Course quality improvement :
Course quality improvement :


From the market and new subjects in the field.
From the monitoring of students feedback (Reports /Quizzes/ Seminar / Tutorials ….)
Grade Distribution:
Assessment
Grade
- First Exam
- Second Exam
- Assignments (Reports /Quizzes/ Seminar / Tutorials ….)
- Final Examination
Date
20%
20%
10%
50%
Reading List:
Text Book
Other
References
[1] Operating System Concepts : A. Silberschatz, P. Galvin, 8th Edition, John Wiley
[2] Operating Systems, Internals and Design Principles : W.Stallings, Prentice Hall.
[3] Applied Operating System Concept : A. Sillberschatz, P.B. Galvin, John Wiley.
[4] Hand outs and slides distributed by lecturers.
3