Jjjj

nn

COURSE OUTLINE
1 Faculty Faculty of Science and Engineering (FSE)
2 Department Computer Science and Engineering (CSE)
3 Programme B.Sc. in CSE
4 Name of Operating System
Course
5 Course Code CSE 309
6 Trimester Summer 2020
7 Pre-requisites None
8 Status System Course
9 Credit Hours 3.0
10 Section 182 DA
11 Class Hours Section Class Day Class Hours Venue
182 DA Monday 11.30am-1.00am Room No: B -804
Wednesday 11.30am-1.00am Room No: B -804
12 Class Permanent Campus Room No: B -804
Location
13 Course https://classroom.google.com/
website Google classroom code: ri2c4ak
Zoom Link: https://bdren.zoom.us/j/64729883262
14 Instructor Safial Islam Ayon
15 Contact [email protected]
16 Office Room No: B-407 Desk: 1
17 Counselling Day Counseling Hours Venue
Hours Tuesday 11:30 pm - 1:00 pm && 03:00 pm - 04:30 pm Room No B 407/Zoom
Thursday 11:30 pm - 1:00 pm && 03:00 pm - 04:30 pm Room No B 407/Zoom

18 Text Book
1. Silberschatz, A., Galvin, P. B., & Gagne, G. (2014). Operating system concepts
essentials. John Wiley & Sons, Inc. 8th Edition.
2. Stallings, W. (2005). Operating Systems: Internals and Design Principles—
Edition: 5. Pearson.
19 Reference 1. Andrew S. Tanenbaum and Albert S. Woodhull. Operating Systems: Design and
Implementation, Prentice Hall, (2nd Ed.).
2. https://www.geeksforgeeks.org/operating-systems/
3. https://www.tutorialspoint.com/operating_system/
4. https://www.studytonight.com/operating-system/
5. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/
CSE 309 Course Syllabus Summer 2020

20 Equipment & Bring your own materials (calculator, pen, paper, etc.) to participate effectively in
Aids classroom activities. You are not allowed to borrow from others inside the
classroom during class activities.
Besides class note, Please keep at least one blank A4 size paper per class with you.
21 Course Operating Systems is a graduate-level introductory course in computer science. This
Rationale course teaches the basic operating system abstractions, mechanisms, and their
implementations. The core of the course contains concurrent programming (threads
and synchronization), inter process communication, and an introduction to distributed
operating systems. The course is split into four sections: (1) Introduction, (2) Process
and Thread Management, (3) Resource Management and Communication, and (4)
Distributed Systems.
22 Course Operating system: its role in computer systems, operating system concepts, operating
Description system structure; process: process model and implementation, inter-process
communication (IPC), classical IPC problems, thread, process scheduling,
multiprocessing and time-sharing; memory management: swapping, paging,
segmentation, virtual memory; Input/Output: hardware, software, disk, terminals,
clocks; deadlock: resource allocation and deadlock, deadlock detection, prevention
and recovery; file systems: files, directories, security, protection; case study of some
operating systems.
23 Course After completing this course students will be able to-
Outcomes
(CO) CO1: Understand the goals of OS concepts, structures, and design of operating
systems and extrapolate the interactions among the various components of computing
systems.
CO2: Explain the policies for the kernel, process state management, scheduling,
Mutual exclusion algorithms deadlocks, memory management, virtual memory and
paging systems, synchronization, system calls, and file systems.
CO3: Understand of operating system design and its application system design and
performance.

24 Teaching Maximum topics will be covered from the textbook. For the rest of the topics,
Methods reference books will be followed. Some class notes will be uploaded on the web.
White board will be used for most of the time. For some cases, multimedia projector
will be used for the convenience of the students. Students must participate in
classroom discussions for case studies, problems solving and project developments.
25 Topic Outline
All topics and problems are from the main text if not specified otherwise.

Lecture Selected Topics Article Suggested Outcome

(Text) Problems.
(Text)

(1-2) What operating system do? 1.1 1.2, 1.3, 1.7, CO1
Operating system structure and operation 1.4, 1.5 1.8, 1.13,
Process, Memory, Storage management 1.6, 1.7, 1.8 1.18, 1.19,
Protection & Security, Distributed Systems 1.9, 1.10 1.23, 1.24
Special purpose system, computing environment 1.11, 1.12
Open Source operating system 1.13

(3-5) Operating system services 2.1 2.2-2.6, CO1,

User operating system interface 2.2 2.8, 2.9, 2.10, CO2
CSE 309 Course Syllabus Summer 2020

System calls, Types of system calls 2.3, 2.4 2.11, 2.13, 2.14
System programs 2.5 2.15-2.17
Operating System Design and implementation 2.6 2.19 , 2.20
Operating System Structure and Virtual Machines 2.7, 2.8
System Booting 2.9
Operating System Debugging and Generation 2.9, 2.10

