Download 601331-OS-QA-2016

Petra University
Form Name: Course Syllabus
University of Petra
‫كلية تكنولوجياالمعلومات‬
‫قسم علم الحاسوب‬
Faculty of InformationTechnology
Department of Computer Science
Course Syllabus
Year: 2016-2017
Semester: (1)
Course No.
Course Title
Prerequisite
Co-requisite
601331
Operating systems
601221
-
Credit Hours
Lectures /Lab.
3:3:0 Lab
Instructor
Name
E-mail
Office ext.
Office Hours
Office No.
Coordinator's Name:
Short Course
Description
This course introduces the fundamental concepts of operating systems.
Topics covered: evolution of operating systems (OS), operating system
structure, operating system tasks including: process management and
scheduling (time sharing, deadlock), strategies of storage management and its
protection, secondary storage structure; Distributed Systems, I/O system
management.
Course Objectives







To define the objectives and function s of the modern operating systems.
Describe the evolution of the OS from primitive batch systems to sophisticated multi user systems
Explain the different types of schedulers; short, medium and long term.
To differentiate between user and kernel modes in an operating system.
Discuss different components for structuring an operating system.
Explain the concurrency in the execution of processes, and show the run-time problems arising from
the concurrent operation of many separate processes.
Provide and explain the diagram of different states that a task can pass during its lifetime.
Explain various methods of solving Deadlocks and the problem of mutual exclusion.
Discuss the need of using interrupts, dispatching, and context switching to support concurrency.
Explain different algorithms used for both preemptive and non-preemptive scheduling and compare
between them.
Define what is the thread, and explain the differences between threads and processes

Explain memory hierarchy and virtual memory concept.




FORM # QF ACA 012-02 E, Rev .B
1
Petra University
Form Name: Course Syllabus
Course Intended Learning Outcomes (ILOs) and their Alignment with Program ILOs,
Teaching and Learning Methods, and Assessment Methods:
Upon successful completion of this course, students are expected to achieve the following learning
outcomes:
Course ILOs
Program
ILOs
Knowledge (K)
K1. Understand the evolution of Operating Systems
A4
K2. List the concept of processes and process
A4
synchronization
K3. Understand the relationship between Processes and
A4
Threads in connection with OS
Intellectual Skills (I)
I1. Distinguish the different components of operating
CS-J4
systems
I2. Analyze and compare the different CPU Scheduling
CS-J4
Techniques
I3. Distinguish between short, Medium and long term
CS-J4
schedulers.
Practical skills (P)
P1. Implement CPU scheduling algorithms
C2
Transferable Skills (T)
T1. Independently learn how to install and use different
H5
platforms (Linux).
Teaching and
Learning
Method
Assessment
Method
Interactive
Lecture
Interactive
Lecture
Final Exam
Interactive
Lecture
Final Exam
Interactive
Lecture
Second Exam
Interactive
Lecture
Second Exam
Interactive
Lecture
Second Exam
project
Quizzes
Project
Quizzes
Final Exam
Course Schedule:
Week
Topic Details
1
introduction, O.S. history, application bases, OS
environment, OS components and goals, OS architecture.
Evolution of hardware devices, hardware components,
hardware support for OSs, caching and buffering, software
overview, APIs, compiling, linking and loading, firmware,
middleware.
Introduction, process states, process mangement, interrupts,
interprocess communication, case study: UNIX processes
Introduction, definition of thread, motivation for threads,
thread states, thread operations, thread models, thread
implemetation considerations, case study: Java
multithreading.
Seminars on how to install a Linux Distribution
Introduction, examples of deadlock, indefinte
2
3
4
5
6
FORM # QF ACA 012-02 E, Rev .B
2
Course ILO
number
K1
Reference
Ch1
K1
Ch2
K2
Ch3
K3
Ch4
T1
I2
Ch7
Petra University
Form Name: Course Syllabus
10
11, 12
13
postponement, resource concepts, for necessary conditions
for deadlock, deadlock solutions, deadlock prevention,
deadlock avoidance, deadlock detection, deadlock recovery.
Mutual exclusion, implememting mutual exclusion
primitives, software and hardware solutions to the Mutual
exclusion problem, semaphores
Secheduling levels, preemptive vs. nonpreemptive
scheduling, priorities, scheduling objectives, scheduling
criteria, scheduling algorithms, deadline schedulig, realtime scheduling, Java thread scheduling.
Real memory organization and Management,
Virtual memory management
Linux Commands Practices
14
15,16
Discussions
Final Exam
7
8,9
P1
Ch5
I2
Ch8
I1
I1
P1
Ch9
Ch10
Lecture
Notes
T1
Assessment Methods and Grading System:
Assessment method
Project
Quizzes
First Exam
Second Exam
Final Exam
Total
Grade
5%
5%
25%
25%
40%
100
Comments
Installing a Linux Distribution
Covers Chapters 1, 2, 3
Covers chapters 4, 5, 7
Covers all topics that were discussed during the semester
Learning References:
1- Textbook (s):
Operating Systems: H. M. Deitel, P. J. Deitel, D. R. Choffnes, third edition, Prentice Hall, 2010.
Operating Systems, Internals and Design Principles : W.Stallings, Prentice Hall.
2- References:
FORM # QF ACA 012-02 E, Rev .B
3
Petra University
Form Name: Course Syllabus
Course Policies1

Attendance Policy: University regulations apply to attendance.

Academic Honesty: Academic dishonesty is an unacceptable mode of conduct, and will not
be tolerated in any form at University of Petra. All persons involved in academic dishonesty
and plagiarism in any form will be disciplined in accordance with University rules and
regulations.
Approved by
Coordinator of
Curriculum Committee
Faculty Dean/ Head of
Department
1
Name
Date
Additional information may be added in this section according to the nature of the course.
FORM # QF ACA 012-02 E, Rev .B
4
Signature