09:40, 27/01/2022 FPT University Learning Materials

Syllabus Details
Syllabus ID: 5166

Syllabus Name: Operating System_Hệ điều hành

Subject Code: OSG202

NoCredit: 3

Degree Level: Bachelor

Class hours: 30 slots - 1slot =90'

Time Allocation:
Home study: 30 slots

Pre-Requisite:

At the end of this course, students will be able to perceive:

1) Background knowledge: (ABET e)

-The role of operating system,

- important OS concepts,
- the mechanism of operating system, and
- main problems of Operating system.

Description:
2) Practice skills: (ABET k)

- Using basic shell command in Linux system fluently.

- Fundamental of shell, C language on Linux.

- Main problems of Operating system through some simulative exercises.

3) Information searching, reading and selection skills (ABET i)

4) Working in group, documenting and presenation skills (ABET g)

- Students must attend more than 80% of contact slots in order to be accepted to the final examination.

- Student is responsible to do all exercises given by instructor in class or at home and submit on time

StudentTasks:
- Use laptop in class only for learning purpose
- Promptly access to the FU LMS for up-to-date course information

- Internet

Tools:
- Linux operating system server and/ or desktop

Scoring Scale: 10

DecisionNo
1485/QĐ-ĐH-FPT dated 12/31/2021
MM/dd/yyyy:

IsApproved: True

Note:

MinAvgMarkToPass: 5

IsActive: True

ApprovedDate:

5 material(s)

MaterialDescription IsMainMaterial ISBN IsHardCopy IsOnline Note Author Publisher PublishedDate Edition

Modern Operating Systems (4th 9780133591620   Andrew S. Tanenbaum Pearson 2014 (4th) 4th or
edition or 3rd or 2nd) (4th) 3rd or
2nd

Course slides (.pptx)          

Understanding operating systems 978-   Ann McIver McHoes Cengage 2008 8th
1305674257 and Ida M. Flynn Learning

http://courses.knox.edu/cs226/          

Connecting with Computer Science 978-   Creg Anderson, David Thomson 2010 2nd
1439080351 Ferrro, Robert Hilbon course Edition
Technology

10 LO(s)

LO Name LO Details

CLO1 Understand the main concepts of operating system

CLO10 Understand basic C/C++ language on Linux

CLO2 Understand the main concepts of process management

CLO3 Understand the main concepts of memory management

CLO4 Understand the main concepts of file systems

CLO5 Understand the main concepts of I/O systems

CLO6 Understand the main concepts of deadlock

CLO7 Using Linux operating system

CLO8 Using basic shell command in Linux system fluently

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 1/8
09:40, 27/01/2022 FPT University Learning Materials

CLO9 Understand basic Shell language on Linux

Mapping of CLOs to PLOs of Curriculum BIT_SE

PLOs
CLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 ✓

CLO2 ✓

CLO3 ✓

CLO4 ✓

CLO5 ✓

CLO6 ✓

CLO7 ✓

CLO8 ✓

CLO9 ✓

CLO10 ✓

Mapping of CLOs to PLOs of Curriculum BIT_IS

PLOs
CLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 ✓

CLO2 ✓

CLO3 ✓

CLO4 ✓

CLO5 ✓

CLO6 ✓

CLO7 ✓

CLO8 ✓

CLO9 ✓

CLO10 ✓

Mapping of CLOs to PLOs of Curriculum BIT_IoT

PLOs
CLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 ✓

CLO2 ✓

CLO3 ✓

CLO4 ✓

CLO5 ✓

CLO6 ✓

CLO7 ✓

CLO8 ✓

CLO9 ✓

CLO10 ✓

Mapping of CLOs to PLOs of Curriculum BIT_IA

PLOs
CLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 ✓

CLO2 ✓

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 2/8
09:40, 27/01/2022 FPT University Learning Materials

Mapping of CLOs to PLOs of Curriculum BIT_IA

CLO3 ✓

CLO4 ✓

CLO5 ✓

CLO6 ✓

CLO7 ✓

CLO8 ✓

CLO9 ✓

CLO10 ✓

Mapping of CLOs to PLOs of Curriculum BIT_AI

PLOs
CLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 ✓

CLO2 ✓

CLO3 ✓

CLO4 ✓

CLO5 ✓

CLO6 ✓

CLO7 ✓

CLO8 ✓

CLO9 ✓

CLO10 ✓

Download All Teacher Material