(6-8) Process Concept 3.1 3.2-3.5 CO2,

Process Scheduling 3.2 3.8-3.11 CO3
Operations on processes 3.3 3.13, 3.15
Inter-process Communication 3.4 3.19, 3.20
Examples of IPC systems 3.5
Communication in Client-server systems 3.6

(9-11) Multithreading Models 4.2 4.2, 4.3, 4.4, CO2,

Thread libraries 4.3 4.6, 4.8, CO3
Thread libraries 4.4 4.9, 4.10,
Threading Issues 4.5 4.11, 4.12,
Operating System Examples 4.6 4.15

(12-15) Scheduling Criteria 5.2 5.1, 5.2, 5.3, CO2,

Scheduling Algorithms 5.3 5.4, 5.5, CO3
Thread Scheduling 5.4 5.7, 5.8,
Multiple Process Scheduling 5.5 5.9, 5.13, 5.14,
OS Examples 5.6 5.15, 5.17
Algorithms Evaluation 5.7

(16-18) The Critical Section problem 6.2 6.1, 6.3, 6.4, CO2,
Peterson’s Solution 6.3 6.7, 6.10, CO3
Synchronization Hardware 6.4 6.11, 6.12,
Semaphores 6.5 6.14, 6.16,
Classic Problems of Synchronization 6.6 6.18, 6.21,
Monitors 6.7 6.28, 6.32,
Synchronization Examples 6.8 6.36
Atomic Transactions 6.9

(19-20) System Model 7.2 7.1, 7.2, 7.3, CO1,

Deadlock Characterization 7.3 7.4, 7.9, 7.10, CO2,
Methods for Handling Deadlocks 7.4 7.13, 7.14, 7.15 CO3
Deadlock Prevention 7.5 7.16
Deadlock Detection 7.6
Recovery from Deadlock 7.7

(21) Swapping 8.2 8.2, 8.4, 8.6, 8.7, CO2

Contiguous Memory Location 8.3 8.8, 8.9, 8.16,
Paging 8.4 8.21
Structure of the Page Table 8.5
Segmentation 8.6

(22) Demand Paging 9.2 9.1, 9.2, 9.4, CO2

Page Replacement 9.4 9.5,9.9,
Allocation of frame 9.5 9.10, 9.11
Thrashing 9.6
Allocating Kernel Memory 9.8

(23-24) Goals of Protection 14.1 14.1, 14.3, CO2,

CSE 309 Course Syllabus Summer 2020

Principle of Protection 14.2 14.5 16.1, CO3

Network structure 16.3 16.2, 16.3
Network Topology 16.4
Communication structure and Protocol 16.5, 16.6
26 Assessment Students will be assessed on the basis of their overall performance in all the exams,
and Marks quizzes, and class participation. Final numeric reward will be the compilation of
Distribution: (tentative):
❖ Class Test (15%) (Assignment or Viva or Mixed)
❖ Presentation (5%)
❖ Assignment (5%)
❖ Class Attendance (5%)
❖ Mid Term (30%) (Viva 50% + Assignment 50%)
❖ Final Exam (40%) (Viva 50% + Assignment 50%)

27 Assessment Assessment methods of COs are given below:

Methods of
COs Assessment
COs CT1 CT2 CT3 CT4 MT FE Assignment Project
CO1 √ √
CO2 √ √ √ √
CO3 √ √ √ √ √

28 Mapping of Mapping of COs with program outcomes (POs) are given below:
COs with POs
Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 √
CO2 √
CO3 √

29 Grading
The following chart will be followed for grading. This has been customized from the
Policy
guideline provided by the School of Engineering and Computer Science.

A+ A A- B+ B B- C+ C D F
80 and
75-<80 70-<75 65-<70 60-<65 55-<60 50-<55 45-<50 40-<45 <40
above

29 Additional Assignments No late submission will be accepted. Zero tolerance will be shown
Course in this regard.
Policies Class Test There will be at least three CTs, best of two will be counted. A CT
can be taken with an announcement in prior or without any
announcement. CT will be taken using Google forms or viva or
mixed of Google forms and viva.
Exams Mid-term and final exam will be taken with the help of assignment
(50%) and viva (50%). In assignment a fixed date of submission
will be given. If anyone submitted his/her assignment late he/she
will be got zero. If any student does any type of copy, he/she will
also be got zero. Viva will be taken in Zoom online platform.
CSE 309 Course Syllabus Summer 2020

Test Policy: If you are absent from a test, and you have not spoken to the
teacher personally beforehand, your grade for the test will be zero.
No make-up for class test will be taken because it has alternative
(three out of four). No make-up for mid will be entertained without
presence and recommendation of guardian and written permission
of the department. Make-up test of mid will be much harder than
the regular test.
30 Additional If any problem email at any time and call between 09:00 AM to 06:00 PM.
Information