Independent University, Bangladesh

Department of Computer Science and Engineering

Course Outline
Course Title: Design of Operating System
Course Code: CSC 413, CSE 315, CEN413
Summer 2021, STs at 05:00 p.m. (section-1), Room: Classroom3 and
MWs at 03:30 p.m. (section-2), Room: Classroom3, Duration: 90 mnts
Instructor’s details:
Mohammad Noor Nabi
Senior Lecturer
Office: Room-6005B, Tutorial Hours: SMTWs at 02:00 p.m. to 03:30 p.m. (or by appointment)
Cell: 01552381470, Email: [email protected]
Course Description
This is one of the core courses of Computer Science and Engineering with particular emphasis on
operating system design. Operating systems are central to computing activities; acts as an intermediary
between a user of a computer and the computer hardware. Two primary aims of operating systems are
to manage resources (e.g. CPU time, memory, storage and Input/output) and to control users and
software. Operating system design goals are often contradictory and vary depending on user, software,
and hardware criteria. This course illustrates the fundamental concepts behind operating systems, and
examines the ways that design goals can be achieved.

Course Policy:
1. It is the student’s responsibility to gather information about the assignments and covered topics
during the lectures missed. Regular class attendance is mandatory. Points will be taken off for
missing classes. Without 70% of attendance, sitting for final exam is NOT allowed. According to IUB
system students must enter the classroom within the first 20 minutes to get the attendance
submitted.
2. The date and syllabus of quiz, midterm and final exam is already given here, however,
announcements will be given ahead of time. There is NO provision for make-up quizzes.
3. The reading materials for each class will be given prior to that class so that student may have a
cursory look into the materials.
4. Class participation is vital for better understanding of sociological issues. Students are invited to
raise questions.
5. Students should take tutorials with the instructor during the office hours. Prior appointment is
required.
6. Students must maintain the IUB code of conduct and ethical guidelines offered by the school of
engineering and computer sciences.
Assessment and Marks Distribution:
Students will be assessed on the basis of their overall performance in all the exams, quizzes, and class
participation. Final numeric reward will be the compilation of:
Quizzes due in different times of the semester (35%)
Assignment (project, case study) (25%)
One mid-term test (20%)
A cumulative final exam (20%)
[Class attendance is mandatory; failure to do so may deduct the final marks]

1 of 6
Grade Conversion Scheme plan:
The following chart will be followed for grading. This has been customized from the guideline
provided by the School of Engineering and Computer Science.

A A- B+ B B- C+ C C- D+ D F

90-100 85-89 80-84 75-79 70-74 65-69 60-64 55-59 50-54 45-49 0-44
* Numbers are inclusive
Required Text:
The course will be based mostly on the following books [some other books and journals may be referred
time to time]:
A. Silberschatz, P. B. Galvin and G. Gagne – Operating System and Concepts [10th or later
International Editions], Wiley
Richard Stones, Neil Matthew, Beginning Linux Programming, [4th or later International
Editions] Wrox Press ltd.

Link to Virtual Learning System:

https://piazza.com/independent_university_bangladesh/summer2021/csc413cse315/resources

Audit:
Students who are willing to audit the course are welcome during the first two classes and are advised to
contact the instructor after that.

Note:
Plagiarism – that is, the presentation of another person’s thoughts or words as though they were the
student’s own – must be strictly avoided. Cheating and plagiarism on exam and assignments are
unacceptable.

University Regulation and Code of Conduct:

Please see the Green Book for further information about academic regulation and policies, including
withdrawal and grading, appeals and penalties for plagiarism and academic misconduct.

Students with Disabilities:

Students with disabilities are required to inform the Department of Law of any specific requirement for
classes or examination as soon as possible.

More Readings:
William Stallings – Operating Systems: Internals and Design Principals
S. Tanenbaum and A. S. Woodhull – Operating Systems: Design and Implementation.

2 of 6
 Class & Exam Schedule plan, Topics and Readings:
Sessions Topics Learning Outcome Readings
1. Students will be able to know each other
Session – 1 Introduction 2. Students will learn about the course policy
3. Students will be able to plan for the exams
1. Students will learn the background of operating
system
Handout (available on
2. They will be able to categorize certain concepts
Key Concepts in Computer-system structures for Virtual Learning System)
Session – 2 Computer-system structures
Operating system design Silberschatz, Galvin and
3. They will be able to compare and contrast
Gagne Ch-1
multiprocessor and multicore systems,

1. They will be able to learn different kernel data

structures.
2. . They will be able to categorize computing Handout (available on
Key Concepts in Computer-system structures for environments including mobile systems and Virtual Learning System)
Session – 3
Operating system design cloud computing. Silberschatz, Galvin and
3. Students will be able to know the real-time Gagne Ch-1
systems.

1. Students will learn about operating services and

Handout (available on
interface
Virtual Learning System)
Session – 4 Operating system structures 2. Students will learn about system calls, types of
Silberschatz, Galvin and
system calls
Gagne Ch-2
3. They will learn feature of system programs
1. The will be able know issues regarding operating
system design and implementation. Handout (available on
2. Students will be able to know different Virtual Learning System)
Session – 5 Operating system structures
operating system structures Silberschatz, Galvin and
3. They will be able to know operating system Gagne, Ch-1
generation, debugging and system boot.
1. Students learn about process attributes
including process states, process control block,
Handout (available on
process image
Virtual Learning System)
Session – 6 Process Management Quiz 1 due 2. They will know about process creation and
Silberschatz, Galvin and
termination
Gagne, Ch-3
3. They will learn about process states and system
calls used to generate child processes in Unix/Linux