Download All Student Material
30 sessions (90'/session)

SessionNo Topic LO ITU StudentMaterials S- TeacherMaterials T- Activity URLs LecturerTasks LTMethod

Download Download

1 Chapter 1: LO1 I Textbook/References OSG202 Textbook/References OSG202 Read chapter 1 in the     Offline
Introduction

Slides Slides Textbook

1.1. What is an Focus on 1.1, 1.2

operating
system

1.2. History of
operating
system

2 1.3. Computer LO1 ITU Textbook/References OSG202 Textbook/References OSG202 Read chapter 1 in the     Offline
hardware Slides Slides textbook
review

Chapter 1
Problems

3 Overview of LO7, TU Tutorial Labs   Tutorial Labs   Research     Offline

Linux Operating LO8, Internet/Textbook/References
system

LO9 at home in advance

Overview of Do practice
Linux
Command

Short practice
of using Linux
OS

4 1.4 The LO1 IT Textbook/References   Textbook/References   Read chapter 1 in the     Offline

Operating Slides Slides textbook

System Zoo

Focus on 1.4, 1.5, 1.7

1.5 Operating
System
Concepts

1.6 System
Calls

1.7 Operating
System
Structure

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 3/8
09:40, 27/01/2022 FPT University Learning Materials

5 - Chapter 1 LO1, U Tutorial Labs   Tutorial Labs   Do Lab     Offline

Problems

LO7,
- Guiding Lab 1 LO8,
LO9

6 Chapter 2: LO2 ITU Textbook/References   Textbook/References   Read chapter 2 in the     Offline

Processes and Slides Slides textbook

Threads

Focus on 2.1, 2.2

2.1 Processes

2.2 Threads

2.3
Interprocess
Communication

7 - Chapter 2 LO2, U Tutorial Labs   Tutorial Labs         Offline

Problems

LO7,
- Review Lab 1

LO8,
- Guiding Lab 2 LO9

8 - Chapter 2 LO2, TU Textbook/References   Textbook/References   Read chapter 2 in the     Offline

Problems

LO7, Slides Slides textbook

2.4 Scheduling LO8, Focus on 2.4

LO9

9 2.5 Classical LO2, TU Textbook/References   Textbook/References         Offline

IPC Problems

LO7, Slides Slides

- Chapter 2 LO8,
Problems LO9

10 Shell LO7, T Tutorial Labs   Tutorial Labs   Do lab     Offline

programming

LO8,
Practice shell LO9
programming

11 Practice shell LO7, U Tutorial Labs   Tutorial Labs   Do lab     Offline

programming LO8,
LO9

12 - Review Lab 2 LO3, T Textbook/References   Textbook/References   Read chapter 3 in the     Offline

- Chapter 2 LO8 Slides Slides textbook

Problems

Focus on 3.2
Chapter 3:
Memory
management

3.1 No Memory
Abstraction

3.2 A Memory
Abstraction:
Address
Spaces

13 3.3 Virtual LO3, T Textbook/References   Textbook/References   Read chapter 3 in the     Offline

Memory

LO8 Slides Slides textbook

3.4 Page Focus on 3.3, 3.4

Replacement
Algorithms

14 Guiding LO3, I Textbook/References   Textbook/References   Working in group

    Offline
Presentation - LO8 Tutorial Labs Tutorial Labs Do lab
topic's selection
- Chapter 7:
Virtuallization
and The Cloud

- Chapter 10:
CASE STUDY 1:
UNIX, LINUX,
and ANDROID

- Chapter 11:
CASE STUDY 2:
WINDOWS 8

15 3.5 Design LO3, T Textbook/References   Textbook/References   Read chapter 3 in the     Offline

Issues for LO8 Slides Slides textbook

Paging Focus on 3.5, 3.7

Systems

3.6
Implementation
Issues

3.7
Segmentation

16 - Chapter 3 LO3, TU Textbook/References   Textbook/References         Offline

Problems

LO8
- Guilding lab 3

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 4/8
09:40, 27/01/2022 FPT University Learning Materials

17 - Chapter 3 LO3, TU Tutorial Labs   Tutorial Labs   Do Lab     Offline

Problems

LO8
Progress Test 1
and Review

Review
Problems

18 Chapter 4: Files

LO4, IT Textbook/References   Textbook/References   Read chapter 4 in the     Offline

4.1 Files

LO9, Slides Slides textbook

4.2 Directories

LO10 Focus on 4.1, 4.2, 4.3, 4.4.

4.3 File System
Implementation
4.4 File System
Management
and
Optimization

4.5 Example
File Systems

19 - Review Lab 3

LO4, U Tutorial Labs   Tutorial Labs   Do Lab     Offline

- Guiding Lab 4 LO9,
- Chapter 4 LO10
Problems

20 C programming LO4, T Tutorial Labs   Tutorial Labs   Do Lab     Offline

in Linux

LO9,
Guiding Lab LO10

21 Chapter 5: LO4, U Textbook/References   Textbook/Reference

  Do Lab

    Offline
Input/ Output

LO5, Slides

Slides

Read chapter 5 in the

5.1 Principles LO9, Tutorial Labs Tutorial Labs textbook

of I/O Hardware LO10 Focus on 5.1, 5.2

5.2 Principles
of I/O Software

22 5.3 I/O LO5, TU Textbook/References   Textbook/References   Read chapter 5 in the     Offline

Software LO10 Slides Slides textbook

Layers

Focus on 5.3, 5.4

5.4 Disks

23 5.5 Clocks

LO5, TU Textbook/References   Textbook/References   Read chapter 5 in the     Offline

5.6 User LO10 Slides Slides textbook

Intrefaces: Focus on 5.6

Keyboard,
Mouse, Monitor

24 5.7 Thin Clients

LO5, TU Tutorial Labs   Tutorial Labs   Read chapter 5 in the     Offline

5.8 Power LO10 textbook

Management

Focus on 5.8

- Review lab 4 Do Lab

- Chapter 5
Problems

25 Chapter 6: LO6, IT Textbook/References   Textbook/References   Read chapter 6 in the     Offline

Deadlock

LO9, Slides Slides textbook

6.1 Resources

LO10 Focus on 6.1, 6.2, 6.4

6.2 Introduction
to Deadlocks

6.3 The Ostrich

Algorithm

6.4 Deadlock
Detection and
Recovery

26 6.5 Deadlock LO6, ITU Textbook/References   Textbook/References   Read chapter 6 in the     Offline
Avoidance

LO9, Slides

Slides

textbook

6.6 Deadlock LO10 Tutorial Labs Tutorial Labs Focus on 6.5, 6.6
Prevention

6.7 Other
Issues

- Chapter 6
Problems

27 Guiding LO6, TU               Offline

Problems

LO9,
Progress Test 2 LO10
and Review

Review
Problems

28 Chapter 7, 10,   T               Offline

11 Presentation

29 Chapter 7, 10,   T               Offline

11 Presentation

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 5/8
09:40, 27/01/2022 FPT University Learning Materials

30 Discussion of   I, T               Offline
current
research areas.
Review Course

63 Constructive question(s)

  Session Name Details

No

1 2 CQ1 What happens if a computer doesn't have an operating system? Why?

2 2 CQ2 The operating system has gone through 5 generations. What are your thoughts on the 6th generation operating system? What is
the basis for these arguments?

3 2 CQ3 Why does an OS need a process tree? Without this process tree, how will the operating system handle it?

4 2 CQ4 What is the mechanism by which a computer can understand a new device?

5 3 CQ1 What is the latest and greatest version of Ubuntu specification?

6 3 CQ2 Open source code is all open source code for users to edit. How can the author protect the copyright of the software?

7 3 CQ3 What feature when installing ubuntu that windows does not have?

8 4 CQ1 What if a running process is being taken over by another process? Are there any options that can be addressed?

9 4 CQ2 Instructions relating to accessing I / O devices are usually privileged instructions, meaning that they can be executed in kernel
mode but not in user mode. Give the reason why these tutorials are privileged?

10 4 CQ3 There are several design goals in building an operating system, for example, using resources, power, etc. Give an example of two
possibly conflicting design goals, re-expressing why they are contradictory.

11 4 CQ4 Modern operating systems separate an address space from the machine's physical memory. Can you list what the advantages of
this design are? (List at least 2 advantages)

12 5 CQ1 What commands can be run on teminar but command promt or powershell cannot run?

13 5 CQ2 What commands can be used to control another computer in SSH? Illustrate the command control process. (Screenshot attached)

14 6 CQ1 In Fig. 2-2, three process statuses are displayed. In theory, with three states, there could be six transitions, two of each. However,
only four transitions are displayed. Are there any cases where either or both of the missing conversions might occur?

15 6 CQ2 In modern computers it is assumed that at least one part of the interrupt handler program is written in Assembly language. In your
opinion, is the above statement true or false and why?

16 6 CQ3 A computer system has enough space to hold five programs in its main memory. These programs are waiting for I / O to be
inactive for half the time. What part of CPU time is wasted? Why?

17 6 CQ4 Consider a multi-program system with 6 programs in memory at the same time. Assume that each process spends 40% of its time
waiting for I / O. What will CPU usage be like?

18 7 CQ1 What special case must use parameter passing in the script?

19 7 CQ2 Why don't new terminals need to add "#!/bin/bash" before shell scripts? Is there any difference in this usage? Explain.

20 8 CQ1 Consider a system in which threads are executed entirely in user space, with the system running one interrupt every second.
Assume that an interrupt occurs while some thread is executing in the system runtime. What problems can happen? Can you
suggest a way to solve it?

21 8 CQ2 Peterson's solution to the mutual exclusion problem, is presented in FIG. 2-24, active when process scheduling is prioritized? How
about when it is without priority?

22 8 CQ3 Can the priority inversion issue that discussed in Section. 2.3.4 happen to user-level threads? Why or why not?

23 8 CQ4 If a system has only two processes, would it make sense to use a barrier to synchronize them? Why or why not?

24 10 CQ1 How to make shell script executable from anywhere in terminal?

25 10 CQ2 Is it possible to use real numbers (float data type) in terminal? Why?

26 10 CQ3 In what cases is it mandatory to use "case...esac" but not "if...else...fi"? Give an illustrative example.

27 12 CQ1 In Figure 3-3, the base register and the limit register contain the same value, 16,384. Is this just a bug, or are they always the same?
It's just an accident, why are they the same in this example?

28 12 CQ2 Consider a swap system in which memory consists of the following hole sizes in memory order: 10 MB, 4 MB, 20 MB, 18 MB, 7 MB,
9 MB, 12 MB and 15. MB.
Any hole is made for consecutive segment's requirements
(a) 12 MB
(b) 10 MB
(c) 9 MB
for the first
match? Now repeat the question for the next best match.

29 13 CQ1 What is the difference between a real address and a virtual address? If you have suggestions, would you like to add another one?

30 13 CQ2 "Copy on write" is an interesting idea used on the server system. What does it mean on a smartphone?

31 13 CQ3 If an instruction occupies 1 nsec and the page error takes n nsec more, please come up with the formula for effective instruction
time if a page error occurs every k commands.

32 15 CQ1 The computer has a 32-bit address using a two-level page table. The virtual address is divided into a 9-bit top-level page table field,
an 11-bit second-level page table field, and the offset. What is the size of the pages and how many pages are in the address space?

33 15 CQ2 A computer has 32-bit virtual addresses and 4 KB pages. Program and data match on the lowest page (0–4095). How many
entries in the page table are required if traditional (single-level) pagination is used? How many paging table entries are required for
two-level paging, with 10 bits in each section?

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 6/8
09:40, 27/01/2022 FPT University Learning Materials

34 16 CQ1 How can the combined memory device needed for the TLB be implemented in hardware and what is the implications of such a
design for scalability?

35 16 CQ2 A student in a compiler design course proposes to the professor a compiler writing project that will generate a list of page
references that can be used to implement the optimal page replacement algorithm. Is this possible? Why or why not? Is there
anything that can be done to improve paging efficiency at runtime?

36 18 CQ1 Sequential file support systems always have file rewind. Do systems that support random access files need this?

37 18 CQ2 Some operating systems offer renaming system calls to give the file a new name. Is there a difference between using this call to
rename a file and just copying the file to a new file with the new name, then deleting the old one?

38 18 CQ3 A simple operating system supports only a single directory but allows it to have arbitrary files with arbitrarily long filenames. Is it
possible to emulate something close to the hierarchical file system? How?

39 18 CQ4 Consider node i shown in FIG. 4-13. If it contains 10 direct addresses and each address has 8 bytes and all disk blocks are 1024 KB
in size, what is the largest file possible?

40 19 CQ1 For an external USB hard drive attached to a computer, which one is better: write-through cache or block cache?

41 19 CQ2 In many UNIX systems, the i buttons are kept at the top of disk. An alternative design is to allocate a node i when the file is created
and place node i at the top of the file's first block. Discuss the pros and cons of this workaround.

42 21 CQ1 Advances in chip technology have allowed the entire controller, including all bus access logic, to be placed on an inexpensive chip.
How does that affect the model of Fig 1-6?

43 21 CQ2 Explain the balance between precise interrupt and incorrect interrupt on supperscalar machine?

44 21 CQ3 With the speeds listed in Figure 5-1, is it possible to scan documents from the scanner and transmit them over the 802.11g
network at full speed? Why?

45 22 CQ1 Assume that a computer can read or write one from 5 nsec internal memory. Also assume that when an interrupt occurs, all 32
CPU registers, plus the program counter and PSW, are pushed onto the stack. What is the maximum number of interrupts per
second this machine can handle?

46 22 CQ2 CPU architects know that operating system writers hate inaccurate interrupts. One way to please the user of the operating system
is that the CPU stops issuing new instructions when the interrupt is signaled, but allows all instructions currently being executed to
terminate, then forces the interrupt. Does this approach have any disadvantages? Why?

47 22 CQ3 Compare RAID 0 to 5 for read/write performance, space cost and reliability

48 23 CQ1 After receiving a DEL (SIGINT) character, the screen driver removes all outputs currently queued for that display. Why?

49 23 CQ2 The main additive colors are red, green and blue, which means any color can be produced from linear superposition of these
colors. Is it possible someone has a color photo that cannot be represented in full 24-bit color?

50 23 CQ3 In Figure 5-36 there is a class to RegisterClass. In the corresponding Window X code, in Fig 5-34, there is no such call or anything
like that. Why not?

51 24 CQ1 What are the pros and cons of thin clients?

52 24 CQ2 A thin-client terminal is used to render a Web page containing 400 pixels by 160 pixels of animation running at 10 frames per
second. What percentage of Fast Ethernet 100 Mbps is consumed when displaying cartoons?

53 24 CQ3 Laptops are set up to take full advantage of power saving features including turning off the screen and hard disk after periods of
inactivity. The user sometimes runs UNIX programs in text mode and other times uses the Windows X System. She is surprised to
find that the battery life is significantly better when she uses only programs. document. Why?

54 25 CQ1 Students working with personal computers in the computer lab send their files to be printed by a server that damages files on the
hard disk. Under what conditions can a deadlock occur if the disk space for the print tube is limited? How can deadlock be
avoided?

55 25 CQ2 In Figure 6-1, resources are returned in the reverse order of their acquisition. Is it good to return them in another order?

56 25 CQ3 Is it possible for a resource deadlock involving multiple units of one type and a single unit of another? If so, please give an
example.

57 26 CQ1 The ostrich algorithm discussion refers to the ability of progress board to fill slots or other system boards. Can you suggest a way
to allow a system administrator to recover from such a situation?

58 26 CQ2 Can use the resource trajectory scheme in Fig. 6-8 to illustrate the deadlock problem with three processes and three resources? If
so, how can this be done? If not, why not?

59 26 CQ3 Assume that process A in Figure 6-12 requires the final tape drive. Will this action lead to a standoff?

60 28 CQ1 The main memory units have a priority in swap systems and virtual memory. Processors are given priority in a time-sharing
environment. Do you think these preemption methods were developed to deal with resource bottlenecks or for other purposes?
How high are their costs?

61 28 CQ2 Explain the differences between deadlock, livelock, and starvation.

62 29 CQ1 Is there any difference in solving a problem with a shell command and a command in C?

63 29 CQ2 In programming with IDE with programming with files and using libraries to compile, which way is better and faster? Given the
advantages of the two methods, can you suggest other methods?

4 assessment(s)

Category Type Part Weight Completion Duration LO Question Type No Question Knowledge and Skill Grading Note
Criteria Guide

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 7/8
09:40, 27/01/2022 FPT University Learning Materials

Lab on- 4 20.0% >0 in lab LO7, practical N/A technical aspect of guided by  
going session LO8, exercises studied topics instructor
LO9,
LO10

Presentation on- 1 20.0% >0 ~20'/group LO1,   N/A a selelected topic prepare at  
going LO2, home,
LO3, working in
LO4, group,
LO5, present in
LO6 class hours

Progress on- 2 20.0% >0 10'-30' LO1, Multiple 10-30 (At least Current chapter(s)

in Instruction and
test going LO2, choicesMarked 10*n questions Each Progess Test covers class/remote, shedules for Progress
LO3, by Computer where n is the at least 01 Chapter and at by instructor

tests must be
LO4, or a suitable number of most 03 Chapters, and presented in the
LO5, format Chapters overall they must cover all Course
LO6 covered in the learned Chapters of the Implementation Plan
test.) course. approved by director of
the campus.

Progress test must be

taken right after the
last lectures of
required material.

Instructor has
resposibility to review
the test for students
after graded.

Final exam final 1 40.0% 4 60' LO1, Multiple 50 concepts, algorithms; by exam  
exam LO2, choicesMarked All chapters from 1 to 6; board,
LO3, by Computer more than 70% new
LO4, questions (for the current
LO5, semester);

LO6

https://flm.fpt.edu.vn/gui/role/teacher/SyllabusDetails?sylID=5166 8/8