What types of folders are easy to organize and exploit, but make it difficult to name the files that

don't overlap and users can't group files and search slowly?

A. 1-level directory

B. 2-level directory

C. Multi-level directory

D. None of the mentioned

In the file system of the first MS-DOS sector, track 0, side 0 for the hard disk, information
about_________

A. Boot sector

B. Partition table

C. FAT table

D. Common data

For a 20M disk with the size of 1K, if managing free volumes using DSLK how many blocks will it
take to manage this disk:

A. 20 blocks

B. 40 blocks

C. 80 blocks

D. 16 blocks

___________ begins at the root and follows a path down to the specified file.

A. Standalone name

B. Relative path name

C. Absolute path name

D. All of the mentioned

The deletion of a link, ________ the original file.

A. deletes

B. affects

C. does not affect

D. none of the mentioned

Consider a disk where blocks 2,3,4,5,8,9,10,11,12,13,17,18,25,26 and 27 are free and the rest of the
blocks are allocated. Then the free space bit map would be :

A. 10000110000001110011111100011111…

B. 110000110000001110011111100011111…

C. 01111001111110001100000011100000…

D. 001111001111110001100000011100000…

As disks have relatively low transfer rates and relatively high latency rates, disk schedulers must
reduce latency times to :

A. ensure high bandwidth

B. ensure low bandwidth

C. make sure data is transferred

D. reduce data transfer speeds

______ is a unique tag, usually a number identifies the file within the file system.

A. File identifier

B. File name
C. File type

D. None of the mentioned

To create a file ____________

A. allocate the space in file system

B. make an entry for new file in directory

C. allocate the space in file system & make an entry for new file in directory

D. none of the mentioned

By using the specific system call, we can ____________

A. open the file

B. read the file

C. write into the file

D. all of the mentioned

File type can be represented by ____________

A. file name

B. file extension

C. file identifier

D. none of the mentioned

What is the mounting of file system?

A. crating of a filesystem

B. deleting a filesystem
C. attaching portion of the file system into a directory structure

D. removing the portion of the file system into a directory structure

A file control block contains the information about ____________

A. file ownership

B. file permissions

C. location of file contents

D. all of the mentioned

To create a new file application program calls ____________

A. basic file system

B. logical file system

C. file-organisation module

D. none of the mentioned

The data structure used for file directory is called ____________

A. mount table

B. hash table

C. file table

D. process table

If the block of free-space list is free then bit will ____________

A. 1

B. 0
C. any of 0 or 1

D. none of the mentioned

File attributes consist of ____________

A. name

B. type

C. identifier

D. all of the mentioned

The turnaround time for short jobs during multiprogramming is usually Shortened and that for long
jobs is slightly ___________?

A. Shortened

B. Unchanged

C. Lengthened

D. Unshortened

Time quantum can be said?

A. Multilevel queue scheduling algorithm

B. Round-robin scheduling algorithm

C. Shortest job scheduling algorithm

D. Priority scheduling algorithm

In UNIX, Which system call creates the new process?

A. Fork
B. Create

C. New

D. None of the mentioned

The new process consists of a copy of the____of the original process. This mechanism allows the
parent process to communicate easily with its child process.

A. Address space

B. Process state

C. Process number

D. Process identifiers

What are two ways to keep track of memory usages?

A.Physical and Virtual Lists.

B.Virtual and Linked Lists.

C.Physical and Linked Lists.

D.Bit Maps and Linked Lists.

How does First-fit strategy work?

A.Allocate the smallest hole that is big enough; must search entire list, unless ordered by size.

B.Allocate the largest hole; must also search entire list.

C.Allocate the first hole that is big enough.

D.Start seaching the list from the place where it left off last time.

A entry of the Process table is called: ______

A. All of the other choices

B. Process check block

C. Process management block

D. Process control block

Which of the following do not belong to queues for processes?

A. Job Queue

B. PCB queue

C. Device Queue

D. Ready Queue

A parent process calling _____ system call will be suspended until children processes terminate.

A. wait

B. fork

C. exit

D. exec

The child process can __________

A. be a duplicate of the parent process

B. never be a duplicate of the parent process

C. cannot have another program loaded into it

D. never have another program loaded into it

The entry of all the PCBs of the current processes is in __________

A. Process Register

B. Program Counter

C. Process Table

D. Process Unit

A single thread of control allows the process to perform __________

A. only one task at a time

B. multiple tasks at a time

C. only two tasks at a time

D. all of the mentioned

If a process is executing in its critical section, then no other processes can be executing in their
critical section. What is this condition called?

A. mutual exclusion

B. critical exclusion

C. synchronous exclusion

D. asynchronous exclusion

Which one of the following is a synchronization tool?

A. thread

B. pipe

C. semaphore