3 of 6
 1. Students will learn about inter process
communication using shared memory and message
passing Handout (available on
2. They will learn about remote process Virtual Learning System)
Session – 7 Process Management [ Assignment due on 10th class]
communication using RPC, socket-communication Silberschatz, Galvin and
and pipes Gagne, Ch-3
3. Programming practice on process creation,
termination and process communication
1. Students will learn about single and
multithreaded processes Handout (available on
2. They will learn issues regarding multi core Virtual Learning System)
Session – 8 Threads and Concurrency
programming Silberschatz, Galvin and
3. They will learn about multithreading models, Gagne, Ch-4
user level threads and kernel level threads
1. Students will learn to program using Java
threads, POSIX threads and windows threads.
Handout (available on
2. They will learn about implicit threading using
Virtual Learning System)
Session – 9 Threads and Concurrency thread pools, openMP, grand central switch.
Silberschatz, Galvin and
3. They will know thread issues of creation,
Gagne, Ch-4
cancellation, signal handling, and scheduler
activation.
1. Students will learn about basic concepts and
scheduling criteria.
Handout (available on
2. They will learn about different scheduling
Virtual Learning System)
Session – 10 CPU Scheduling algorithms
Silberschatz, Galvin and
3. They will learn about preemptive and non-
Gagne, Ch-5
preemptive scheduling, multilevel and multilevel
feedback scheduling.
1. Students will learn about multiprocessor
Handout (available on
scheduling.
Virtual Learning System)
Session – 11 CPU Scheduling 2. They will learn about processor affinity, load
Silberschatz, Galvin and
balancing, multi core processing
Gagne, Ch-5
3. They will learn about algorithm evaluat
1. Students will learn background of process
synchronization. Handout (available on
2. They will learn about race condition and Virtual Learning System)
Session – 12 Process Synchronization
handling critical section problem. Silberschatz, Galvin and
3. They will learn about Peterson’s solution and Gagne, Ch-6
synchronization hardware.
1. Students learn about mutex locks, semaphore, Handout (available on
Session – 13 Process Synchronization
and semaphore implementation Virtual Learning System)

4 of 6
 2. They will learn about deadlock and starvation Silberschatz, Galvin and
issues regarding semaphore Gagne, Ch-6
3. They learn about different classical problems of
synchronization.
1. They will learn about monitors and alternative Handout (available on
approaches in synchronization. Virtual Learning System)
Session – 14 Process Synchronization and programming
2. Students will learn about multithreaded Silberschatz, Galvin and
programming Gagne, Ch-7
Stones, Matthew- Linux
Session – 15 Programming practice on multithreading, shell and 1. Students will learn about shell programming
Programming and open
Process Synchronization and [ Assignment] 2. Programming practice on thread synchronization
source
1. Process management
Session – 16 Mid-term test (Class Time) 2. Threads Chapter-3, 4 and 5
3. Process Synchronization and programming
1. Students will learn about deadlock
characterization, system model
Handout (available on
2. They will learn about methods for handling
Virtual Learning System)
Session – 17 Deadlocks [ Assignment] deadlocks including deadlock prevention and
Silberschatz, Galvin and
deadlock avoidance algorithms.
Gagne, Ch-8
3. They will learn about deadlock detection and
deadlock recovery
1. Students will learn about background of main
memory, swapping and contiguous memory
allocation. Handout (available on
2. They will learn about segmentation and paging Virtual Learning System)
Session – 18 Memory Management
mechanisms Silberschatz, Galvin and
3. They will learn about structure of page table Gagne, Ch-9
including multilevel page table, hashed page table
and inverted page table.
1. Students will learn about background, demand Handout (available on
paging and copy on write. Virtual Learning System)
Session – 19 Virtual memory Quiz 3 due
2. They will learn about replacement algorithms Silberschatz, Galvin and
3. They will learn about allocation of frames Gagne, Ch-10
1. Students will learn about thrashing and memory
mapped files. Handout (available on
2. They will learn about allocation of kernel Virtual Learning System)
Session – 20 Virtual memory [Assignment]
memory Silberschatz, Galvin and
3. They will learn about buddy systems and slab Gagne, Ch-10
allocation
1. Students will learn about disk structure and disk Handout (available on
Session – 21 Mass storage structure
attachment, Virtual Learning System)

5 of 6
 2. They will learn about disk scheduling algorithms Silberschatz, Galvin and
3. They will learn about disk management, swap Gagne, Ch-11
space management and RAID structure.
1. Students will learn about file concept and access
methods Handout (available on
2. They will learn about directory and disk Virtual Learning System)
Session – 22 File-system Interface
structures. Silberschatz, Galvin and
3. They will learn about file-system mounting, file Gagne, Ch-13
sharing and protection
1. Students will learn about file-system structure
Handout (available on
and implementation.
Virtual Learning System)
2. They will learn about directory implementation
Session – 23 File-System Implementation Silberschatz, Galvin and
and allocation methods
Gagne, Ch-14
3. They will learn about free space management,
efficiency and performance and recovery
1. Students will learn about I/O hardware, Handout (available on
Application I/O interface Virtual Learning System)
Session – 24 I/O systems 2. They will learn about kernel I/O subsystems and Silberschatz, Galvin and
transforming I/O requests to hardware operations. Gagne, Ch-12
3. They will learn about streams and performance
Session – 25 Self Study and Revision
1. CPU Scheduling and Deadlock Silberschatz, Galvin and
2. Memory Management: main memory and virtual Gagne, Ch-6, 7, 8, 9, 10,
Session – 26 Final Exam
memory 11, 12 & 13
3. File system and I/O system

6 of 6