Week

wackybabiesSoftware and s/w Development

Dec 14, 2013 (3 years and 8 months ago)

89 views


1
?








CourseTitle

Credit Hours

Course No.

Prerequisite


Year (semester)


Lec./Lab. Credit

Operating Systems

3

1301326

1301221

201
1
-
2012

(
1
)

Lecture: 3


Lab : 0


Coordinator Na
me

Lecturer

Room
No.

E
-
mail

Office Hours

Dr.
Nedhal Al Saiyd


Dr. Nedhal Al Saiyd

Dr.Ahmed Al Omari


1308

nedhal_alsaiyd
@asu.edu.jo

&

a.omari@asu.e
du.j
o


Sun, Tue & Thr: 9
-
10 and 11
-
12

Mon & Wed: 11
-
12


Course Objectives:

It is a second level course which is an essential part of any computer system. It provides a clear description
of the concepts that underlie operating systems. Particular emphasis

will be given to the major OS
components: Process Management, Memory Management and Device Management. The aim is to present
these concepts and algorithms in general setting that is not tied to one particular operating system.

Course Description:

This cou
rse will start with a brief historical perspective of the evolution of operating system. Its topics
include an overview of the components of operating system, system structure, Processor Management (
mutual exclusion and synchronization of process, threads
, , scheduling algorithms), Memory Management
( swapping, overlay, paging , segmentation , dynamic storage allocation, protection , virtual memory).

Intended Learning Outcomes :

Successful completion of this course should lead to the following learning out
comes :

A
-

Knowledge and Understanding :

A1) List the basic Operating Systems Structure.

A2) List the concept of processes and threads.

A3) List the concept of processes synchronization, mutual exclusion and deadlock.

A4) List the concept of memory manage
ment techniques.

B
-

Intellectual Skills :

B1) Distinguish between a process and thread.

B2) Analyze and compare the different CPU Scheduling Techniques.

B3) Analyze and compare memory management strategies.

B4) Analyze and compare different techniques for
process synchronization .

C)

Subject Specific Skills :

C1) Implement solutions of classical synchronization problems.

C2) Implement solutions of CPU Scheduling Algorithms.

C2) Learn a specific Operating system environment and solve several resource managem
ent issues.

D)
Transferable Skills :


D1) Discuss and work in a group in order to design and implement solutions of several resources


management issues.


D2) Discuss and work in a group in order to study and present a case study operating sys
tem.



Course Contents :


We
ek

Topics


Topic Details

Reference
(chapter)

Assess
-
ment

1

Overview

What Operating Systems Do
,
Computer
-
System
Organization
,
Computer
-
System Architecture
,
Operating
-
[1]Chp.1



Applied Science University

Faculty:

Information Technology


Department :


Computer Science


( Course Syllabus )




2
?
System Structure
,
Operating
-
System

Operations
,
Process
Management
,
Memory Management
,
Storage Management
,
Protection and
Security,

Distributed Systems
,
Special
-
Purpose Systems
,
Computing
Environment

2

O.S.
Structures

Operating System Services
,
User Operating System
Interface
,
S
ystem Calls
,

Types of System Calls
,
System
Programs
,
Operating System Structure
,
Virtual Machines
,
Operating System Generation
,
System Boot

[1]Chp.2




Assignment 1:

models of interprocess communication,
their strength and weakness


ASS. 1

3

Process
es

Ma
nagement


(
concepts, PCB, Process Scheduling, Operations on
P
ro
cesses, Interprocess C
ommunications)

[1]Chp.3

HOME
WORK

4

Threads


Motivatio and B
enefits,
Multithreading Models, Threading
Issues

[1]Chp.
4




Assginment
2
: process synchronization problems.

Implementation.


ASS. 2

5

CPU
scheduling


Concepts, S
cheduling
C
riteria, Scheduling Algorithms

[1]Chp.5


6

Process
Synchronizati
on


Background, Critical Section Problem and its three
solutions, Multiple Process Sol
ution, Synchronization
Hardware

[1]Chp.
6


FIRST
EXAM

7

Semaphore

usage, implementation, Clas
sic Problems of
Synchronization

[1]Chp.6


8

Deadlock

System Model, Deadlock Characterization, Methods for
H
andling Deadlock,

Deadlock Prevention

[1]Chp.7




Assginment
3

:

Scheduling Problems with its
implementation.


ASS.
3

9

Deadlock

Deadlock Avoidance, Deadlock De
tection, Recovery from
Deadlock

[1]Chp.7

HOME
WORK

10

Memory
Management

Address Binding, Logical & Physical A
ddresse
s, Dynamic

L
oading and Linking

[1]Chp.8


11

Memory
Management


Swappi
ng, Contiguous
Memory
Allocation, Fragmentation,

[1]Chp.8


12

Paging
System



Basic Method, Hardware Support, Protection,
Shared
Pages

[1]
Chp.8

SECOND
EXAM



Assginment
3:

Deadlock implementation algorithms.


ASS. 3

13

Segmentation
System


Structure of

Page Table,
Basic

Method
,

Hardware,
Protection and Sharing, Fragment
ation, Segmentation with
paging

[1]Chp.8


14

Virtual
Memory


Background, Demand Pa
ging, Process Creatio

[1]Chp.
9

HOME
WORK

15

Page
Replacement


Basic scheme, FIF
O, Optimal, LRU, Countin
g
-
Based

Page
Replacement

[1]Chp.
9


16


Final Exam


FINAL
EXAM


Course quality improvement :



From the market and new subjects in the field.



From the monitoring of students feedback (Evaluation sheet).

Grade Distribution :



Assessm
ent

Grade

Date

-

First Exam

20%


-

Second Exam

20%


-

Assignments ( Reports /Quizzes/ Seminar / Tutorials ….)

20%


-

Final Examination

40%



3
?
* Make
-
up exams will be offered for valid reasons. It may be different from regular exams in content and
format.


Reading List:


Text Book

[1] Operating System Concepts : A. Silberschatz, P. Galvin, 7
th

ed., John Wiley, 2005.

Other

References

[2] Operating Systems, Internals and Design Principles : W.Stallings, Prentice Hall.

[3] Applied Operating System Co
ncept : A. Sillberschatz, P.B. Galvin, John Wiley.

[4] Hand outs and slides distributed by lecturers.

Last updated on
26
/
9
/2011 by : Dr.
Nedhal Al Saiyd