D. socket
When high priority task is indirectly preempted by medium priority task effectively inverting the
relative priority of the two tasks, the scenario is called __________

A. priority inversion

B. priority removal

C. priority exchange

D. priority modification

To enable a process to wait within the monitor __________

A. a condition variable must be declared as condition

B. condition variables must be used as boolean objects

C. semaphore must be used

D. all of the mentioned

In the non blocking send __________

A. the sending process keeps sending until the message is received

B. the sending process sends the message and resumes operation

C. the sending process keeps sending until it receives a message

D. none of the mentioned

//////////////////////

Câu 1. Calculate the capacity of a floppy disk with 40 cylinders, 2 tracks per cylinder, 9 sectors per track, and
A. 360 KB
B. 80 KB
C. 18 KB
D. 512 KB
Câu 2. Which type of RAID (Redundant Array of Independent Disks) does not support redundancy?
A. RAID 0
B. RAID 1
C. RAID 2
D. RAID 5
Câu 3. In early operating systems, how were programs executed?
A. Sequentially with no concurrency
B. Concurrently with virtual memory
C. Randomly scheduled
D. None of the above
Assume that the head of a hard disk is currently at cylinder 8. The requested cylinders, in order, are: 11
Câu 4.
Come First-Served) algorithm?
A. 89
B. 34
C. 50
D. 80
Câu 5. An embedded operating system is designed for:
A. Dedicated functions within a device
B. Consumer-level desktop computers
C. High-performance servers
D. None of the above
Câu 6. What is a key difference between processes and threads?
A. Threads share memory space
B. Processes share memory space
C. Processes are faster than threads
D. None of the above
Câu 7. The primary role of the memory manager is to:
A. Track free and allocated memory
B. Manage user login information
C. Monitor CPU speed
D. Control file systems
Câu 8. Swapping is a method used in:
A. I/O management
B. Process scheduling
C. Memory management
D. Network communication
Câu 9. Which of the following describes virtual memory?
A. It extends RAM capacity
B. It stores programs permanently
C. It does not require paging
D. It stores data in the CPU registers
Câu 10. A memory hierarchy is used to manage:
A. Memory speeds and costs
B. Software updates
C. CPU processes
D. Network packets
Câu 11. Which is a primary role of a file system?
A. Organize data in directories and files
B. Run user applications
C. Manage printer output
D. Control CPU scheduling
Câu 12. File naming is important because:
A. It allows users to identify and access files easily
 B. It ensures data safety
C. It reduces memory consumption
D. It eliminates fragmentation
Câu 13. Which file structure is the most commonly used in modern systems?
A. Single-level
B. Hierarchical
C. Networked
D. None of the above
Assume that the head of a hard disk is currently at cylinder 8. The requested cylinders, in order, are: 11
Câu 14.
seek first) algorithm?
A. 50
B. 34
C. 48
D. 32
Câu 15. Which of these is an I/O principle?
A. Memory swapping
B. Interrupt handling
C. Process threading
D. Deadlock prevention
Câu 16. Memory-mapped I/O connects devices directly to:
A. Main memory
B. Disk storage
C. CPU registers
D. The network interface
Câu 17. Direct Memory Access (DMA) is used to:
A. Allow devices to directly access memory without CPU
B. Control CPU scheduling
C. Extend physical memory capacity
D. Transfer data within the CPU only

Câu 18. Disk scheduling algorithms primarily improve:

A. CPU performance
B. Disk read/write efficiency
C. File security
D. Network access speeds
Câu 19. Programmed I/O is different from interrupt-driven I/O because:
A. It waits for devices to be ready
B. It handles data automatically
C. It is more efficient for high-speed devices
D. It transfers data directly to network devices

Câu 20. A deadlock occurs when:

A. All processes share the same resources
B. Processes wait indefinitely for resources held by each other
C. Memory space is insufficient for process allocation
D. Processes fail to access CPU time

Câu 21. Which of the following is not a deadlock prevention technique?

 A. Resource sharing
B. Avoiding circular wait
C. Preempting resources
D. Mutual exclusion enforcement

Câu 22. The Banker's algorithm is used for:

A. Deadlock detection
B. Deadlock prevention
C. Deadlock avoidance
D. Process synchronization

Câu 23. A file has a size of 2200 bytes. The size of each block is 512 bytes. How many blocks does this file occ
A. 4
B. 5
C. 6
D. 7

Câu 24. Which of the following is not correct about the main classes of I/O devices?
A. Character devices
B. Block devices and Character devices
C. Stream devices
D. Block devices

Câu 25. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
A. First-come first-served scheduling
B. Shortest job scheduling
C. Priority scheduling
D. Longest job scheduling

PHẦN 2

