NIIE-ĐGHP-01 – ASSIGNMENT BRIEF

BIỂU MẪU ĐỀ ĐÁNH GIÁ GIỮA KỲ/CUỐI KỲ VỚI MÔN

KHÔNG TỔ CHỨC THI
ASSIGNMENT BRIEF

Course number and title 21BITV01, 21BITV02

Start date 28/11/2023

Deadline/hand-in 20/12/2023

Lectuer Trinh Huy Hoang

Assignment Final project

Verifier Tran Son Hai

Purpose of this assignment

Purpose of this assignment
Evaluate groups for solving some of discrete maths problems, from basic to advance aspect. Based
on this knowledge, students should be able to develop solutions by combine the exercises that have
been instructed with related techniques and software to thoroughly solve the requirements set forth.

Scenario
1. The class leader makes a list of registered students for an account, select a topic account and
register by class list.
2. Maximum of 5 students doing the same topic, each topic must fulfill the requirements of 4 types
of questions.
3. The project uses Unicode font: Times New Roman, size 13 font to write the report
4. Submit product in which create directory with folder named student name, containing text map
and program file.

1. Deadlock [2 Points]

Consider the following snapshot of a system (P=Process, R=Resource):

Available

RA RB RC RD

9 9 9 9
 NIIE-ĐGHP-01 – ASSIGNMENT BRIEF
BIỂU MẪU ĐỀ ĐÁNH GIÁ GIỮA KỲ/CUỐI KỲ VỚI MÔN
KHÔNG TỔ CHỨC THI
ASSIGNMENT BRIEF

Current Allocation

RA RB RC RD

P0 1 1 1 1

P1 0 1 2 0

P2 3 1 0 2

P3 1 2 1 0

P4 1 1 3 0

Describe about banker’s algorithm and calculate the Needs matrix

Needs

RA RB RC RD

P0

P1

P2

P3

P4

2. Page Replacement [2 points]

Given the following reference string: 0 2 0 3 1 2 0 1 3 5 0 1 4 5 4 3 4. Show:

2.1. Page replacement progress.
2.2. Page faults occur during the processing of the reference scheme?
2.3. What do you observe when you move from Scheme 1 to Scheme 2? Explain.
Scheme 1: FIFO with 3 pages of main memory
Scheme 2: FIFO with 4 pages of main memory`
 NIIE-ĐGHP-01 – ASSIGNMENT BRIEF
BIỂU MẪU ĐỀ ĐÁNH GIÁ GIỮA KỲ/CUỐI KỲ VỚI MÔN
KHÔNG TỔ CHỨC THI
ASSIGNMENT BRIEF

3. Process Scheduler [2 points]

Consider the following set of processes, with the length of the CPU burst and arrival time
given in milliseconds.
Process Burst Time Arrival time
P1 7 0
P2 8 3
P3 7 6

3.1. Draw four Gantt charts that illustrate the execution of these processes using the following
scheduling algorithms: FCFS, SJF, SRTN, Round Robin with q =4.
3.2. What is the waiting time and completion time of each process for each of the scheduling
algorithms in part a?
3.3. Which of the algorithms on part a results in the minimum average waiting time and
completion time (over all processes)?

4. Disk Scheduling [2 points]

Disk requests come into the disk driver for cylinders 20, 25, 22, 4, 40, 46, 88, and 38 in that order.
Assume that the disk has 100 cylinders.
A seek takes 6msec per cylinder moved. Compute the average seek time for the request sequence
given above for
4.1. First-come, First-served
4.2. Shortest Seek Time First (SSTF)
4.3. SCAN
In all the cases, the arm is initially at cylinder 52.

5. Application [2 points]

Introduction and instructions for using the following applications

5.1. How to use Process Explorer

5.2. How to use Winhex

5.3. How to do some actions on files

5.4. How to use CMD

5.5. How to use Sauce Lab cloud service (https://saucelabs.com/)