Scribd
Upload
29 views

Linux Lecture Notes If

Uploaded by

Prakash Adhikari
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
29 views

Linux Lecture Notes If

Uploaded by

Prakash Adhikari
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Jordan University of Science & Technology

Faculty of Computer & Information Technology


Department of Computer Science
Year: 2013-2014 Semester: Spring

Course Information
Course Title Principles of Modern Operating Systems
Course Number CS 375
Prerequisites
CS 284 Algorithms

Course Website http://www.just.edu.jo/~misaleh


Instructor Dr. Mohammed Al-Saleh
Office Location PH 4 Level -1
Office Phone 02-720-1000 Ext. 23901
Office Hours Sun, Tue, Thu, 11:15 – 12:15   or by Appointment
E-mail [email protected]
 

Text Book
Title Operating System Concepts
Author(s) Abraham Silberschatz, Peter Galvin, Greg Gagne
Publisher Addison-Wesley
Year 2013
Edition 9th
References  W. S. Davis and T. M. Rajkumar, Operating Systems A Systematic View, 5 th Edition,
Addison Wesley, 2001.
 S. Tanenbaum, Modern Operating Systems, 3nd Edition, Prentice Hall, 2007.
 Gary Nutt, Kernel Projects for Linux, Addison Wesley, 2000.
 H.M. Deitel, An Introduction to Operating Systems, 3 th Edition, Addison-Wesley,
Reading, MA 2007
 Steven V. Earhart (Editor), UNIX Programmer's Manual, Holt, Rinehart, and Winston,
New York, NY 1986.
Assessment Policy
Assessment Type Expected Due Date Weight
First Exam TBA 20%
Second Exam TBA 20%
Final Exam TBA 40%
Activities (Quizzes and Lab) TBA 20%

The Goal
The goal of this course is to present the basic concepts involved in constructing
computer operating systems. Such as Computer-System Structures, Operating-
Systems Structures, Processes, CPU Scheduling, Process Synchronization,
Deadlocks, Memory Management, Virtual Memory, and Mass-Storage Structure.

Course Objectives
No. Objective Weights
1 To explain what operating systems are, what they do, and how they are 15%
evolved, designed, and constructed.
2 To understand the process concept and concurrency as the heart of modern 15%
operating systems.
3 To compare and contrast the common CPU scheduling algorithms used for both 15%
preemptive and non-preemptive scheduling of tasks in operating systems, such
as priority, performance comparison, and fair-share schemes.
4 To understand the concept of process synchronization and to explain the 15%
concept of algorithms used to prevent, avoid, and detect deadlocks.
5 To explain the concept of memory management and how it is realized in 15%
hardware and software.
6 To explain the concept of virtual memory. 15%
7 To explain, compare and contrast the common disk scheduling algorithms. 10%

Teaching & Learning Methods


 Class lectures, lecture notes, and quizzes are designed to achieve the course objectives.
 You should read the assigned chapters before class, and participate in class and do whatever
it takes for you to grasp this material. Also, ask any question related to O.S.
 You are responsible for all material covered in the class.
 Please communicate with me regarding any concerns or issues related to OS by either in
class, phone, or email.
 The web page is a primary communication vehicle. Lecture notes and syllabus are available
on the web.
Course Content
Number of Chapter in
Topics
Weeks Text
Introduction
(1 Week: What Operating Systems Do, Computer System
3 one-hour Organization and Architecture, Operating System
lectures) Structures and Operations, Process Mgmt, Memory Mgmt, 1
Storage Mgmt, Protection and Security, Kernel Data
Structure, Computing Environments, and Open-Source
Operating Systems.
(2 Weeks: Operating-Systems Structures
6 one-hour System Components; Operating-System Services; System
lectures) Calls; System Programs; Systems Structure; and 2
Virtual Machines.
(2 Weeks: Processes
6 one-hour Process Concept; Process Scheduling; Operation on
lectures) Processes; Cooperating Processes; Inter-Process 3
Communication (IPC); and Buffering.
(1 Week: Threads
3 one-hour Overview; Multicore Programming, Multithreading
lectures) Model, Thread Libraries, Implicit Threading, 4
Threading Issues
(1 Week: Process Synchronization
3 one-hour Mutual Exclusion; Critical Sections; Mutex Locks,
lectures) Semaphores; Classic Problems of Synchronization, 5
Monitors
(2 Weeks:
6 one-hour CPU Scheduling
lectures) Basic Concepts; Scheduling Criteria; and Scheduling 6
Algorithms.

Deadlocks
(1 Week: System Model; Deadlock Characterization; Methods for
3 one-hour Handling Deadlocks; Deadlock Prevention; Deadlock 7
lectures) Avoidance; Deadlock Detection; and Recovery from
Deadlock.

(2 Weeks: Memory Management


Background; Logical versus Physical Address Space;
6 one-hour 8
Swapping; Contiguous Allocation; Paging;
lectures)
Segmentation; and Segmentation with Paging.
Virtual Memory
(2 Weeks: Background; Demand Paging; Copy-on-Write, Performance
6 one-hour of Demand Paging; Page Replacement; and Page- 9
lectures) Replacement Algorithms, Thrashing, Memory-mapped
Files, Allocating Kernel Memory
(1 Week:
3 one-hour Mass-Storage Structure
Disk Structure; Disk Attachment, Disk Scheduling; 10
lectures)
Disk Management; RAID Structure
Additional Notes
 No make up quizzes. Usually quizzes are determined.
 A minimum 4 quizzes are given.
Quizzes
 Each Quiz is out of 10.
 If five quizzes or more are given then the lowest quiz’s grade is dropped.
The format for the exams is generally (but NOT always) as follows: General
Definitions, Multiple-Choice, True/False, Analyze a Problem, Short Essay
Exams Questions, etc.
Makeup
 Makeup exam should not be given unless there is a valid excuse.
Exams
 Cheating or copying on exam or quiz is an illegal and unethical activity.
Cheating  Standard JUST policy will be applied.

 All graded assignments must be your own work (your own words).
 Excellent attendance is expected.
 JUST policy requires the faculty member to assign ZERO grade (35) if a student
Attendance misses 10% of the classes that are not excused.
 Sign-in sheets will be circulated.
 If you miss class, it is your responsibility to find out about any announcements or
assignments you may have missed.
Workload  Average work-load student should expect to spend 6 hours per week.

Graded  Instructor should return exam papers graded to students not after the week after
Exams the exam date.

Participation
 Participation is encouraged.

Cell Phones

 No cell phones are allowed Inside the class or exam

You might also like