Câu 1. Calculate the capacity of a floppy disk with 40 cylinders, 2 tracks per cylinder, 9 sectors per track, and
A. 360 KB
B. 80 KB
C. 18 KB
D. 512 KB
Câu 2. Which type of RAID (Redundant Array of Independent Disks) does not support redundancy?
A. RAID 0
B. RAID 1
C. RAID 2
D. RAID 5
Câu 3. In early operating systems, how were programs executed?
A. Sequentially with no concurrency
B. Concurrently with virtual memory
C. Randomly scheduled
D. None of the above
Câu 4. Assume that the head of a hard disk is currently at cylinder 8. The requested cylinders, in order, are: 11
 Come First-Served) algorithm?
A. 89
B. 34
C. 50
D. 80
Câu 5. An embedded operating system is designed for:
A. Dedicated functions within a device
B. Consumer-level desktop computers
C. High-performance servers
D. None of the above
Câu 6. What is a key difference between processes and threads?
A. Threads share memory space
B. Processes share memory space
C. Processes are faster than threads
D. None of the above
Câu 7. The primary role of the memory manager is to:
A. Track free and allocated memory
B. Manage user login information
C. Monitor CPU speed
D. Control file systems
Câu 8. Swapping is a method used in:
A. I/O management
B. Process scheduling
C. Memory management
D. Network communication
Câu 9. Which of the following describes virtual memory?
A. It extends RAM capacity
B. It stores programs permanently
C. It does not require paging
D. It stores data in the CPU registers
Câu 10. A memory hierarchy is used to manage:
A. Memory speeds and costs
B. Software updates
C. CPU processes
D. Network packets
Câu 11. Which is a primary role of a file system?
A. Organize data in directories and files
B. Run user applications
C. Manage printer output
D. Control CPU scheduling
Câu 12. File naming is important because:
A. It allows users to identify and access files easily
B. It ensures data safety
C. It reduces memory consumption
D. It eliminates fragmentation
Câu 13. Which file structure is the most commonly used in modern systems?
A. Single-level
B. Hierarchical
 C. Networked
D. None of the above
Assume that the head of a hard disk is currently at cylinder 8. The requested cylinders, in order, are: 11
Câu 14.
seek first) algorithm?
A. 50
B. 34
C. 48
D. 32
Câu 15. Which of these is an I/O principle?
A. Memory swapping
B. Interrupt handling
C. Process threading
D. Deadlock prevention
Câu 16. Memory-mapped I/O connects devices directly to:
A. Main memory
B. Disk storage
C. CPU registers
D. The network interface
Câu 17. Direct Memory Access (DMA) is used to:
A. Allow devices to directly access memory without CPU
B. Control CPU scheduling
C. Extend physical memory capacity
D. Transfer data within the CPU only

Câu 18. Disk scheduling algorithms primarily improve:

A. CPU performance
B. Disk read/write efficiency
C. File security
D. Network access speeds
Câu 19. Programmed I/O is different from interrupt-driven I/O because:
A. It waits for devices to be ready
B. It handles data automatically
C. It is more efficient for high-speed devices
D. It transfers data directly to network devices

Câu 20. A deadlock occurs when:

A. All processes share the same resources
B. Processes wait indefinitely for resources held by each other
C. Memory space is insufficient for process allocation
D. Processes fail to access CPU time

Câu 21. Which of the following is not a deadlock prevention technique?

A. Resource sharing
B. Avoiding circular wait
C. Preempting resources
D. Mutual exclusion enforcement

Câu 22. The Banker's algorithm is used for:

 A. Deadlock detection
B. Deadlock prevention
C. Deadlock avoidance
D. Process synchronization

Câu 23. A file has a size of 2200 bytes. The size of each block is 512 bytes. How many blocks does this file occ
A. 4
B. 5
C. 6
D. 7

Câu 24. Which of the following is not correct about the main classes of I/O devices?
A. Character devices
B. Block devices and Character devices
C. Stream devices
D. Block devices

Câu 25. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
A. First-come first-served scheduling
B. Shortest job scheduling
C. Priority scheduling
D. Longest job scheduling
// ÔN TOÁN

ĐỌC PHẦN NÀY TRƯỚC KHI LÀM BÀI TẬP BÊN DƯỚI

Thuật toán First fit + Thuật toán Best fit + Thuật toán Worst fit

First-fit: cấp phát lỗ trống đầu tiên đủ lớn. Tìm kiếm có thể bắt đầu tại đầu tập hợp các lỗ trống hay
tại điểm kết thúc của tìm kiếm first-fit trước đó. Chúng ta dừng tìm kiếm ngay khi chúng ta tìm thấy
một lỗ trống đủ lớn.
Best-fit: cấp phát lỗ trống nhỏ nhất đủ lớn. Chúng ta phải tìm toàn bộ danh sách, trừ khi danh sách
được xếp thứ tự theo kích thước. Chiến lược này tạo ra lỗ trống nhỏ nhất còn thừa lại.
Worst-fit: cấp phát lỗ trống lớn nhất. Chúng ta phải tìm toàn danh sách trừ khi nó được xếp theo thứ
tự kích thước. Chiến lược này tạo ra lỗ trống còn lại lớn nhất mà có thể có ích hơn lỗ trống nhỏ từ
tiếp cận best-fit.
Các mô phỏng hiển thị rằng cả first-fit và best-fit là tốt hơn worst-fit về việc giảm thời gian và sử
dụng lưu trữ. Giữa first-fit và best-fit không thể xác định rõ chiến lược nào tốt hơn về sử dụng lưu
trữ, nhưng first-fit có tốc độ nhanh hơn.

