Janata Bank Limited
Post: Assistant System Administrator
Exam Date: 20/12/2021, Exam Taker: CTI
mkdir A
chmod 400 A
cp -r A P
Deadlock is a situation in an Operating System where two or more processes are unable to continue execution because each process is waiting for a resource that is held by another process.
Two Situations Where Deadlock Occurs
- Mutual Exclusion: A resource can be used by only one process at a time. If another process requests the same resource, it must wait until the resource is released.
- Circular Wait: Deadlock occurs when a group of processes form a circular chain where each process is waiting for a resource held by the next process in the chain.
Deadlock হলো Operating System-এর একটি অবস্থা যেখানে দুই বা ততোধিক process তাদের কাজ চালিয়ে যেতে পারে না, কারণ প্রতিটি process অন্য process-এর কাছে থাকা resource-এর জন্য অপেক্ষা করে।
Deadlock ঘটার দুটি পরিস্থিতি
- Mutual Exclusion: যখন একটি resource এক সময়ে শুধুমাত্র একটি process ব্যবহার করতে পারে। অন্য কোনো process সেই resource চাইলে তাকে অপেক্ষা করতে হয় যতক্ষণ না resourceটি মুক্ত হয়।
- Circular Wait: যখন কয়েকটি process একটি circular chain তৈরি করে এবং প্রতিটি process পরবর্তী process-এর কাছে থাকা resource-এর জন্য অপেক্ষা করে, তখন deadlock condition তৈরি হয়।
The language is:
{ w | w contains at least two a’s, OR exactly two b’s }
Regular Expressions:
Strings with at least two a’s:
(b|a)* a (b|a)* a (b|a)*
Strings with exactly two b’s:
a* b a* b a*
Combined Regular Expression (Union):
((a|b)*a(a|b)*a(a|b)*) | (a*b a*b a*)
a. What is the subnet mask of the above IP address?
b. How many host per subnet have?
c. What is the Broadcast address of this 10.20.30.0/3 IP address?
Given:
IP Address = 10.20.30.0/25
a) Subnet Mask
A /25 prefix means 25 bits are used for the network.
Subnet Mask = 255.255.255.128
Binary form:
11111111.11111111.11111111.10000000
b) Number of hosts per subnet
Host bits = 32 − 25 = 7 bits
Total IP addresses per subnet = 27 = 128
Usable hosts = 128 − 2 = 126 hosts
(2 addresses are reserved for network and broadcast)
c) Broadcast address
With /25, each subnet block size = 128.
Subnet range:
10.20.30.0 → 10.20.30.127
Network address = 10.20.30.0
Broadcast address = 10.20.30.127
Usable host range:
10.20.30.1 – 10.20.30.126
Final Answers:
| Question | Answer |
|---|---|
| Subnet Mask | 255.255.255.128 |
| Hosts per subnet | 126 usable hosts |
| Broadcast Address | 10.20.30.127 |
i. Draw ER diagram

Given:
Jobs: J1 = 90K, J2 = 20K, J3 = 50K, J4 = 200K
Blocks: B1 = 50K, B2 = 100K, B3 = 90K, B4 = 200K, B5 = 50K
1) First Fit Method
In First Fit, each job is placed in the first block that is large enough.
Step by step:
J1 = 90K → first block that fits is B2 = 100K
Remaining in B2 = 10K
J2 = 20K → first block that fits is B1 = 50K
Remaining in B1 = 30K
J3 = 50K → first block that fits is B3 = 90K
Remaining in B3 = 40K
J4 = 200K → first block that fits is B4 = 200K
Remaining in B4 = 0K
First Fit Allocation Table:
| Job | Size | Allocated Block | Block Size | Unused Space |
|---|---|---|---|---|
| J1 | 90K | B2 | 100K | 10K |
| J2 | 20K | B1 | 50K | 30K |
| J3 | 50K | B3 | 90K | 40K |
| J4 | 200K | B4 | 200K | 0K |
2) Best Fit Method
In Best Fit, each job is placed in the smallest block that can hold it.
Step by step:
J1 = 90K → best block is B3 = 90K
Remaining in B3 = 0K
J2 = 20K → best block is B1 = 50K
Remaining in B1 = 30K
J3 = 50K → best block is B5 = 50K
Remaining in B5 = 0K
J4 = 200K → best block is B4 = 200K
Remaining in B4 = 0K
Best Fit Allocation Table:
| Job | Size | Allocated Block | Block Size | Unused Space |
|---|---|---|---|---|
| J1 | 90K | B3 | 90K | 0K |
| J2 | 20K | B1 | 50K | 30K |
| J3 | 50K | B5 | 50K | 0K |
| J4 | 200K | B4 | 200K | 0K |
Final Answer:
First Fit allocation:
J1 → B2, J2 → B1, J3 → B3, J4 → B4
Best Fit allocation:
J1 → B3, J2 → B1, J3 → B5, J4 → B4
| Process | Burst Time | Arrival Time |
|---|---|---|
| P1 | 10 | 3 |
| P2 | 1 | 1 |
| P3 | 2 | 3 |
| P4 | 1 | 4 |
| P5 | 5 | 2 |
(i) Average waiting time for FCFS
(ii) Preemptive SJF
(iii) Round Robin (Quantum time: 3) scheduling algorithm