Trắc nghiệm:

. Using FCFS (First Come First Served) algorithm, find the average waiting time for the
following processes with the given data in the order Process : Arrival Time : Burst Time respectively
A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.
A. 2,1

B. 3

C. 5

D. 4,5

. Using FCFS (First Come First Served) algorithm, find the order of execution for the
following processes with the given data in the order Process : Arrival Time : Burst Time respectively
A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

A. B, D, A, C

B. B, A, C, D

C. B, C, A, D

D. B, A, D, C

. Using SJF (non-preemptive) algorithm, find the average waiting time for the following
processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2;
B : 0 : 6; C : 7 : 1; D : 4 : 3.

A. 3,5

B. 2,5

C. 2

D. 4

. Using SJF (non-preemptive) algorithm, find the order of execution for the following
processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2;
B : 0 : 6; C : 7 : 1; D : 4 : 3.

A. B, A, C, D

B. B, D, A, C

C. B, A, D, C

D. B, C, A, D

. Using SRTF algorithm, find the average waiting time for the following processes with the
given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1;
D : 4 : 3.
A. 1

B. 1,5

C. 2,5

D. 2

. Using SRTF algorithm, find the order of execution for the following processes with the
given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1;
D : 4 : 3.

A. B, D, A, C, D

B. B, A, B, C, A

C. B, C, A, D, B

D. B, A, D, C, B

. Using RR (Round-Robin) algorithm with time quantum: 3, find the average waiting time for
the following processes with the given data in the order Process : Arrival Time : Burst Time
respectively A : 2 : 2; B : 0 : 6; C : 7 : 1.

A. 2,333

B. 1,333

C. 5,333

D. 4,333

. Using RR (Round-Robin) algorithm with time quantum: 3, find the order of execution for
the following processes with the given data in the order Process : Arrival Time : Burst Time
respectively A : 2 : 2; B : 0 : 6; C : 7 : 1.

A. B, A, D, C

B. B, C, A, D

C. B, A, B, C

D. B, C, D, A

. Using Priority (non-preemptive) algorithm, find the average waiting time for the following
processes with the given data in the order Process : Burst Time : Priority (0 is the highest priority)
respectively A : 2 : 2; B : 3 : 6; C : 7 : 1; D : 4 : 3.
A. 7,25

B. 8,25

C. 9

D. 8

. Using Priority (non-preemptive) algorithm, find the order of execution for the following
processes with the given data in the order Process : Burst Time : Priority (0 is the highest priority)
respectively A : 2 : 2; B : 3 : 6; C : 7 : 1; D : 4 : 3.

A. C, D, B, C

B. C, B, A, D

C. C, B, D, A

D. C, A, D, B

. A disk queue with requests for I/O to blocks on cylinders: 85 13 46 91 62, disk head is
initially at 50. Considering First Come First Serve (FCFS) scheduling, find the total head
movements?

A. 222

B. 127

C. 214

D. 337

. A disk queue with requests for I/O to blocks on cylinders: 85 13 46 91 62, disk head is
initially at 50. Considering Shortest Seek Time First (SSTF) scheduling, find the total head
movements?

A. 127

B. 214

C. 337

D. 119

. A disk queue with requests for I/O to blocks on cylinders: 85 13 46 91 62, disk head is
currently at position 50 and is moving in the increasing direction. The track range is from 1 to 200.
Considering Elevator (SCAN) scheduling, find the total head movements?
A. 119

B. 214

C. 127

D. 337

. A memory has partitions with sizes (in KB): 15, 52, 22, 37, 62, 44. If a process of size 31
KB requests memory, which partition size (in KB) will be chosen if using the First Fit method?

A. 52

B. 44

C. 62

D. 15

. A memory has partitions with sizes (in KB): 15, 52, 22, 37, 62, 45. If a process of size 26
KB requests memory, which partition size (in KB) will be chosen if using the Best Fit method?

A. 62

B. 22

C. 37

D. 45

. A memory has partitions with sizes (in KB): 15, 52, 22, 37, 62, 46. If a process of size 41
KB requests memory, which partition size (in KB) will be chosen if using the Worst Fit method?

A. 22

B. 62

C. 37

D. 52